Extended timed automata and time Petri Nets

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2006, Pages 91-100

  Bouyer, Patricia ^a   Haddad, Serge ^b   Reynier, Pierre Alain ^a  

^a CNRS   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Conciseness; Reachability analysis; Time Petri Nets; Timed automata

Indexed keywords

AUTOMATA THEORY; INTERACTIVE COMPUTER SYSTEMS; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; PETRI NETS; SYSTEMS ANALYSIS;

CONCISE MODEL; CONCISENESS; EXTENDED TIMED AUTOMATA; PARALLEL COMPOSITION; REACHABILITY ANALYSIS; TIME PETRI NETS; TIMED AUTOMATA; TIMED LANGUAGES;

REAL TIME SYSTEMS;

EID: 44249127413     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2006.6     Document Type: Conference Paper

References (23)

1. R. Alur and D. Dill. Automata for modeling real-time systems. In Proc. ICALP'90, vol. 443 of LNCS, p. 322-335. Springer, 1990.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2): 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. J. Bengtsson and W. Yi. Timed automata: Semantics, algorithms and tools. In Proc. ACPN'03, vol. 3098 of LNCS, p. 87-124. Springer, 2004.
5. B. Bérard, F Cassez, S. Haddad, D. Lime, and O. H. Roux. Comparison of different semantics for time Petri nets. In Proc. ATVA'05, vol. 3707 of LNCS, p. 293-307. Springer, 2005.
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. In Proc. FORMATS'05, vol. 3829 of LNCS, p. 211-225. Springer, 2005.
7. B. Bérard, V. Diekert, P Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, 36(2-3): 145-182, 1998.
8. B. Bérard and C. Dufourd. Timed automata and additive clock constraints. Information Processing Letters, 75(12): 1-7, 2000.
9. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions in Software Engineering, 17(3):259-273, 1991.
10. B. Berthomieu, P-O. Ribet, and F Vernadat. Construction of abstract state spaces for Petri nets and time Petri nets. International Journal of Production Research, 42(14):2741-2756, 2004.
11. P Bouyer. Forward analysis of updatable timed automata. Formal Methods in System Design, 24(3):281-320, 2004.
12. P Bouyer and F Chevalier. On conciseness of extensions of timed automata. Journal of Automata, Languages and Combinatorics, 2005. To appear.
13. P Bouyer, C. Dufourd, E. Fleury, and A. Petit. Updatable timed automata. Theoretical Computer Science, 321(2-3):291-345, 2004.
14. P Bouyer, F Laroussinie, and P-A. Reynier. Diagonal constraints in timed automata: Forward analysis of timed systems. In Proc. FORMATS'05, vol. 3829 of LNCS, p. 112-126. Springer, 2005.
15. C. Daws and S. Tripakis. Model-checking of real-time reachability properties using abstractions. In Proc. TACAS'98, vol. 1384 of LNCS, p. 313-329. Springer, 1998.
16. E. Fersman, P Petterson, and W. Yi. Timed automata with asynchrounous processes: schedulability and decidability. In Proc. TACAS'02, vol. 2280 of LNCS, p. 67-82. Springer, 2002.
17. G. Gardey, D. Lime, M. Magnin, and O. H. Roux. Romeo: A tool for analyzing time Petri nets. In Proc. CAV'05, vol. 3576 of LNCS, p. 418-423. Springer, 2005.
18. S. Haar, F Simonot-Lion, L. Kaiser, and J. Toussaint. Equivalence of timed state machines and safe time Petri nets. In Proc. WoDES'02, p. 119-126, 2002.
19. K. G. Larsen, P Pettersson, and W. Yi. Model-checking for real-time systems. In Proc. FCT'95, vol. 965 of LNCS, p. 62-88. Springer, 1995.
20. K. G. Larsen, P Pettersson, and W. Yi. Uppaal in a nutshell. Journal of Software Tools for Technology Transfer, 1(1-2): 134-152, 1997.
21. D. Lime and O. H. Roux. State class timed automaton of a time Petri net. In Proc. PNPM'03, p. 124-133. IEEE Computer Society Press, 2003.
22. P.M.Merlin. A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine, CA, USA, 1974.
23. C. Ramchandani. Analysis of Asynchronous Concurrent Systems by Timed Petri Nets. PhD thesis, MIT, Cambridge, MA, USA, 1974.