Petri nets: an introduction
The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
A formal semantics for concurrent systems with a priority relation
Acta Informatica
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Theoretical Computer Science
A subclass of Petri Nets as design abstraction for parallel architectures
ACM SIGARCH Computer Architecture News
Invariants and paradigms of concurrency theory
Future Generation Computer Systems - Special issue: PARLE 91
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Theoretical Computer Science
A resource-based prioritized bisimulation for real-time systems
Information and Computation
Information and Computation
What it means for a concurrent program to satisfy a specification: why no one has specified priority
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Specification and Analysis of Concurrent Systems: The COSY Approach
Specification and Analysis of Concurrent Systems: The COSY Approach
Partial Order Semantics and Read Arcs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Extensions to Coloured Petri Nets
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Deriving Histories of Nets with Priority Relation
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Modelling systems with dynamic priorities
Advances in Petri Nets 1992, The DEMON Project
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Hi-index | 0.00 |
In the formal treatment of concurrent computing systems, causality and weak causality can be used to provide abstract specifications of the temporal ‘earlier than’ and ‘not later than’ orderings. In this paper we consider relational structures comprising causality and weak causality — called stratified order structures — which can be used to provide a non-sequential semantics of Petri nets with inhibitor arcs. We show that this approach can be extended to nets augmented with priority specifications. In particular, we demonstrate how to derive stratified order structures for such nets by generalising the standard construction of causal partial orders based on occurrence nets.