Abstract
We address the verification problem of infinite timed systems. We consider context-free timed systems defined as a generalization of the (regular) timed graphs [ACD90]. Then, we propose decision procedures for the verification of invariance properties of these systems, expressed by means of observation variables. These variables record relevant informations about the computations of the observed system. They are permanently updated along these computations without any interference with the behaviour of the system. Observation variables are either additional clocks (timers), nonbounded integer variables (accumulators), or constant slope continuous (real valued) variables (integrators).
Partially supported by the ESPRIT-BRA project REACT.
VERIMAG is a joint laboratory of CNRS, INPG, UJF and VERILOG SA., SPECTRE is a project of INRIA.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur, C. Courcoubetis, and D. Dill. Model-Checking for Real-Time Systems. In LICS'90. IEEE, 1990.
R. Alur, C. Courcoubetis, and T. A. Henzinger. Computing Accumulated Delays in Real-time Systems. In Hybrid Systems, 1993. LNCS 736.
R. Alur, C. Courcoubetis, T. Henzinger, and P-H. Ho. Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In Hybrid Systems, 1993. LNCS 736.
J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. Tech. Rep. CS-R8632, 1987. CWI.
A. Bouajjani, R. Echahed, and R. Robbana. Verification of Nonregular Temporal Properties for Context-Free Processes, submitted for publication, 1993.
A. Bouajjani, R. Echahed, and R. Robbana. Verification of Context-Free Timed Systems using Linear Hybrid Observers. Tech. Rep. Spectre-94-4, Verimag, Grenoble, January 1994.
A. Bouajjani, R. Echahed, and J. Sifakis. On Model Checking for Real-Time Properties with Durations. In LICS'93. IEEE, 1993.
O. Burkart and B. Steffen. Model Checking for Context-Free Processes. In CON-CUR'92, 1992. LNCS 630.
K. Cerans. Decidability of Bisimulation Equivalence for Parallel Timer Processes. In CAV'92, 1992. LNCS 663.
E.M. Clarke, E.A. Emerson, and E. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications: A Practical Approach. In POPL'83. ACM, 1983.
K. Cerans, J. Godskesen, and K. Larsen. Timed Modal Specification: Theory and Tools. In CAV'93. LNCS 697, 1993.
Z. Chaochen, C.A.R. Hoare, and A.P. Ravn. A Calculus of Durations. Information Processing Letters, 40:269–276, 1991.
S. Christensen, H. Hüttel, and C. Stirling. Bisimulation Equivalence is Decidable for all Context-Free Processes. In CONCUR'92, 1992. LNCS 630.
R. Cleaveland and B. Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. In Proc. Computer-Aided Verification (CAV'91), 1991. LNCS 575.
E.A. Emerson and C.L. Lei. Efficient Model-Checking in Fragments of the Propositional Μ-Calculus. In LICS'86, 1986.
J.F. Groote and H. Hüttel. Undecidable Equivalences for Basic Process Algebra. Tech. Rep. ECS-LFCS-91-169, 1991. Dep. of Computer Science, Univ. of Edinburgh.
M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley Pub. Comp., 1978.
T. Henzinger, Z. Manna, and A. Pnueli. What Good are Digital Clocks? In ICALP'92, 1992. LNCS 623.
T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic Model-Checking for Real-Time Systems. In LICS'92. IEEE, 1992.
Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration Graphs: A Class of Decidable Hybrid System s. In Hybrid Systems, 1993. LNCS 736.
P. Kanellakis and S.A. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. In PODC'83. ACM, 1983.
R. Milner. A Calculus of Communication Systems. 1980. LNCS 92.
O. Maler, Z. Manna, and A. Pnueli. A Formal Approach to Hybrid Systems. In REX workshop on Real-Time: Theory and Practice, 1992. LNCS 600.
Z. Manna and A. Pnueli. Verifying Hybrid Systems. In Hybrid Systems, 1993. LNCS 736.
X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An Approach to the Description and Analysis of Hybrid Systems. In Hybrid Systems, 1993. LNCS 736.
X. Nicollin, J.-L. Richier, J. Sifakis, and J. Voiron. ATP: an Algebra for Timed Processes. In IFIP TC2 Working Conf. on Prog. Concepts and Methods, 1990: Israel.
D. Park. Concurrency and Automata on Infinite Sequences. In 5th GI-Conference on Theoretical Computer Science. 1981. LNCS 104.
J-P. Queille and J. Sifakis. Specification and Verification of Concurrent Systems in CESAR. In Intern. Symp. on Programming, LNCS 137, 1982.
M.Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS'86. IEEE, 1986.
Y. Wang. Real Time Behaviour of Asynchronous Agents. In CONCUR'90, 1990. LNCS 458.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouajjani, A., Echahed, R., Robbana, R. (1994). Verification of context-free timed systems using linear hybrid observers. In: Dill, D.L. (eds) Computer Aided Verification. CAV 1994. Lecture Notes in Computer Science, vol 818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58179-0_48
Download citation
DOI: https://doi.org/10.1007/3-540-58179-0_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58179-6
Online ISBN: 978-3-540-48469-1
eBook Packages: Springer Book Archive