Computing the reveals relation in occurrence nets
From MaRDI portal
Publication:391112
DOI10.1016/j.tcs.2013.04.028zbMath1294.68112MaRDI QIDQ391112
Stefan Haar, Christian Kern, Stefan Schwoon
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.028
automatic analysis; behavior of Petri nets; partial-order theory of concurrency; structure of Petri nets
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Flow Unfolding of Multi-clock Nets, On the expressive power of behavioral profiles, Spreading nets: a uniform approach to unfoldings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces
- Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
- Branching processes of Petri nets
- An improvement of McMillan's unfolding algorithm
- Distributed monitoring of concurrent and asynchronous systems
- Canonical prefixes of Petri net unfoldings
- Partial order techniques for distributed discrete event systems: why you cannot avoid using them
- From local to global temporal logics over Mazurkiewicz traces.
- Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets
- Diagnosis of asynchronous discrete-event systems: a net unfolding approach