Improving Saturation Efficiency with Implicit Relations

DOI10.1007/978-3-030-21571-2_17MaRDI QIDQ6144219

Shruti Biswal, Andrew S. Miner

Publication date: 29 January 2024

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

zbMATH Keywords

Petri netssaturationdecision diagramreachability set generation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploiting interleaving semantics in symbolic state-space generation
• A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
• Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Correct Hardware Design and Verification Methods

This page was built for publication: Improving Saturation Efficiency with Implicit Relations