Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Branching processes of Petri nets
Acta Informatica
Causality, time, and deadlines
Data & Knowledge Engineering
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Partial order verification with PEP
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Petri net algebra
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
General Refinement and Recursion Operators for the Petri Box Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
General Refinement for High Level Petri Nets
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Performance Evaluation of Systems Using Nets
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Time Processes for Time Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Computing a Finite Prefix of a Time Petri Net
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Compositional High Level Petri Nets with Timing Constraints — A Comparison
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
Counting Interfaces for Discrete Time Modeling
Counting Interfaces for Discrete Time Modeling
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A compositional model of time Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Algebraical Characterisation of Interval-Timed Petri Nets with Discrete Delays
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
| Hi-index | 0.00 |
The paper aims at defining hierarchical time extensions of M-nets, a fully compositional class of high-level Petri nets. As a starting point, the class of classical timed M-nets are considered, where time intervals of duration are attached to each transition. This class is enriched by two new operations: timed refinement (which extends the class) and hierarchical scoping (which is shown to be a powerful feature for abstraction). It is argued that hierarchical timed M-nets permit the design of real-time systems in a top down manner. Moreover, a partial order semantics of hierarchical timed M-nets is defined based on branching processes. The definition is given directly for high level nets, without preliminary unfolding to low level nets. This semantics enables partial order model checking of hierarchical timed M-nets e.g. within the PEP-system.