论文信息 - Communication as Unification in the Petri Box Calculus

Communication as Unification in the Petri Box Calculus

A way of handling abstract data types in the Petri Box Calculus [BDH92] is proposed. Semantic objects are A-nets, a kind of algebraic nets with Boxe like interfaces. The synchronization operation on A-nets is discussed and some basic (non-trivial) algebraic properties of the synchronization with syntactic unification are shown.

Hanna Klaudel | Elisabeth Pelz | E. Pelz | Hanna Klaudel

[1] Raymond R. Devillers,et al. General Refinement and Recursion Operators for the Petri Box Calculus , 1993, STACS.

[2] Richard P. Hopkins,et al. B(PN)2 - a Basic Petri Net Programming Notation , 1993, PARLE.

[3] Gianna Reggio,et al. Algebraic Specification of Concurrency , 1991, COMPASS/ADT.

[4] Wolfgang Reisig,et al. Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..

[5] Hanna Klaudel,et al. Refinement and Recursion in a High Level Petri Box Calculus , 1995, STRICT.

[6] Raymond R. Devillers,et al. The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[7] Hanna Klaudel,et al. A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2 , 1995, Application and Theory of Petri Nets.

[8] Jacques Vautherin,et al. Parallel systems specitications with coloured Petri nets and algebraic specifications , 1986, European Workshop on Applications and Theory of Petri Nets.