Building occurrence nets from reveals relations

DOI10.3233/FI-2013-809MaRDI QIDQ5300614zbMATH OpenOpenAlexFDO

Authors Andie Balaguer, Thomas Chatain, Stefan Haar

Publication date 27 June 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2013-809

zbMATH Keywords

event dependenciesevent logicsoccurrence netPetri netssynthesis of occurrence 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

• scientific article; zbMATH DE number 1515286
• Computing the reveals relation in occurrence nets
• Computing the reveals relation in occurrence nets
• Closed sets in occurrence nets with conflicts
• Occurrence nets then and now: the path to structured occurrence nets

Cited in

(11)

• Spreading nets: a uniform approach to unfoldings
• A Canonical Contraction for Safe Petri Nets
• MODELING OCCURRENCES OF OBJECTS IN RELATIONS
• scientific article; zbMATH DE number 3917724 (Why is no real title available?)
• scientific article; zbMATH DE number 4045169 (Why is no real title available?)
• Computing the reveals relation in occurrence nets
• scientific article; zbMATH DE number 1515286 (Why is no real title available?)
• Computing the reveals relation in occurrence nets
• Flow unfolding of multi-clock nets
• Non-interference notions based on reveals and excludes relations for Petri nets
• Computing a parametric reveals relation for bounded equal-conflict Petri nets

This page was built for publication: Building occurrence nets from reveals relations

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