Real-Time System Verification using P/T Nets

Abstract Timed Nets are proposed to model the behavior of real-time systems. In our approach, net transitions are annotated by timing constraints, using finitely many real-valued clocks. A timed net accepts timed words, i.e. infinite sequences in which a real-valued time of occurrence is associated with each symbol. We study expressiveness, closure properties and decision problems of such nets. We also consider nondeterministic structures and acceptance conditions based on actions. The main construction of the paper is an algorithm for deciding the inclusion problem: this leads to automatic verification of real-time systems. 1 Introduction There is a great variety of automata-based approaches to the specification and verification of real-time systems, depending mainly on the assumptions about the nature of time