SAT-solving the coverability problem for Petri nets
From MaRDI portal
Publication:1878911
DOI10.1023/B:FORM.0000004786.30007.f8zbMath1073.68057MaRDI QIDQ1878911
Aletta Nylén, S. Purushothaman Iyer, Parosh Aziz Abdulla
Publication date: 9 September 2004
Published in: Formal Methods in System Design (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) 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 (3)
A Programming Language for Spatial Distribution of Net Systems ⋮ Preserving correctness during business process model configuration ⋮ Finding Lean Induced Cycles in Binary Hypercubes
This page was built for publication: SAT-solving the coverability problem for Petri nets
