Symbolic Reachability Analysis of Integer Timed Petri Nets

DOI10.1007/978-3-540-95891-8_53MaRDI QIDQ3599107zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1361123
• scientific article; zbMATH DE number 4209631
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Optimal reachability in cost time Petri nets
• Algebraical characterisation of interval-timed Petri nets with discrete delays

Cites work

• Complexity of some problems in Petri nets
• Correct Hardware Design and Verification Methods
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1701768 (Why is no real title available?)
• scientific article; zbMATH DE number 1956594 (Why is no real title available?)
• scientific article; zbMATH DE number 1979555 (Why is no real title available?)
• scientific article; zbMATH DE number 1423226 (Why is no real title available?)
• scientific article; zbMATH DE number 956814 (Why is no real title available?)

Cited in

(14)

• Optimal reachability in cost time Petri nets
• Ten years of saturation: a Petri net perspective
• scientific article; zbMATH DE number 4213468 (Why is no real title available?)
• Approximate Symbolic Reachability of Networks of Transition Systems
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• scientific article; zbMATH DE number 1337891 (Why is no real title available?)
• scientific article; zbMATH DE number 1361123 (Why is no real title available?)
• Modelling integer linear programs with petri nets
• Algebraical characterisation of interval-timed Petri nets with discrete delays
• SMT-based reachability checking for bounded time Petri nets
• Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Using forward reachability analysis for verification of timed Petri nets
• Applications and Theory of Petri Nets 2004

Describes a project that uses

Uses Software

• SMART_
• PEPS
• SPIN

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599107)