Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Linear algebraic techniques for place/transition nets
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Free choice Petri nets
Synthesizing Petri nets from state-based models
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
BDDs vs. Zero-Suppressed BDDs: for CTL Symbolic Model Checking of Petri Nets
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
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
Coupling Asynchrony and Interrupts: Place Chart Nets
ICATPN '97 Proceedings of the 18th 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
Checking signal transition graph implementability by symbolic BDD traversal
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Distributed and structured analysis approaches to study large and complex systems
Lectures on formal methods and performance analysis
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
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Structural Methods to Improve the Symbolic Analysis of Petri Nets
Proceedings of the 20th 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
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
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
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
Memory efficient state space storage in explicit software model checking
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
| Hi-index | 0.00 |
Petri nets are a graph-based formalism appropriate to model concurrent systems such as asynchronous circuits or network protocols. Symbolic techniques based on Binary Decision Diagrams (BDDs) have emerged as one of the strategies to overcome the state explosion problem in the analysis of systems modeled by Petri nets. The existing techniques for state encoding use a variable-per-place strategy that leads to encoding schemes with very low density. This drawback has been partially mitigated by using Zero-Suppressed BDDs, that provide a typical reduction of BDD sizes by a factor of two. This work presents novel encoding schemes for Petri nets. By using algebraic techniques to analyze the topology of the net, sets of places "structurally related" can be derived and encoded by only using a logarithmic number of boolean variables. Such approach allows to drastically decrease the number of variables for state encoding and reduce memory and CPU requirements significantly.