Time supervision of concurrent systems using symbolic unfoldings of time Petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3829 LNCS, Issue , 2005, Pages 196-210

  Chatain, Thomas ^a   Jard, Claude ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; PROBLEM SOLVING; REAL TIME SYSTEMS; TIME VARYING SYSTEMS;

DENSE TIME; ON-THE-FLY; PARTIAL ORDERING; TRUE CONCURRENCY APPROACH;

PETRI NETS;

EID: 33745442540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603009_16     Document Type: Conference Paper

References (13)

1. Tuomas Aura and Johan Lilius. Time processes for time Petri nets. In ICATPN, pages 136-155, 1997.
2. A. Benveniste, E. Fabre, C. Jard, and S. Haar. Diagnosis of asynchronous discrete event systems, a net unfolding approach. IEEE Transactions on Automatic Control, 48(5):714-727, May 2003.
3. Bernard Berthomieu and Michel Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Software Eng., 17(3):259-273, 1991.
4. Bernard Berthomieu and François Vernadat. State class constructions for branching analysis of time Petri nets. In TACAS, pages 442-457, 2003.
5. Eike Best. Structure theory of Petri nets: the free choice hiatus. In Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I, pages 168-205, London, UK, 1987. Springer-Verlag.
6. Thomas Chatain and Claude Jard. Symbolic diagnosis of partially observable concurrent systems. In FORTE, pages 326-342, 2004.
7. Thomas Chatain and Claude Jard. Time supervision of concurrent systems using symbolic unfoldings of time petri nets. Technical Report RR-5706, Institut National de Recherche en Informatique et en Automatique (INRIA), 2005.
8. Joost Engelfriet. Branching processes of Petri nets. Acta Inf., 28(6):575-591, 1991.
9. Javier Esparza, Stefan Romer, and Walter Vogler. An improvement of McMillan's unfolding algorithm. In TACAS, pages 87-106, 1996.
10. Hans Fleischhack and Christian Stehno. Computing a finite prefix of a time Petri net. In ICATPN, pages 163-181, 2002.
11. P.M. Merlin and D.J. Farber. Recoverability of communication protocols - implications of a theorical study. IEEE Transactions on Communications, 24, 1976.
12. B. Pradin-Chézalviel, R. Valette, and L.A. Künzle. Scenario duration characterization of t-timed Petri nets using linear logic. In IEEE PNPM, pages 208-217, 1999.
13. Alexei Semenov and Alexandre Yakovlev. Verification of asynchronous circuits using time Petri net unfolding. In DAC'96: Proceedings of the 33rd annual conference on Design automation, pages 59-62, New York, NY, USA, 1996. ACM Press.