Abstract
This paper presents a novel analysis approach for bounded Petri nets. The net behavior is modeled by boolean functions, thus reducing reasoning about Petri nets to boolean calculation. The state explosion problem is managed by using Binary Decision Diagrams (BDDs), which are capable to represent large sets of markings in small data structures. The ability of Petri nets to model systems, the flexibility and generality of boolean algebras, and the efficient implementation of BDDs, provide a general environment to handle a large variety of problems. Examples are presented that show how all the reachable states (1018) of a Petri net can be efficiently calculated and represented with a small BDD (103 nodes). Properties requiring an exhaustive analysis of the state space can be verified in polynomial time in the size of the BDD.
Supported by CYCIT TIC 91-1036 and Dept. d'Ensenyament de la Generalitat de Catalunya
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient implementation of a BDD package. In Proc. of the 27th DAC, pages 40–45, June 1990.
F. M. Brown. Boolean Reasoning: The Logic of Boolean Equations. Kluwer Academic Publishers, 1990.
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proc. of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
Tam-Anh Chu. Synthesis of Self-timed VLSI Circuits from Graph-theoretic Specifications. Ph.D. thesis, MIT, June 1987.
O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using boolean functional vectors. In L. Claesen, editor, Proc. IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111–128, Leuven, Belgium, November 1989.
L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli. Algorithms for synthesis of hazard-free asynchronous circuits. In Proc. of the 28th. DAC, pages 302–308, June 1991.
C. Y. Lee. Binary decision programs. Bell System Technical Journal, 38(4):985–999, July 1959.
H-T. Liaw and C-S. Lin. On the OBDD representation of generalized boolean functions. IEEE Transactions on Computers, 41(6):661–664, June 1992.
K. L. McMillan. Using Unfoldings to Avoid the State Explosion Problem in Verification of Asynchronous Circuits. In Proc. of the 4th Workshop on Computer-Aided Verification, June 1992.
T. Murata. Petri Nets: Properties, analysis and applications. Proc. of the IEEE, Vol. 77(4):541–574, April 1989.
L. Ya. Rosenblum and A. V. Yakovlev. Signal graphs: From self-timed to timed ones. In International Workshop on Timed Petri Nets, pages 199–206, 1985.
H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli. Implicit enumeration of finite state machines using BDD's. In Proc. of the ICCAD, pages 130–133, November 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pastor, E., Roig, O., Cortadella, J., Badia, R.M. (1994). Petri net analysis using boolean manipulation. In: Valette, R. (eds) Application and Theory of Petri Nets 1994. ICATPN 1994. Lecture Notes in Computer Science, vol 815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58152-9_23
Download citation
DOI: https://doi.org/10.1007/3-540-58152-9_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58152-9
Online ISBN: 978-3-540-48462-2
eBook Packages: Springer Book Archive