Reduced state space representation for unbounded vector state spaces

DOI10.1007/3-540-61363-3_13zbMath1418.68145OpenAlexW1552519333MaRDI QIDQ4633164

Kunihiko Hiraishi

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_13

zbMATH Keywords

state spacebinary decision diagramsplit pointcoverability treecapacity condition

Mathematics Subject Classification ID

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

Related Items (1)

Proving safety properties of infinite state systems by compilation into Presburger arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On weak persistency of Petri nets
• On structural conditions for weak persistency and semilinearity of Petri nets
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Parallel program schemata
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams

This page was built for publication: Reduced state space representation for unbounded vector state spaces