On interleaving in timed automata

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

Volumn 4137 LNCS, Issue , 2006, Pages 465-476

  Salah, Ramzi Ben ^a   Bozga, Marius ^a   Maler, Oded ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA ACQUISITION; PROBLEM SOLVING; THEOREM PROVING;

REACHABILITY; STATE-EXPLOSION PROBLEMS; TIMED AUTOMATA;

FINITE AUTOMATA;

EID: 33749577849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_31     Document Type: Conference Paper

References (19)

1. [AD94] R. Alur and D.L. Dill, A Theory of Timed Automata, Theoretical Computer Science 126, 183-235, 1994.
2. [BJJY98] J. Bengtsson, B. Jonsson, J. Lilius and W. Yi, Partial Order Reductions for Timed Systems, CONCUR'98, 485-500, 1998.
3. [BBM03] R. Ben Salah, M. Bozga and O. Maler, On Timing Analysis of Combinational Circuits, FORMATS'03, 204-219, 2003.
4. [BBM06] R. Ben Salah, M. Bozga and O. Maler, Automatic Abstraction of Timed Components, submitted, 2006.
5. [BGM02] M. Bozga, S. Graf and L. Mounier, IF-2.0: A Validation Environment for Component-Based Real-Time Systems, CAV'02, 343-348, 2002.
6. [DGKK98] D. Dams, R. Gerth, B. Knaack and R. Kuiper, Partial-order Reduction Techniques for Real-time Model Checking, Formal Aspects of Computing 10, 469-482, 1998.
7. [DT98] C. Daws and S. Tripakis, Model Checking of Real-Time Reachability Properties Using Abstractions, TACAS'98, 313-329, 1998.
8. [DY96] C. Daws and S. Yovine, Reducing the Number of Clock Variables of Timed Automata, RTSS '96, 73-81, 1996.
9. [DR95] V. Diekert and G. Rozenberg (Eds.), The Book of Traces, World Scientific, 1995.
10. [HBL+03] M. Hendriks, G. Behrmann, K. Larsen, P. Niebert and F. Vaandrager, Adding Symmetry Reduction to Uppaal, FORMATS'03, 46-59, 2003.
11. [HNSY94] T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic Model-checking for Real-time Systems, Information and Computation 111, 193-244, 1994.
12. [LNZ05] D. Lugiez, P. Niebert and S. Zennou, A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata, Theoretical Computer Science 345, 27-59, 2005.
13. [MP95] O. Maler and A. Pnueli, Timing Analysis of Asynchronous Circuits using Timed Automata, CHARME'95, 189-205, 1995.
14. [M99] M. Minea, Partial Order Reduction for Model Checking of Timed Automata, CONCUR'99, 431-446, 1999.
15. [R94] T.G. Rokicki, Representing and Modeling Digital Circuits, PhD Thesis, Stanford University, 1994.
16. [T98] S. Tripakis, The Analysis of Timed Systems in Practice, PhD Thesis, Université Joseph Fourier, Grenoble, 1998.
17. [U] Uppaal benchmarks: www.it.uu.se/research/group/darts/uppaal/ benchmarks
18. [YS97] T. Yoneda and B.-H. Schlingloff, Efficient Verification of Parallel Real-Time Systems, Formal Methods in System Design 11, 187-215, 1997.
19. [ZYN03] S. Zennou, M. Yguel and P. Niebert, ELSE: A New Symbolic State Generator for Timed Automata, FORMATS'03, 273-280, 2003.