Petri nets: basic notions, structure, behaviour
Current trends in concurrency. Overviews and tutorials
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
A general way to put time in Petri nets
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Causality, time, and deadlines
Data & Knowledge Engineering
On the border of causality: contact and confusion
Theoretical Computer Science - Special volume on Petri nets
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
A survey of equivalence notions for net based systems
Advances in Petri Nets 1992, The DEMON Project
Timed Petri nets and preliminary performance evaluation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
| Hi-index | 5.23 |
For a prototypical class of time-extended Petri nets it is shown that the extension does not increase their expressive power. The nets in this class have token latencies attributed to places. Place latency nets are formally defined together with their firing semantics. For any place latency system, an explicit construction of an elementary net system is given as an implementation, which is proven to be behaviourally equivalent. The adequacy problem of deciding which equivalence notion to apply is moderated by the fact that the implementation satisfies the B-condition, under which all better known equivalence notions coincide.