Abstract
In this paper we focus on the task of modelling and validating the behavior of a VLSI chip using hierarchical Colored Petri Nets (CP-Nets or CPN’s). We discuss current practice in hardware design at the register transfer level. We describe an approach whereby engineering block diagrams, supplemented with suitable formal inscriptions, can be mapped directly to a CPN model. We show in detail a CPN model of an actual digital filter chip from a super-computer. We discuss the possibility of using this model to validate the logic of the design. We describe the potential of using formal analysis methods and propose a simplification technique for reducing the combinatorics involved in Occurrence Graph Analysis. We discuss performance issues and propose an extension to Colored Petri Nets that incorporates the concept of time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference List
Design/CPN User’s Manual, Version 1.21: Meta Software Corporation, Cambridge, Massachusetts, USA, October 1989.
P. Huber, K. Jensen, R. Shapiro: Hierarchies in Colored Petri Nets. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989. Presented at the 10th International Conference on Application and Theory of Petri Nets, Bonn, June 1989.
Robert Harper, Robin Milner, and Mads Tofte: The Definition of Standard ML, Version 2. Technical Report ECS-LFCS-88–62, University of Edinburgh, LFCS, Department of Computer Science, University of Edinburgh, The King’s Buidings, Edinburgh EH9 3JZ, August 1988.
P. Huber, A.M. Jensen, L.O. Jepsen and K. Jensen: Reachability Trees for High-Level Petri Nets. Theoretical Computer Science 45 (1986), 261–292.
K. Jensen: Coloured Petri Nets and the Invariant Method. Theoretical Computer Science 14 (1981), 317–336.
M. Jantzen and R. Valk: Formal Properties of Place/Transition Nets. In: W. Brauer, G. Goos and J. Hartmanis (eds.): Net Theory and Applications: Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, 1979, Lecture Notes in Computer Science, Vol. 84, Springer-Verlag 1979, 165–21.
F. Commoner, A.W. Holt, S. Even. A. Pnueli: Marked Directed Graphs, Computer and System Sc. 5, 511–523 (1971).
Ajmone Marsan M., Balbo G., Conte G., A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multi-Processors Systems; ACM Trans. on Computer Systems, Vol. 2, N. 2, May 1984
K. Jensen: Coloured Petri Nets In: W. Brauer, W. Reisig and G. Rozenberg (eds.): Applications and Relationships to Other Models of Concurrency, Advanced in Petri Nets 1986–Part I, Lecture Notes of Computer Science, vol. 254, Springer-Verlag 1987, 248–299.
H. J. Genrich, K. Lautenbach, P. S. Thiagarajan: Elements of General Net Theory. In: W. Brauer, G. Goos and J. Hartmanis (eds.): Net Theory and Applications: Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, 1979, Lecture Notes in Computer Science, Vol. 84, Springer-Verlag 1980, 76–92.
D. A. Marca and C. L. McGowan: SADT, McGraw-Hill, New York, 1988.
K. Jensen and P. Huber: Colour Set Restrictions, Specification paper for the CPN Palette - Part la. Version 1.0. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.
K. Jensen and P. Huber: Performance Analysis, Specification paper for the CPN Palette - Part 4a, Version 1.0. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.
Design/IDEF User’s Manual, Version 1.5. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.
Carlo Ghezzi, Dino Mandrioli, Sandro Morasca, Mauro Pezze: A General Way To Put Time In Petri Nets, ACM, January 1989 (ACM 0–89791–305–1/89/0500/0060).
K.M. van Hee, L.J. Somers and M. Voorhoeve: Executable Specifications For Distributed Information Systems. In: Information System Concepts: An In-Depth Analysis, E.D. Falkenberg, Paul Lindgreen (eds.), Elsevier Science Publishers B.V., IFIP, 1989.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Shapiro, R.M. (1991). Validation of a VLSI Chip Using Hierarchical Colored Petri Nets. In: Jensen, K., Rozenberg, G. (eds) High-level Petri Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84524-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-84524-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54125-7
Online ISBN: 978-3-642-84524-6
eBook Packages: Springer Book Archive