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
An improved protocol reachability analysis technique
Software—Practice & Experience
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Free choice Petri nets
Proving nonreachability by modulo-invariants
Theoretical Computer Science - Special volume on Petri nets
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Efficient encoding schemes for symbolic analysis of petri nets
Proceedings of the conference on Design, automation and test in Europe
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
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Attacking Symbolic State Explosion
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The generalised method for solving problems of the DEDS control synthesis
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Petri nets for modelling metabolic pathways: a survey
Natural Computing: an international journal
| Hi-index | 0.00 |
Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an efficient strategy for the analysis of Petri nets. The existing techniques for the symbolic encoding of each marking use a fixed set of variables per place, leading to encoding schemes with very low density. This drawback has been previously mitigated by using Zero-Suppressed BDDs, that provide a typical reduction of BDD sizes by a factor of two. Structural Petri net theory provides P-invariants that help to derive more efficient encoding schemes for the BDD representations of markings. P-invariants also provide a mechanism to identify conservative upper bounds for the reachable markings. The unreachable markings determined by the upper bound can be used to alleviate both the calculation of the exact reachability set and the scrutiny of properties. Such approach allows to drastically decrease the number of variables for marking encoding and reduce memory and CPU requirements significantly.