Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Theoretical Computer Science
Trapping mutual exclusion in the box calculus
Theoretical Computer Science - Special volume on Petri nets
Information and Computation
Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Modelling and Analysis of Distributed Software Using GSPNs
Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Process semantics of general inhibitor nets
Information and Computation
Relational structures model of concurrency
Acta Informatica
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Synthesis of Nets with Step Firing Policies
Fundamenta Informaticae - Petri Nets 2008
Process semantics for membrane systems
Journal of Automata, Languages and Combinatorics
Mutex Causality in Processes and Traces of General Elementary Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Hi-index | 0.00 |
Concurrency can be studied at different yet consistent levels of abstraction: from individual behavioural observations, to more abstract concurrent histories which can be represented by causality structures capturing intrinsic, invariant dependencies between executed actions, to system level devices such as Petri nets or process algebra expressions. Histories can then be understood as sets of closely related observations (here step sequences of executed actions). Depending on the nature of the observed relationships between executed actions involved in a single concurrent history, one may identify different concurrency paradigms underpinned by different kinds of causality structures (e.g., the true concurrency paradigm is underpinned by causal partial orders with each history comprising all step sequences consistent with some causal partial order). For some paradigms there exist closely matching system models such as elementary net systems (EN-systems) for the true concurrency paradigm, or elementary net systems with inhibitor arcs (ENI-systems) for a paradigm where simultaneity of executed actions does not imply their unorderedness. In this paper, we develop a system model fitting the least restrictive concurrency paradigm and its associated causality structures. To this end, we introduce ENI-systems with mutex arcs (ENIM-systems). Each mutex arc relates two transitions which cannot be executed simultaneously, but can be executed in any order. To link ENIM-systems with causality structures we develop a notion of process following a generic approach (semantical framework) which includes a method to generate causality structures from the new class of processes.