Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector
IEEE Transactions on Software Engineering
Improving the linearly based characterization of P/T nets
APN 90 Proceedings on Advances in Petri nets 1990
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Reducing BDD size by exploiting functional dependencies
DAC '93 Proceedings of the 30th international Design Automation Conference
BDD variable ordering for interacting finite state machines
DAC '94 Proceedings of the 31st annual Design Automation Conference
GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets
Performance Evaluation - Special issue: performance modeling tools
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Efficient encoding schemes for symbolic analysis of petri nets
Proceedings of the conference on Design, automation and test in Europe
Symbolic Analysis of Bounded Petri Nets
IEEE Transactions on Computers
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Proceedings on Mathematical Foundations of Computer Science
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verification of Asynchronous Circuits by BDD-based Model Checking of Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Symbolic Methods for the State Space Exploration of GSPN Models
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Dynamic Re-Encoding During MDD Minimization
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Implicit GSPN reachability set generation using decision diagrams
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
The saturation algorithm for symbolic state-space exploration
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Logic and stochastic modeling with SMART
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Symmetry breaking in distributive networks
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Learning to order BDD variables in verification
Journal of Artificial Intelligence Research
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Using Petri net invariants in state space construction
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
New metrics for static variable ordering in decision diagrams
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Ten years of saturation: a petri net perspective
Transactions on Petri Nets and Other Models of Concurrency V
| Hi-index | 0.00 |
Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm for Petri nets implemented in SmArT, whose efficiency relies on exploiting event locality. This paper presents a novel, static ordering heuristic that considers place invariants of Petri nets. In contrast to related work, we use the functional dependencies encoded by invariants to merge decision-diagram variables, rather than to eliminate them. We prove that merging variables always yields smaller MDDs and improves event locality, while eliminating variables may increase MDD sizes and break locality. Combining this idea of merging with heuristics for maximizing event locality, we obtain an algorithm for static variable order which outperforms competing approaches regarding both time-efficiency and memory-efficiency, as we demonstrate by extensive benchmarking.