Decompositional Petri Net Reductions

DOI10.1007/978-3-642-00255-7_24zbMath1211.68272OpenAlexW1548310631MaRDI QIDQ3605479

Astrid Rakow

Publication date: 24 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00255-7_24

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 (1)

Decompositional Petri Net Reductions

Uses Software

• Punf

Cites Work

• Decompositional Petri Net Reductions
• An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets
• Free Choice Petri Nets
• Computer Aided Verification
• Slicing Petri Nets with an Application to Workflow Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decompositional Petri Net Reductions