Linear parametric model checking of timed automata

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

Volumn 2031 LNCS, Issue , 2001, Pages 189-203

  Hune, Thomas ^a   Romijn, Judi ^b   Stoelinga, Mariëlle ^b   Vaandrager, Frits ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

CASE-STUDIES; EMPTINESS PROBLEM; LINEAR PARAMETERS; LINEAR PARAMETRIC MODELS; MODEL CHECKER; PARAMETRIC TIMED AUTOMATA; SYMBOLIC REPRESENTATION; TIMED AUTOMATA;

MODEL CHECKING;

EID: 84903159824     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_14     Document Type: Conference Paper

References (15)

1. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
2. R. Alur, T.A. Henzinger, and M.Y. Vardi. Parametric real-time reasoning. In Proc. 25th Annual Symp. on Theory of Computing, pages 592-601. ACM Press, 1993.
3. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems. In Proc. 12th Int. Conference on Computer Aided Verification, LNCS 1855, pages 419-434. Springer-Verlag, 2000.
4. G. Bandini, R. Lutje Spelberg, and H. Toetenel. Parametric verification of the IEEE 1394a root contention protocol using LPMC. http://tvs.twi.tudelft. nl/, July 2000. Submitted.
5. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kro-nos: A Model-Checking Tool for Real-Time Systems. In Proc, 10th Int. Conference on Computer Aided Verification, LNCS 1427, pages 546-550. Springer-Verlag, June/July 1998.
6. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. McGraw-Hill, Inc., 1991.
7. P.R. D'Argenio, J.-P. Katoen, T.C. Ruys, and J. Tretmans. The bounded retransmission protocol must be on time! In Proc, Third Workshop on Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1217, pages 416-431. Springer-Verlag, April 1997.
8. D. Dill. Timing assumptions and verification of finite-state concurrent systems. In Proc. Int. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, pages 197-212. Springer-Verlag, 1990.
9. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: A Model Checker for Hybrid Systems. In Proc. 9th Int. Conference on Computer Aided Verification, LNCS 1254, pages 460-463. Springer-Verlag, 1997.
10. T.S. Hune, J.M.T. Romijn, M.I.A. Stoelinga, and F.W. Vaandrager. Linear parametric model checking of timed automata. Report CSI-R0102, CSI, University of Nijmegen, January 2001.
11. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Int. lournal on Software Tools for Technology Transfer, 1(1-2): 134-152, October 1997.
12. R.F. Lutje Spelberg, W.J. Toetenel, and M. Ammerlaan. Partition refinement in real-time model checking. In Proc. FTRTFT'98, LNCS 1486, pages 143-157. Springer-Verlag, 1998.
13. D.P.L. Simons and M.I.A. Stoelinga. Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k. Technical Report CSI-R0009, CSI, University of Nijmegen, May 2000. Conditionally accepted for STTT.
14. M.I.A. Stoelinga and F.W. Vaandrager. Root contention in IEEE 1394. In Proc. 5th Int. AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, LNCS 1601, pages 53-74. Springer-Verlag, 1999.
15. S. Yovine. Model checking timed automata. In Lectures on Embedded Systems, LNCS 1494, pages 114-152. Springer-Verlag, October 1998.