Real-time model-checking: Parameters everywhere

Logical Methods in Computer Science

Volumn 3, Issue 1, 2007, Pages

  Bruyère, Véronique ^a   Raskin, Jean François ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Decidability; Parameters; Real time; Timed automata; Timed temporal logics

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; DIGITAL ARITHMETIC;

MODEL CHECKING PROBLEM; PARAMETER SYNTHESIS; PARAMETERS; PRESBURGER ARITHMETIC; REAL TIME; REAL TIME MODELING; TIMED AUTOMATA; TIMED TEMPORAL LOGIC;

MODEL CHECKING;

EID: 85008869376     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(1:7)2007     Document Type: Article

References (13)

1. R. Alur, C. Courcoubetis, and D.L. Dill. Model checking for real-time systems. In Annual IEEE Symposium on Logic in Computer Science, LICS’90, pages 414-425. IEEE Computer Society Press, 1990.
2. R. Alur, T.A. Henzinger, and M.Y. Vardi. Parametric real-time reasoning. In Annual Symposium on Theory of Computing, STOC’93, pages 592-601. ACM Press, 1993.
3. Rajeev Alur, Kousha Etessami, Salvatore La Torre, and Doron Peled. Parametric temporal logic for “model measuring”. In International Colloquium of Automata, languages and Programming, ICALP’99, volume 1644 of Lecture Notes in Computer Science, pages 159-168, 1999.
4. Alexis Bès. A survey of arithmetical definability. A tribute to Maurice Boffa, Special Issue of Belg. Math. Soc., pages 1-54, 2002.
5. V. Bruyère, E. Dall’olio, and J.-F. Raskin. Durations, parametric model-checking in timed automata with Presburger arithmetic. In Annual Symposium on Theoretical Aspects of Computer Science, STACS’03, volume 2607 of Lecture Notes in Computer Science, pages 687-698. Springer, 2003.
6. Véronique Bruyère and Jean-François Raskin. Real-time model-checking: Parameters everywhere. In 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS’03, volume 2914 of Lecture Notes in Computer Science, pages 100-111. Springer, 2003.
7. S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, 1974.
8. E. Allen Emerson and Richard J. Trefler. Parametric quantitative temporal reasoning. In Annual IEEE Symposium on Logic in Computer Science, LICS’99, IEEE Computer Society, pages 336-343, 1999.
9. Thomas Hune, Judi Romijn, Marielle Stoelinga, and Frits Vaandrager. Linear parametric model checking of timed automata. Journal of Logic and Algebraic Programming, 52-53:183-220, 2002.
10. Harry Lewis and Christos Papadimitriou. Elements of the theory of computation. Prentice Hall, 1998.
11. Joseph S. Miller. Decidability and complexity results for timed automata and semi-linear hybrid au-tomata. In Hybrid Systems-Computation and Control, HSCC’00, volume 1790 of Lecture Notes in Computer Science, pages 296-309. Springer, 2000.
12. Farn Wang. Timing behavior analysis for real-time systems. In Annual IEEE Symposium on Logic in Computer Science, LICS’95, pages 112-122, 1995.
13. Farn Wang and Pao-Ann Hsiung. Parametric analysis of computer systems. In International Conference on Algebraic Methodology and Software Technology, AMAST’97, pages 539-553, 1997.