Structural methods to improve the symbolic analysis of petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1639, Issue , 1999, Pages 26-45

  Pastor, Enric ^a   Cortadella, Jordi ^a   PeÑa, Marco A ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; ENCODING (SYMBOLS);

EFFICIENT ENCODING; EFFICIENT STRATEGY; ENCODING SCHEMES; PETRI NET THEORIES; REACHABILITY SET; STRUCTURAL METHODS; SYMBOLIC ANALYSIS; SYMBOLIC TECHNIQUES;

PETRI NETS;

EID: 84958984213     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48745-X_3     Document Type: Conference Paper

References (20)

1. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. In Proc. ICCAD, pages 188-191, November 1993.
2. K. S. Brace, R. E. Bryant, and R. L. Rudell. Efficient implementation of a BDD package. In Proc. DAC, pages 40-45, 1990.
3. F. M. Brown. Boolean Reasoning: The Logic of Boolean Equations. Kluwer Academic Publishers, 1990.
4. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
5. Jerry R. Burch, Edmund M. Clarke, D. E. Long, Kenneth L. McMillan, and David L. Dill. Symbolic model checking for sequential circuit verification. IEEE Trans. on CAD, 13(4):401-424, 1994.
6. G. Chiola Compiling Techniques for the Analysis of Stochastic Petri Nets. In 4th Int. Conf. on Modeling Techniques and Tools for Computer Performance Evaluation, pages 11-24
7. 1989.
8. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, Cambridge, Great Britain, 1995.
9. J. Desel, K.P. Neuendorf, and M.D. Radola. Proving nonreachability by modulo- invariants. Theoretical Computer Science, (153):49-64, 1996.
10. C.M. Fiduccia and R.M. Mattheyses. A linear time heuristic for improving network partitions. In Proc. DAC, 1982.
11. M. Hack. Analysis of production schemata by Petri nets. M.s. thesis, MIT, February 1972.
12. G. J. Holzmann. An Improved Protocol Reachability Analysis Technique Software Practice and Experience, 18(2):137-161, 1988.
13. R. Kannan and A. Bachem. Polynomial algorithms for computing the smith and hermite normal forms of an integer matrix. SIAM J. Comput., 4(8):499-577, 1979.
14. K. Lautenbach. Linear algebraic techniques for place/transition nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, volume 254 of LNCS, pages 142-167. Springer-Verlag, 1987.
15. E. J. McCluskey. Minimization of boolean functions. Bell Syst. Technical Journal, (35):1417-1444, November 1956.
16. G. Memmi and G. Roucairol. Linear algebra in net theory. In W. Brauer, editor, Net Theory and Applications, volume 84 of LNCS, pages 213-223. Springer-Verlag, 1980.
17. Tadao Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541-574, April 1989.
18. E. Pastor and J. Cortadella. Efficient encoding schemes for symbolic analysis of petri nets. In Proc. Design, Automation and Test in Europe, pages 790-795, Paris (France), February 1998.
19. E. Pastor, O. Roig, J. Cortadella, and R. M. Badia. Petri net analysis using boolean manipulation. In 15th Int. Conf. on Application and Theory of Petri Nets, volume 815 of LNCS, pages 416-435. Springer-Verlag, June 1994.
20. T. Yoneda, H. Hatori, A. Takahara, and S. Minato. BDDs vs. Zero-Suppressed BDDs: for CTL symbolic model checking of petri nets. In Proc. of Formal Methods in Computer-Aided Design, volume 1166 of LNCS, pages 435-449. Springer-Verlag, 1996.