Symbolic 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 307-321

  Cassez, Franck ^a   Chatain, Thomas ^b   Jard, Claude ^c  

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

^b CAMPUS DE BEAULIEU   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; CONSTRAINT THEORY; GRAPHIC METHODS; INFORMATION ANALYSIS; SEMANTICS;

CONCURRENT SEMANTICS; NETWORK OF TIMED AUTOMATA (NTA); SYMBOLIC NETS; SYMBOLIC UNFOLDINGS;

COMPUTER NETWORKS;

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

References (22)

1. Rajeev Alur and David Dill. A theory of timed automata. Theoretical Computer Science (TCS), 126(2): 183-235, 1994.
2. Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim G. Larsen, Paul Pettersson, Judi Romijn, and Frits Vaandrager. Minimum-cost reachability for priced timed automata. In Proc. 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), volume 2034 of Lecture Notes in Computer Science, pages 147-161. Springer, 2001.
3. th International Conference on Concurrency Theory (CONCUR'06), LNCS, aug 2006. To appear.
4. Béatrice Bérard, Franck Cassez, Serge Haddad, Olivier H. Roux, and Didier Lime. Comparison of the Expressiveness of Timed Automata and Time Petri Nets. In Paul Pettersson and Wang Yi, editors, Proceedings of the third International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'05), volume 3829 of Lecture Notes in Computer Science, pages 211-225, Uppsala, Sweden, September 2005. Springer.
5. 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.
6. Patricia Bouyer. Forward analysis of updatable timed automata. Formal Methods in System Design, 24(3):281-320, 2004.
7. Franck Cassez, Thomas Chatain, and Claude Jard. Symbolic Unfoldings for Networks of Timed Automata. Technical Report RI-2006-4, IRCCyN/CNRS, Nantes, May 2006.
8. Franck Cassez and Olivier H. Roux. Structural translation from time petri nets to timed automata. Journal of Systems and Software, 2006. forthcoming.
9. Thomas Chatain and Claude Jard. Complete finite prefixes of symbolic unfoldings of safe time Petri nets. In ICATPN, volume 4024 of LNCS, pages 125-145, June 2006.
10. Javier Esparza and Stefan Römer. An unfolding algorithm for synchronous products of transition systems. In CONCUR, volume 1664 of LNCS, pages 2-20. Springer, 1999.
11. Javier Esparza, Stefan Römer, and Walter Vogler. An improvement of McMillan's unfolding algorithm. Formal Methods in System Design, 20(3):285-310, 2002.
12. Hans Fleischhack and Christian Stehno. Computing a finite prefix of a time Petri net, In ICATPN, pages 163-181, 2002.
13. J. Bengtsson, B. Jonsson, J. Lilius, W. Yi. Partial order reductions for timed systems. In CONCUR 99, volume 1466 of LNCS, pages 485-500, 1999.
14. Kim G. Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. Efficient verification of real-time systems: Compact data structure and state-space reduction. In Proc. 18th IEEE Real-Time Systems Symposium (RTSS'97), pages 14-24. IEEE Computer Society Press, 1997.
15. Denis Lugiez, Peter Niebert, and Sarah Zennou. A partial order semantics approach to the clock explosion problem of timed automata, In Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2004), volume 2988 of Lecture Notes in Computer Science, pages 296-311. Springer, 2004.
16. Kenneth L. McMillan. A technique of state space search based on unfolding. Formal Methods in System Design, 6(1):45-65, 1995.
17. P.M. Merlin and D.J. Farber. Recoverability of communication protocols - implications of a theorical study, IEEE Transactions on Communications, 24, 1976.
18. M. Minea, Partial order reduction for model checking of timed automata. In CONCUR 99, volume 1664 of LNCS, pages 431-446, 1999.
19. T. Aura and J. Lilius. A causal semantics for time petri nets. Theoretical Computer Science, 1-2(243):409-447, 2000.
20. T. Yoneda, B-H. Schlingloff. Efficient verification of parallel real-time systems. Formal Methods in System Design, 2(11):187-215, 1997.
21. A. Valmari. Stubborn sets for reduced state space generation. In Applications and Theory of Petri Nets, volume 483 of LNCS, pages 491-515, 1989.
22. W. Belluomini, C. J. Myers. Verification of timed systems using posets. In CAV 98, volume 1427 of LNCS, pages 403-415, 1998.