Semantics of inhibitor nets

DOI10.1006/inco.1995.1153zbMath1096.68678OpenAlexW1965067520MaRDI QIDQ2508333

Ryszard Janicki, Maciej Koutny

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1153

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Domain and event structure semantics for Petri nets with read and inhibitor arcs ⋮ Boolean networks: beyond generalized asynchronicity ⋮ Process semantics of general inhibitor nets ⋮ Unfolding semantics of graph transformation ⋮ On Interval Process Semantics of Petri Nets with Inhibitor Arcs ⋮ Non-atomic Transition Firing in Contextual Nets ⋮ Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs ⋮ Classifying invariant structures of step traces ⋮ On Interval Semantics of Inhibitor and Activator Nets ⋮ Modelling Concurrency with Quotient Monoids ⋮ Efficient unfolding of contextual Petri nets ⋮ Folded Hasse diagrams of combined traces ⋮ Modelling concurrency with comtraces and generalized comtraces ⋮ Unnamed Item ⋮ Relational structures model of concurrency ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ The Mutex Paradigm of Concurrency ⋮ Synchronized composition of graph grammar productions ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Modeling concurrency with interval traces ⋮ Relational structures for concurrent behaviours ⋮ Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra ⋮ Concurrency for Graph Grammars in a Petri net shell ⋮ Processes and Local Actions ⋮ Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions ⋮ McMillan’s Complete Prefix for Contextual Nets ⋮ Step traces ⋮ Executability of scenarios in Petri nets ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ Unnamed Item ⋮ A process algebra with distributed priorities ⋮ Using transition set sequences to partition behaviors of Petri nets ⋮ Algebraic Structure of Step Traces and Interval Traces ⋮ Contextual Petri nets, asymmetric event structures, and processes ⋮ Analysis issues in Petri nets with inhibitor arcs ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem ⋮ Partial order semantics and read arcs