We address the verification problem of infinite timed systems. We consider context-free timed systems defined as a generalization of the (regular) timed graphs [ACDg0]. 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).
CITATION STYLE
Bouajjani, A., Echahed, R., & Robbana, R. (1994). Verification of context-free timed systems using linear hybrid observers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 818 LNCS, pp. 118–131). Springer Verlag. https://doi.org/10.1007/3-540-58179-0_48
Mendeley helps you to discover research relevant for your work.