Bridging the gap between Timed Automata and Bounded Time Petri Nets

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

Volumn 4202 LNCS, Issue , 2006, Pages 82-97

  Berthomieu, Bernard ^a   Peres, Florent ^a   Vernadat, François ^a  

^a LAAS CNRS   (France)

Author keywords

Priorities; Real time systems modeling and verification; Time petri nets; Timed automata; Weak timed bisimilarity

Indexed keywords

AUTOMATA THEORY; FORMAL LANGUAGES; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; PETRI NETS; SET THEORY;

BOUNDED TIME PETRI NETS; TIMED AUTOMATA; TIMED LANGUAGE ACCEPTANCE; WEAK TIMED BISIMILARITY;

REAL TIME SYSTEMS;

EID: 33750370786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11867340_7     Document Type: Conference Paper

References (15)

1. R. Alur. Timed automata. In 11th International Conference on Computer Aided Verification, CAV'99, Springer LNCS 1633, pages 8-22, July 1999.
2. R. Alur and D.L. Dill. A theory of timed automata. TCS, 126:183-235, 1994.
3. B. Bérard, F. Cassez, S. Haddad, O. H. Roux, and D. Lime. Comparison of the Expressiveness of Timed Automata and Time Petri Nets. In Formal Modeling and Analysis of Timed Systems (FORMATS'05), LNCS 3829, pages 211-225, 2005.
4. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. on Software Engineering, 17(3):259-273, 1991.
5. B. Berthomieu and M. Menasche. An enumerative approach for analyzing time Petri nets. IFIP Congress Series, 9:41-46, 1983.
6. B. Berthomieu and F. Vernadat. State class constructions for branching analysis of time Petri nets. In Proc. Tools and Algorithms for the Construction and Analysis of Systems, Springer LNCS 2619, 2003.
7. S. Bornot, J. Sifakis, and S. Tripakis. Modeling urgency in timed systems. In Compositionality: The Significant Difference - International Symposium COMPOS'97, Springer LNCS 1536, pages 103-129, September 1997.
8. P. Bouyer, S. Haddad, and P-A. Reynier. Extended timed automata and time Petri nets. In Proc. of 6th Int. Conf. on Application of Concurrency to System Design (ACSD'06), Turku, Finland, June 2006. IEEE Computer Society Press.
9. F. Cassez and O. H. Roux. Structural translation from time petri nets to timed automata. Journal of Systems and Software, 2006. forthcoming.
10. P. R. D'Argenio and B. Gebremichael. The coarsest congruence for timed automata with deadlines contained in bisimulation. In CONCUR 2005 - Concurrency Theory, Springer LNCS 3653, pages 125-140, August 2005.
11. S. Haar, L. Kaiser, F. Simonot-Lion, and J. Toussaint. Equivalence of Timed State Machines and safe Time Petri Nets. In Proc. of the 6th Workshop on Discrete Events Systems (WODES'02), pages 119-124, Zaragoza, Spain, October 2002.
12. M. Hack. Petri net languages. TR 159, MIT, Cambridge, Mass., 1976.
13. K. G. Larsen, P. Pettersson, and W. Y. Yi. Model-checking for real-time systems. In Fundamentals of Computation Theory, LNCS 965, pages 62-88, August 1995.
14. D. Lime and O. H. Roux. State class timed automaton of a time Petri net. In 10th International Workshop on Petri Nets and Performance Models, (PNPM'03), pages 124-133, Urbana, USA, September 2003. IEEE Computer Society.
15. P. M. Merlin and D. J. Farber. Recoverability of communication protocols: Implications of a theoretical study. IEEE Tr. Comm., 24(9):1036-1043, Sept. 1976.