Modelling of Concurrent and Embedded Systems

Abstract State Machines (ASMs) [13] and Predicate Transition (Pr/T-) Nets [10] constitute alternative approaches to mathematical modelling of concurrent and embedded computing systems. In fact, they are based on similar combinations of the same mathematical concepts: they both combine declarative concepts of first-order logic with the operational view of transition systems; moreover, they are closely related with respect to the underlying notions of concurrency and non-determinism. On the other hand, the resulting system representations differ considerably (e.g., they use distinct notations and are based on complementary system views) so that it is not immediately clear how they can be combined or transformed into each other. The work presented here investigates the formal relation between ASMs and Pr/T-nets with the aim to integrate them into a common framework for modelling concurrent and embedded systems, where Pr/T-nets are considered as a graphical interface for distributed ASMs. For the class of strict Pr/T-nets (which constitutes the basic form of Pr/T-nets) a transformation to distributed ASMs will be given.

[1]  Elvinia Riccobene,et al.  Refining Abstract Machine Specifications of the Steam Boiler Control to Well Documented Executable Code , 1995, Formal Methods for Industrial Applications.

[2]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[3]  Claus Lewerentz,et al.  Formal Development of Reactive Systems , 1995, Lecture Notes in Computer Science.

[4]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[5]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[6]  Igor Durdanovic,et al.  An Evolving Algebra Abstract Machine , 1995, CSL.

[7]  Egon Börger,et al.  A Formal Specification of the PVM Architecture , 1994, IFIP Congress.

[8]  Egon Börger,et al.  Formal Methods for Industrial Applications , 1996, Lecture Notes in Computer Science.

[9]  James K. Huggins.  Kermit: specification and verification , 1993, Specification and validation methods.

[10]  Egon Brger,et al.  Formal de nition of an abstract VHDL''''93 simulator by EA - machines , 1995 .

[11]  Yuri Gurevich,et al.  The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions , 1995, CSL.

[12]  Maria Brielmann.  Modelling Differential Equations by Basic Information Technology Means , 1995, EUROCAST.

[13]  Hartmann J. Genrich.  Equivalence transformations of PrT-nets , 1988, European Workshop on Applications and Theory in Petri Nets.

[14]  Franz Pichler,et al.  Systems Theory and Engineering , 1993, EUROCAST.

[15]  Christian Morgenstern,et al.  Why Use Evolving Algebras for Hardware and Software Engineering ? ? , 1995 .

[16]  Bernd Kleinjohann,et al.  The SEA Language for System Engineering and Animation , 1996, Application and Theory of Petri Nets.