Petri net semantics of priority systems
Selected papers of the Second Workshop on Concurrency and compositionality
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Proof, language, and interaction
Petri net algebra
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Asynchronous Links in the PBC and M-Nets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
B(PN)2 - a Basic Petri Net Programming Notation
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
PEP - More than a Petri Net Tool
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
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
Preemption in Concurrent Systems
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
A Memory Module Specification Using Composable High-Level Petri Nets
Formal Systems Specification, The RPC-Memory Specification Case Study (the book grow out of a Dagstuhl Seminar, September 1994)
Coupling Asynchrony and Interrupts: Place Chart Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A Concurrent Semantics of Static Exceptions in a Parallel Programming Language
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A Concurrent and Compositional Petri Net Semantics of Preemption
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
General parameterised refinement and recursion for the M-net calculus
Theoretical Computer Science
Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of preemption, and can be applied to the modelling of the semantics of high-level parallel programming languages with preemption-related features. As an illustration, the paper gives an application to the modelling of a multi-tasking system in a parallel programming language, which is provided with a concurrent semantics based on Petri nets and for which implemented tools can be used.