Symbolic Reachability Analysis of Integer Timed Petri Nets

DOI10.1007/978-3-540-95891-8_53zbMath1206.68219OpenAlexW1527188073MaRDI QIDQ3599107

Min Wan, Gianfranco Ciardo

Publication date: 3 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-540-95891-8_53

Mathematics Subject Classification ID

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

Uses Software

• PEPS
• SPIN
• SMART_

Cites Work

• Complexity of some problems in Petri nets
• Graph-Based Algorithms for Boolean Function Manipulation
• Correct Hardware Design and Verification Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Symbolic Reachability Analysis of Integer Timed Petri Nets