ACM Transactions on Computer Systems (TOCS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
On computing the transitive closure of a state transition relation
DAC '93 Proceedings of the 30th international Design Automation Conference
A decomposition approach for stochastic reward net models
Performance Evaluation
Numerical Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Integrating synchronization with priority into a Kronecker representation
Performance Evaluation
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
The Cost of Eliminating Vanishing Markings from Generalized Stochastic Petri Nets
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
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
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Storage Alternatives for Large Structured State Spaces
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
INFORMS Journal on Computing
A Data Structure for the Efficient Kronecker Solution of GSPNs
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
SMART: Simulation and Markovian Analyzer for Reliability and Timing
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
Efficient Solution of GSPNs Using Canonical Matrix Diagrams
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
TACAS'03 Proceedings of the 9th international conference 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
Saturation for a General Class of Models
IEEE Transactions on Software Engineering
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Symbolic Reachability Analysis of Integer Timed Petri Nets
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Improving static variable orders via invariants
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
A formal language toward the unification of model checking and performance evaluation
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
| Hi-index | 0.00 |
Implicit techniques for representing and generating the reachability set of a high-level model have become quite efficient. However, such techniques are usually restricted to models whose events have equal priority. Models containing events with differing classes of priority or complex priority structure, in particular models with immediate events, have thus been required to use less-efficient explicit reachability set generation techniques. In this paper, we present an efficient implicit technique, based on multi-valued decision diagram (MDD) representations for sets of states and matrix diagram representations for next-state functions, that can handle models with complex priority structure. We adapt an efficient Kronecker-based reachability set generation algorithm to work with matrix diagrams. If the model contains immediate events, the vanishing states can be eliminated either during generation, by manipulating the matrix diagram, or after generation, by manipulating the MDD. We apply both techniques to several models and give detailed experimental results.