Building Occurrence Nets from Reveals Relations

DOI10.3233/FI-2013-809zbMath1293.68199OpenAlexW1610860021MaRDI QIDQ5300614

Thomas Chatain, Andie Balaguer, 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

Petri netsoccurrence netevent dependenciesevent logicssynthesis 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)

Related Items (4)

A Canonical Contraction for Safe Petri Nets ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Flow Unfolding of Multi-clock Nets ⋮ Non-interference Notions Based on Reveals and Excludes Relations for Petri Nets

This page was built for publication: Building Occurrence Nets from Reveals Relations