McMillan’s Complete Prefix for Contextual Nets

DOI10.1007/978-3-540-89287-8_12zbMath1171.68560OpenAlexW1636538849MaRDI QIDQ3599219

Andrea Corradini, Stefan Schwoon, Barbara König, Paolo Baldan

Publication date: 3 February 2009

Published in: Transactions on Petri Nets and Other Models of Concurrency I (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89287-8_12

zbMATH Keywords

verificationPetri netsunfoldingread arcscomplete finite prefix

Mathematics Subject Classification ID

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

Related Items (5)

Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Efficient unfolding of contextual Petri nets ⋮ An Algorithm for Direct Construction of Complete Merged Processes ⋮ Construction and SAT-Based Verification of Contextual Unfoldings ⋮ Efficient Contextual Unfolding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the nature of events: another perspective in concurrency
• Petri nets, event structures and domains. I
• Branching processes of Petri nets
• An improvement of McMillan's unfolding algorithm
• Contextual Petri nets, asymmetric event structures, and processes
• Contextual nets
• Semantics of inhibitor nets
• Efficiency of asynchronous systems and read arcs in petri nets
• CONCUR 2004 - Concurrency Theory

This page was built for publication: McMillan’s Complete Prefix for Contextual Nets