Journal ArticleDOI
Axiomatising finite concurrent processes
TLDR
It is shown, for a particular language based on finite (CCS) terms, that the generalised equivalence coincides with observational equivalence; the more powerful observers do not lead to a finer equivalence.Abstract:
We re-examine the well-known observational equivalence between processes with a view to modifying it so as to distinguish between concurrent and purely nondeterministic processes.Observational equivalence is based on atomic actions or observations. In the first part of this paper we generalise these atomic observations so that arbitrary processes may act as observers. We show, for a particular language based on finite (CCS) terms, that the generalised equivalence coincides with observational equivalence; the more powerful observers do not lead to a finer equivalence.In the second part of the paper we consider observers which can distinguish the beginning and ending of atomic actions. The resulting equivalence distinguishes a concurrent process from the purely nondeterministic process obtained by interleaving its possible actions. We give a complete axiomatisation for the congruence generated by the new equivalence.read more
Citations
More filters
Journal ArticleDOI
Refinement of actions and equivalence notions for concurrent systems
Rob van Glabbeek,Ursula Goltz +1 more
TL;DR: It is proved that linear time partial order semantics are invariant under refinement and it is investigated the interplay of action refinement with abstraction in terms of equivalence notions for concurrent systems, considering both linear time and branching time approaches.
Book
Process Algebra: Equational Theories of Communicating Processes
TL;DR: This book assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation, and describes the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems.
Book ChapterDOI
A survey of behaviour and equivalence preserving refinements of Petri nets
TL;DR: Results on refinements of places and transitions in Petri nets are surveyed and the semantics of a net is a description of the possible runs incorporating information on choices to a varying degree.
Journal ArticleDOI
Termination, deadlock, and divergence
Luca Aceto,Matthew Hennessy +1 more
TL;DR: A process algebra that incorporates explicit representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed and it is shown that they agree.
Dissertation
Axioms for concurrency
TL;DR: It is shown that strong observational congruence over a subset of the usual CCS algebra with the full merge operator cannot be completely characterised by any finite set of equational axioms, thus requiring the power of the Expansion Theorem to present an infinite set of axiom within a single axiom schema.