Computing the reveals relation in occurrence nets

DOI10.1016/J.TCS.2013.04.028MaRDI QIDQ391112zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computing the reveals relation in occurrence nets
• Building occurrence nets from reveals relations
• scientific article; zbMATH DE number 4045169
• scientific article; zbMATH DE number 3917724
• Occurrence nets then and now: the path to structured occurrence nets
• Reversible occurrence nets and causal reversible prime event structures
• scientific article; zbMATH DE number 2101254
• Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets
• Relational computation of sets of relations
• scientific article; zbMATH DE number 995880

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 4028916 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• An improvement of McMillan's unfolding algorithm
• Branching processes of Petri nets
• Canonical prefixes of Petri net unfoldings
• Diagnosis of asynchronous discrete-event systems: a net unfolding approach
• Distributed monitoring of concurrent and asynchronous systems
• From local to global temporal logics over Mazurkiewicz traces.
• Partial order techniques for distributed discrete event systems: why you cannot avoid using them
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets
• Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces

Cited in

(7)

• Flow unfolding of multi-clock nets
• Spreading nets: a uniform approach to unfoldings
• Computing the reveals relation in occurrence nets
• Building occurrence nets from reveals relations
• On the expressive power of behavioral profiles
• scientific article; zbMATH DE number 3917724 (Why is no real title available?)
• Computing a parametric reveals relation for bounded equal-conflict Petri nets

Describes a project that uses

Uses Software

• PEP
• Mole

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391112)