Abstract
The formal description of hardware protocols allows system engineers to check these protocols for some important properties, such as completeness and consistency. In this paper, a methodology called trigger graph is introduced. It uses a notation that is similar to timing diagrams, but it strictly avoids their disadvantage of being ambiguous. In addition, the exact mathematical notation of the trigger graph gives the possibility to transform it into Petri nets. This gives the benefit to use methods developed for Petri nets also for the check of hardware protocols, for example to check them for security conditions. The trigger graph methodology is illustrated with three realistic examples: the control of traffic lights, the control of a railway-barrier, and the read-protocol for a DRAM.
Preview
Unable to display preview. Download preview PDF.
Bibliographie
André, C.: Delays in Synchronized Elementary Net Systems. In: Rozenberg, G.; Goos, G.; Hartmanis, J. (Eds.): Advance in Petri Nets, 1991, LNCS, Vol. 524. Springer-Verlag: Berlin 1991, pp. 1–28
Thurner, E.M.; Wincheringer, C.: TOMSPIN — A Tool for Modelling With Stochastic Petri Nets. Proceedings EUROCAST '95
Leveson, N. G.; Stolzy, J. L.: Safety Analysis Using Petri Nets. IEEE Trans. Software Engineering, Vol. SE-13, No. 3, March 1987, pp. 386–397
Reisig, W.: Petrinetze. Eine Einführung. Springer-Verlag: Berlin 21986
Toshiba: Databook MOS Memory (DRAM). Tokyo, Jan. 1993
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thurner, E.M. (1996). Proving system properties by means of trigger-graph and Petri nets. In: Pichler, F., Díaz, R.M., Albrecht, R. (eds) Computer Aided Systems Theory — EUROCAST '95. EUROCAST 1995. Lecture Notes in Computer Science, vol 1030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034752
Download citation
DOI: https://doi.org/10.1007/BFb0034752
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60748-9
Online ISBN: 978-3-540-49358-7
eBook Packages: Springer Book Archive