Interval semantics for Petri nets with inhibitor arcs
From MaRDI portal
Publication:1749475
DOI10.1016/j.tcs.2018.03.003zbMath1390.68453OpenAlexW2796215314WikidataQ130031025 ScholiaQ130031025MaRDI QIDQ1749475
Mohammad Alqarni, Ryszard Janicki
Publication date: 17 May 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.03.003
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Modeling concurrency with interval traces
- Process semantics of general inhibitor nets
- Nets, time and space
- Structure of concurrency
- Relational structures model of concurrency
- Interval graphs and interval orders
- Sequential and concurrent behaviour in Petri net theory
- Fundamentals of modelling concurrency using discrete relational structures
- Partial order semantics and read arcs
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Contextual nets
- Semantics of inhibitor nets
- Intransitive indifference with unequal indifference intervals
- On Characterising Distributability
- Modeling Interval Order Structures with Partially Commutative Monoids
- On Interval Process Semantics of Petri Nets with Inhibitor Arcs
- The non-sequential behaviour of Petri nets
- Complete Process Semantics for Inhibitor Nets
- Algebraical Characterisation of Interval-Timed Petri Nets with Discrete Delays
- The mutual exclusion problem
This page was built for publication: Interval semantics for Petri nets with inhibitor arcs