Results 1 
3 of
3
Action Structures
, 1992
"... Action structures are proposed as a variety of algebra to underlie concrete models of concurrency and interaction. An action structure is equipped with composition and product of actions, together with two other ingredients: an indexed family of abstractors to allow parametrisation of actions, a ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
Action structures are proposed as a variety of algebra to underlie concrete models of concurrency and interaction. An action structure is equipped with composition and product of actions, together with two other ingredients: an indexed family of abstractors to allow parametrisation of actions, and a reaction relation to represent activity. The eight axioms of an action structure make it an enriched strict monoidal category; however, the work is presented algebraically rather than in category theory. The notion of action structure is developed mathematically, and examples are studied ranging from the evaluation of expressions to the statics and dynamics of Petri nets. For algebraic process calculi in particular, it is shown how they may be defined by a uniform superposition of process structure upon an action structure specific to each calculus. This allows a common treatment of bisimulation congruence. The theory of action structures emphasizes the notion of effect; that ...
Action Structures for the piCalculus
, 1993
"... In a previous paper, action structures were proposed as a variety of algebra to underlie concrete models of concurrent computation and interaction. That work is summarised here, to make the paper selfcontained. In particular, the uniform construction of a process calculus upon an arbitrary action s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In a previous paper, action structures were proposed as a variety of algebra to underlie concrete models of concurrent computation and interaction. That work is summarised here, to make the paper selfcontained. In particular, the uniform construction of a process calculus upon an arbitrary action structure is reviewed. Another relevant concept from the previous paper is recalled, namely the notion of incident set. Its importance is that, in the process calculus uniformly constructed upon any action structure, a bisimulation equivalence which rests upon an incident set is guaranteed to be a congruence for the calculus. The main purpose of this paper is to give a family of action structures for the calculus. Using one of these, the original calculus is obtained by the uniform construction. The most substantial technical element here is the construction of an appropriate incident set for this action structure, yielding a bisimulation congruence for the calculus. Another action stru...
B(PN)²  a Basic Petri Net Programming Notation
 Proceedings of PARLE '93, volume 694 of Lecture Notes in Computer Science
, 1993
"... This paper presents the syntax of a concurrent programming notation which integrates a variety of process interaction techniques, its compositional Petri net semantics via the Box calculus, and an example of using the semantics for program verification. ..."
Abstract
 Add to MetaCart
This paper presents the syntax of a concurrent programming notation which integrates a variety of process interaction techniques, its compositional Petri net semantics via the Box calculus, and an example of using the semantics for program verification.