Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Relating maximality-based semantics to action refinement in process algebras
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Maximality preservation and the ST-idea for action refinements
Advances in Petri Nets 1992, The DEMON Project
Time Stream Petri Nets: A Model for Timed Multimedia Information
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Madeus: An Authoring Environment for Interactive Multimedia Documents
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Aggregation of transitions in marking graph generation based on maximality semantics for petri nets
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Hi-index | 0.00 |
The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration DTPN where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions which have explicit durations. The authors give an operational semantics for DTPN in terms of Durational Action Timed Automata DATA. DTPN considers both timing constraints and durations under a true-concurrency semantics with an aim of better expressing concurrent and parallel behaviours of real-time systems.