Abstract
Timed Nets are proposed to model the behavior of real-time systems. Net transitions are annotated by timing constraints, using finitely many realvalued clocks. A timed net accepts timed words, i.e. infinite sequences in which a time of occurrence is associated with each symbol. We study expressiveness, closure properties and decision problems of such nets, where the acceptance condition is based on actions. The main result of the paper is an algorithm for deciding the inclusion problem for timed languages.
This research has been partially supported by CNR grant N.92.00069.CT12.115.25585 and by MURST.
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, D. Dill. “Automata for Modeling Real-Time Systems”. In Proc. ICALP 90, LNCS 443, 322–335. Springer, 1990.
R. Alur, D. Dill. “The Theory of Timed Automata”. In Proc. of the REX workshop “Real-Time: Theory in Practice”, LNCS 600, 45–73. Springer, 1992.
R. Gorrieri, G. Siliprandi. “A Theory of P/T Nets for Timed Languages”. In preparation.
W. Thomas. “Automata on Infinite Objects”. Handbook of Theoretical Computer Science. Elsevier, 133–191, 1990.
R. Valk. “Infinite Behavior of Petri Nets”. TCS 25, 311–341, 1983.
R. Valk, M. Jantzen. “The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets”. Acta Informatica 21, 643–647, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gorrieri, R., Siliprandi, G. (1994). Real-time system verification using P/T nets. 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_40
Download citation
DOI: https://doi.org/10.1007/3-540-58179-0_40
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