When are timed automata weakly timed bisimilar to time petri nets?

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

Volumn 3821 LNCS, Issue , 2005, Pages 273-284

  Bérard, Beatrice ^a   Cassez, Franck ^b   Haddad, Serge ^a   Lime, Didier ^c   Roux, Olivier H ^b  

^a Centre National de la Recherche Scientifique   (France)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^c CISS   (Denmark)

Author keywords

Time Petri Nets; Timed Automata; Weak Timed Bisimilarity

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SIMULATION; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

BISIMULATION RELATION; TIME PETRI NETS (TPN); TIMED AUTOMATA (TA); WEAK TIMED BISIMILARITY;

PETRI NETS;

EID: 33744917542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_22     Document Type: Conference Paper

References (14)

1. L. Aceto and F. Laroussinie. Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. Journal of Logic and Algebraic Programming, volume 52-53, pages 7-51. Elsevier Science Publishers, august 2002.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science B, 126:183-235, 1994.
3. T. Aura and J. Lilius. A causal semantics for time Petri nets. Theoretical Computer Science, 243(1-2)-.409-447, 2000.
4. B. Bérard, F. Cassez, S. Haddad, D. Lime and O.H. Roux. Comparison of Different Semantics for Time Petri Nets. ATVA '05, Taipei, Taiwan, volume 3707 of LNCS, 2005, to appear.
5. B. Bérard, F. Cassez, S. Haddad, D. Lime and O.H. Roux. Comparison of the Expressiveness of Timed Automata and Time Petri Nets. FORMATS'05, Uppsala, Sweden, LNCS, 2005, to appear.
6. B. Bérard, F. Cassez, S. Haddad, D. Lime and O.H. Roux. Comparison of the Expressiveness of Timed Automata and Time Petri Nets. Research Report IRC-CyN R2005-2 available at http://www.lamsade.dauphine.fr/~haddad/publis.html 2005.
7. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering, 17(3):259-273, March 1991.
8. F. Cassez and O. H. Roux. Structural Translation of Time Petri Nets into Timed Automata. In Michael Huth, editor, Workshop on Automated Verification of Critical Systems (AVoCS'04), Electronic Notes in Computer Science. Elsevier, August 2004.
9. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Proc. Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, volume 407 of LNCS, 1989.
10. S. Haar, F. Simonot-Lion, L. Kaiser, and J. Toussaint. Equivalence of Timed State Machines and safe Time Petri Nets. In Proceedings of WODES 2002, Zaragoza, Spain, pages 119-126.
11. D. Lime and O. H. Roux. State class timed automaton of a time Petri net. In PNPM'03. IEEE Computer Society, September 2003.
12. P. M. Merlin. A study of the recoverability of computing systems. PhD thesis, University of California, Irvine, CA, 1974.
13. M. Pezzé and M. Young. Time Petri Nets: A Primer Introduction. Tutorial presented at the Multi-Workshop on Formal Methods in Performance Evaluation and Applications, Zaragoza, Spain, September 1999.
14. C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 1974.