Reachability and temporal conflicts in t-time PetriNets

Proceedings - 9th International Workshop on Petri Nets and Performance Models, PNPM 2001

Volumn , Issue , 2001, Pages 229-238

  Riviere, Nicolas ^b   Pradin Chezalviel, Brigitte ^a   Valette, Robert ^a  

^a LAAS CNRS   (France)

^b IUT A UPS ^*

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

LINEAR LOGIC; PROOF TREE; REACHABILITY; SOJOURN TIME; T-TIME PETRI NET; TEMPORAL CONSTRAINTS;

PETRI NETS;

EID: 84861723100     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PNPM.2001.953372     Document Type: Conference Paper

References (8)

1. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using Time Petri nets. IEEE Trans. on Software Engineering, 17:259-273, 1992.
2. D. Dubois and H. Pade. Processing fuzzy temporal knowledge. IEEE transactions on Systems, Man and Cybernetics, 19(4):729-744,1989.
3. V. Gehlot. A proof theoretic approach to semantics of concurrency. Phd thesis, University of Pennsylvania, 1992.
4. Jean-Yves GIRARD. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
5. Francois GIRAULT. Formalisation en logique linkaire du fonctionnement des rkseaux de Petri. PhD thesis, Universite Paul Sabatier, Toulouse, France, Dtcembre 1997.
6. M. Menasche and B. Berthomieu. Time Petri nets for analysing and verifying time dependent protocols. Third international workshop onprotocol specification, testing and verification, June 1983.
7. P. Merlin and D.J. Farber. Recoverability of communication protocols: implementation of a theoretical study. IEEE Trans. on communications, COM-24(9 September): 1036-1043,1976.
8. B. Pradin-Chezalviel,R. Valette, and L.A. Kunzle. Scenario duration characterization of t-timed Petri nets using linear logic. In IEEE PNPM'99, pages 208-2 17, Zaragoza, Spain, September 6-10 1999.