Efficient encoding schemes for symbolic analysis of Petri nets

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 1998, Pages 790-795

  Pastor, Enric ^a   Cortadella, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC TECHNIQUES; ASYNCHRONOUS CIRCUITS; BINARY DECISION DIAGRAMS (BDDS); CONCURRENT SYSTEMS; EFFICIENT ENCODING; STATE EXPLOSION PROBLEMS; SYMBOLIC ANALYSIS; SYMBOLIC TECHNIQUES;

ASYNCHRONOUS SEQUENTIAL LOGIC; BINARY DECISION DIAGRAMS; ENCODING (SYMBOLS); NETWORK PROTOCOLS;

PETRI NETS;

EID: 6344227195     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.1998.655948     Document Type: Conference Paper

References (18)

1. K. S. Brace, R. E. Bryant, andR. L. Rudell. Efficient implementation of a BDD package. In Proc. DAC, pages 40-45, 1990.
2. R.E. Bryant. Graph-based algorithms for boolean functionmanipulation. IEEE Transactions on Computers, C-35(8):677-691,August 1986.
3. 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.
4. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Synthesizing Petri Nets from State-Based Models. In Proc. ICCAD, pages 164-171. IEEE Computer Society Press, November 1995.
5. J. Cortadella, L. Lavagno, and Ellen Sentovich. Logic synthesis techniques for embedded control code optimization. In Proc. Int. Workshop on Logic Synthesis, 1997.
6. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, Cambridge, Great Britain, 1995.
7. M.Hack. Analysis of production schemata by Petri nets. M.s. thesis, MIT, February 1972.
8. Kiyoharu Hamaguchi, Hiromi Hiraishi, and Shuzo Yajima. Design verification of asynchronous sequential circuits using symbolic model checking. In International Symposium on Logic Synthesis and MicroprocessorArchitecture, pages 84-90, July 1992.
9. M. Kishinevsky, J. Cortadella, A. Kondratyev, L. Lavagno, Alex Taubin, andA.Yakovlev.Coupling asynchrony and interrupts: Place chart nets. In 18th Int. Conf. on Application andTheory of Petri Nets, volume 1248 of LNCS. Springer-Verlag, June 1997.
10. A. Kondratyev, J. Cortadella, M. Kishinevsky, E. Pastor, O. Roig, andA. Yakovlev. Checking signal transition graph implementability by symbolic BDD traversal. In Proc. EDAC-ETC-EuroASIC, pages 325-332, Paris, March 1995.
11. K. Lautenbach. Linear algebraic techniques for place/transition nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: CentralModels and Their Properties, Advances in Petri Nets 1986, volume 254 of LNCS, pages 142-167. Springer-Verlag, 1987.
12. David E. Long. A binary decision diagram (BDD) package, June 1993. Manual page.
13. E. J. McCluskey. Minimization of boolean functions. Bell Syst. Technical Journal, (35):1417-1444,November 1956.
14. 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.
15. Tadao Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541-574,April 1989.
16. E. Pastor, O. Roig, J. Cortadella, and R.M. Badia. Petri net analysis using boolean manipulation. In 15th Int. Conf. on Application and Theory ofPetriNets, volume 815 of LNCS, pages 416-435.Springer-Verlag, June 1994.
17. O. Roig, J. Cortadella, and E. Pastor. Verification of asynchronous circuits by BDD-based model checking of Petri nets. In 16th Int. Conf. on Application and Theory of Petri Nets, volume 935 of LNCS, pages 374-391, Torino, June 1995. Springer-Verlag.
18. 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.