Efficient Contextual Unfolding

DOI10.1007/978-3-642-23217-6_23zbMath1343.68176OpenAlexW1916795171MaRDI QIDQ3090840

Stefan Schwoon, Paolo Baldan, César Rodríguez

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_23

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Efficient unfolding of contextual Petri nets

Uses Software

• Punf
• Mole

Cites Work

• Efficient unfolding of contextual Petri nets
• An improvement of McMillan's unfolding algorithm
• Unfoldings: A partial-order approach to model checking.
• McMillan’s Complete Prefix for Contextual Nets
• On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Contextual Unfolding