Results 1  10
of
34
Process algebra for synchronous communication
 Inform. and Control
, 1984
"... Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite ..."
Abstract

Cited by 363 (51 self)
 Add to MetaCart
Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite system behind the communication algebra is shown to be confluent and terminating (modulo its permutative reductions). Further, some relationships are shown to hold between the four concepts of merging. © 1984 Academic Press, Inc.
Turning SOS Rules into Equations
, 1994
"... Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinit ..."
Abstract

Cited by 87 (20 self)
 Add to MetaCart
Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes.
Termination, deadlock, and divergence
 Journal of the ACM
"... Abstract. In this paper, a process algebra that incorporates expliclt representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The ..."
Abstract

Cited by 40 (14 self)
 Add to MetaCart
Abstract. In this paper, a process algebra that incorporates expliclt representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The operational theory N based upon a suitable adaptation of the notion of bisimulation preorder. The denotational semantics forthelanguage isgiven interms of theinitial continuous algebra that satisfiesa set of equations E, CI~. It is shown that C’IE is fully abstract with respect to our choice of behavioral preorder. Several results ofindependent interest are obtained; namely, the finite approximability of the behavioral preorder and a partial completeness result for the set of equations E with respect to the preorder.
Axiomatizing Prefix Iteration with Silent Steps
 INFORMATION AND COMPUTATION
, 1996
"... Prefix iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the first argument to be an atomic action. The ..."
Abstract

Cited by 29 (15 self)
 Add to MetaCart
Prefix iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the first argument to be an atomic action. The
A Complete Equational Axiomatization for MPA with String Iteration
 DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE, AALBORG UNIVERSITY
, 1995
"... We study equational axiomatizations of bisimulation equivalence for the language obtained by extending Milner's basic CCS with string iteration. String iteration is a variation on the original binary version of the Kleene star operation p*q obtained by restricting the first argument to be a ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We study equational axiomatizations of bisimulation equivalence for the language obtained by extending Milner's basic CCS with string iteration. String iteration is a variation on the original binary version of the Kleene star operation p*q obtained by restricting the first argument to be a nonempty sequence of atomic actions. We show that, for every positive integer k, bisimulation equivalence over the set of processes in this language with loops of length at most k is finitely axiomatizable. We also offer a countably infinite equational theory that completely axiomatizes bisimulation equivalence over the whole language. We prove that this result cannot be improved upon by showing that no finite equational axiomatization of bisimulation equivalence over basic CCS with string iteration can exist, unless the set of actions is empty.
Process Algebra with Recursive Operations
"... ing from just the two atomic actions in I def = fthrow; tailg, FIR b 1 yields I ((throw tail) throw head) = head: First, observe I (throw tail) = . Then, using (4), it easily follows that I ((throw tail) throw head) = head: This expresses that head eventually comes up, and thus ex ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
ing from just the two atomic actions in I def = fthrow; tailg, FIR b 1 yields I ((throw tail) throw head) = head: First, observe I (throw tail) = . Then, using (4), it easily follows that I ((throw tail) throw head) = head: This expresses that head eventually comes up, and thus excludes the infinite sequence of steps present in I ((throw tail) throw head). 7.2 Empty Process Let the symbol " denote the empty process, introduced as a unit for sequential composition by Koymans and Vrancken in [58] (see also [28, 74]). Obvious as " may be (being a unit for \Delta), its introduction is nontrivial because at the same time it must be a unit for k as well. In the design of BPA, PA, ACP and related axiom systems, it has proved useful to study versions of the theory, both with and without ". Just for this reason the star operation with its (original) defining equation as given by Kleene in [54] was introduced in process algebra. Taking y = " in x y, one obtains x ...
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
 GDP FESTSCHRIFT ENTCS, TO APPEAR
"... We describe a programme of research in resource semantics, concurrency theory, bunched logic, and stochastic processes, as applied to mathematical systems modelling. Motivated by a desire for structurally and semantically rigorous discrete event modelling tools, applicable to enterprisescale as wel ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We describe a programme of research in resource semantics, concurrency theory, bunched logic, and stochastic processes, as applied to mathematical systems modelling. Motivated by a desire for structurally and semantically rigorous discrete event modelling tools, applicable to enterprisescale as well as componentscale systems, we introduce a new approach to compositional reasoning based on a development of SCCS with an explicit model of resource. Our calculus models the coevolution of resources and processes with synchronization constrained by the availability of resources. We provide a simple denotational semantics as a parametrization of Abramsky’s synchronization trees semantics for SCCS. We also provide a logical characterization, analogous to HennessyMilner logic’s characterization of bisimulation in CCS, of bisimulation between resource processes which is compositional in the concurrent and local structure of systems. We discuss applications to ideas such as location and access control.
A Complete Equational Axiomatization for Prefix Iteration with Silent Steps
 DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE, AALBORG UNIVERSITY
, 1995
"... Fokkink ((1994) Inf. Process. Lett. 52: 333337) has recently proposed a complete equational axiomatization of strong bisimulation equivalence for MPA i.e., the language obtained by extending Milner's basic CCS with prefix iteration. p q obtained by restricting the first argument to be ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Fokkink ((1994) Inf. Process. Lett. 52: 333337) has recently proposed a complete equational axiomatization of strong bisimulation equivalence for MPA i.e., the language obtained by extending Milner's basic CCS with prefix iteration. p q obtained by restricting the first argument to be an atomic action. In this paper, we extend Fokkink's results to a setting with the unobservable action by giving a complete equational axiomatization of Milner's observation congruence over with two of Milner's standard laws and the following three equations that describe the interplay between the silent nature of and prefix iteration: Using a technique due to Groote, we also show that the resulting axiomatization is !complete, i.e., complete for equality of open terms.
CPO Models for a Class of GSOS Languages
 Proceedings of TAPSOFT '95
, 1995
"... In this paper, we present a general way of giving denotational semantics to a class of languages equipped with an operational semantics that fits the GSOS format of Bloom, Istrail and Meyer. The canonical model used for this purpose will be Abramsky's domain of synchronization trees, and the de ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper, we present a general way of giving denotational semantics to a class of languages equipped with an operational semantics that fits the GSOS format of Bloom, Istrail and Meyer. The canonical model used for this purpose will be Abramsky's domain of synchronization trees, and the denotational semantics automatically generated by our methods will be guaranteed to be fully abstract with respect to the finitely observable part of the bisimulation preorder. In the process of establishing the full abstraction result, we also obtain several general results on the bisimulation preorder (including a complete axiomatization for it), and give a novel operational interpretation of GSOS languages.
On the Finitary Bisimulation
 Nils Klarlund, Madhavan Mukund, and Milind Sohoni
, 1995
"... is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS