Timed unfoldings for networks of timed automata

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

Volumn 4218 LNCS, Issue , 2006, Pages 292-306

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

^a CNRS   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; INVARIANCE; PETRI NETS; SYNCHRONIZATION;

DISCRETE EVENT SYSTEMS; READ ARCS; TIMED AUTOMATA; TIMED UNFOLDINGS;

COMPUTER SYSTEMS;

EID: 33845210982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901914_23     Document Type: Conference Paper

References (23)

1. R. Alur and D. Dill. A theory of timed automata. Theor. Comp. Sci., 126(2): 183-235, 1994.
2. T. Aura and J. Lilius. A causal semantics for time Petri nets. Theor. Comp. Sci., 243(1-2):409-447, 2000.
3. R. Ben Salah, M. Bozga, and O. Maler. On interleaving in timed automata. In 17th Int. Conf. Concur. Theory (CONCUR'06), LNCS 4137. Springer, 2006. To appear.
4. J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi. Partial order reductions for timed systems. In 9th Int. Conf. Concur. Theory (CONCUR'98), LNCS 1466, 485-500. Springer, 1998.
5. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Softw. Engineering, 17(3):259-273, 1991.
6. P. Bouyer. Forward analysis of updatable timed automata. Formal Methods in Syst. Design, 24(3):281-320, 2004.
7. P. Bouyer, S. Haddad, and P.-A. Reynier. Timed Petri nets and timed automata: On the discriminating power of Zeno sequences. In 33rd Int. Coll. Automata, Languages and Programming (ICALP'06), LNCS 4052, 420-431. Springer, 2006.
8. P. Bouyer, S. Haddad, and P.-A. Reynier. Timed unfoldings for networks of timed automata. Research Rep. LSV-06-09, Lab. Spécification et Vérification, ENS de Cachan, France, 2006.
9. Th. Chatain and C. Jard. Time supervision of concurrent systems using symbolic unfoldings of time Petri nets. In 3rd Int. Conf. Formal Modeling and Analysis of Timed Syst. (FORMATS'05), LNCS 3829, 196-210. Springer, 2005.
10. Th. Chatain and C. Jard. Complete finite prefixes of symbolic unfoldings of time Petri nets. In 27th Int. Conf. Appl. and Theory of Petri Nets (ICATPN'06), LNCS 4024, 125-145. Springer, 2006.
11. C. Daws and S. Tripakis. Model-checking of real-time reachability properties using abstractions. In 4th Int. Conf. Tools and Algo. for the Construction and Analysis of Syst. (TACAS'98), LNCS 1384, 313-329. Springer, 1998.
12. D. Dill. Timing assumptions and verification of finite-state concurrent systems. In of the Work. Automatic Verification Methods for Finite State Systems (1989), LNCS 407, 197-212. Springer, 1990.
13. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan's unfolding algorithm. Formal Methods in Syst. Design, 20(3):285-310, 2002.
14. H. Fleischhack and C. Stehno. Computing a finite prefix of a time Petri net. In 23rd Int. Conf. Appl. and Theory of Petri Nets (ICATPN'02), LNCS 2369, 163-181. Springer, 2002.
15. J. Lilius. Efficient state space search for time Petri nets. ENTCS 18, 1998.
16. D. Lugiez, P. Niebert, and S. Zennou. A partial order semantics approach to the clock explosion problem of timed automata. In 10th Int. Conf. Tools and Algo. for the Construction and Analysis of Syst. (TACAS'04), LNCS 2988, 296-311. Springer, 2004.
17. K. McMillan. A technique of state space search based on unfolding. Formal Methods in Syst. Design, 6(1):45-65, 1995.
18. M. Minea. Partial order reduction for model checking of timed automata. In 10th Int. Conf. Concur. Theory (CONCUR'99), LNCS 1664, 431-446. Springer, 1999.
19. D. Peled. All from one, one for all: on model checking using representatives. In 5th Int. Conf. Computer Aided Verif. (CAV'93), LNCS 697, 409-423. Springer, 1993.
20. A. Valmari. Stubborn sets for reduced state space generation. In 10th Int. Conf. Appl. and Theory of Petri Nets (ICATPN'89), LNCS 483, 491-515. Springer, 1989.
21. W. Vogler, A. L. Semenov, and A. Yakovlev. Unfolding and finite prefix for nets with read arcs. In 9th Int. Conf. Concur. Theory (CONCUR'98), LNCS 1466, 501-516. Springer, 1998.
22. J. Winkowski. Reachability in contextual nets. Fundam. Inform., 51(1-2):235-250, 2002.
23. T. Yoneda and B.-H. Schlingloff. Efficient verification of parallel real-time systems. Formal Methods in Syst. Design, 11(2):187-215, 1997.