Computing the reveals relation in occurrence nets

DOI10.1016/J.TCS.2013.04.028zbMath1294.68112OpenAlexW2072146911MaRDI 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

zbMATH Keywords

automatic analysisbehavior of Petri netspartial-order theory of concurrencystructure of Petri nets

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

On the expressive power of behavioral profiles ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Flow Unfolding of Multi-clock Nets

Uses Software

• Mole
• PEP

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

This page was built for publication: Computing the reveals relation in occurrence nets