Durations, parametric model-checking in timed automata with presburger arithmetic

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

Volumn 2607, Issue , 2003, Pages 687-698

  Bruyère, Véronique ^a   Dall'Olio, Emmanuel ^b   Raskin, Jean François ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIGITAL ARITHMETIC;

PARAMETRIC MODEL CHECKING; PRESBURGER; PRESBURGER ARITHMETIC; TIME DOMAIN; TIMED AUTOMATA;

MODEL CHECKING;

EID: 21144431775     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_60     Document Type: Article

References (13)

1. R. Alur, C. Courcoubetis, and D.L. Dill. Model checking for real-time systems. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 414-425. IEEE Computer Society Press, 1990.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, T.A. Henzinger, and M.Y. Vardi. Parametric real-time reasoning. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 592-601. ACM Press, 1993.
4. Rajeev Alur, Kousha Etessami, Salvatore La Torre, and Doron Peled. Parametric temporal logic for "model measuring". Lecture Notes in Computer Science, 1644:159-173, 1999.
5. Bernard Boigelot, Sébastien Jodogne, and Pierre Wolper. On the use of weak automata for deciding linear arithmetic with integer and real variables. In Proc. International Joint Conference on Automated Reasoning, volume 2083, pages 611-625. Springer-Verlag, 2001.
6. V. Bruyère, E. Dall'olio, and J.-F. Raskin. Durations, parametric model-checking in timed automata with Presburger arithmetic. Technical Report CFV-2002-1, Centre Fédéré en Vérification (Belgique), 2002. http://www.ulb.ac.be/di/ssd/cfv/TechReps/TechRep_CFV_2002_1.ps.
7. H. Comon and Y. Jurski. Timed automata and the theory of real numbers. In Proc. 10th Int. Conf. Concurrency Theory (CONCUR'99), Eindhoven, The Netherlands, Aug. 1999, volume 1664 of Lecture Notes in Computer Science, pages 242-257. Springer, 1999.
8. E. Allen Emerson and Richard J. Trefler. Parametric quantitative temporal reasoning. In Logic in Computer Science, pages 336-343, 1999.
9. Jeanne Ferrante and Charles W. Rackoff. The computational complexity of logical theories. Number 718 in Lecture Notes in Mathematics. Springer-Verlag, 1979.
10. T.A. Henzinger. It's about time: Real-time logics reviewed. In D. Sangiorgi and R. de Simone, editors, CONCUR 98: Concurrency Theory, Lecture Notes in Computer Science 1466, pages 439-454. Springer-Verlag, 1998.
11. Farn Wang. Timing behavior analysis for real-time systems. In In Proceedings of the Tenth IEEE Symposium on Logic in Computer Science, pages 112-122, 1995.
12. Farn Wang and Pao-Ann Hsiung. Parametric analysis of computer systems. In Algebraic Methodology and Software Technology, pages 539-553, 1997.
13. Volker Weispfenning. Mixed real-integer linear quantifier elimination. In ISSAC: Proceedings of the ACM SIGSAM International Symposium on Symbolic and Algebraic Computation, 1999.