SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets

DOI10.1007/978-3-642-18222-8_4zbMath1312.68137OpenAlexW1638774901MaRDI QIDQ3066134

Andrzej Zbrzezny, Wojciech Penczek, Agata Półrola

Publication date: 8 January 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-18222-8_4

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)

Timed Aggregate Graph: A Finite Graph Preserving Event- and State-Based Quantitative Properties of Time Petri Nets

Uses Software

• Romeo
• VerICS

This page was built for publication: SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets