DEFINITION: Beahvioral equivalences serve to establish in which cases two reactive (possible concurrent) systems offer similar interaction capabilities relatively to other systems representing their operating environment. Behavioral equivalences have been mainly developed in the context of process algebras, mathematically rigorous languages that have been used for describing and verifying properties of concurrent communicating systems. By relying on the so called structural operational semantics (SOS), labelled transition systems, are associated to each term of a process algebra. Behavioral equivalences are used to abstract from unwanted details and identify those labelled transition systems that react “similarly” to external experiments. Due to the large number of properties which may be relevant in the analysis of concurrent systems, many different theories of equivalences have been proposed in the literature. The main contenders consider those systems equivalent that (i) perform the same sequences of actions, or (ii) perform the same sequences of actions and after each sequence are ready to accept the same sets of actions, or (iii) perform the same sequences of actions and after each sequence exhibit, recursively, the same behavior. This approach leads to many different equivalences that preserve significantly different properties of systems.
[1]
C. A. R. Hoare,et al.
Communicating sequential processes
,
1978,
CACM.
[2]
R. V. Glabbeek.
The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR
,
2007
.
[3]
Andrew William Roscoe,et al.
The Theory and Practice of Concurrency
,
1997
.
[4]
C. A. R. Hoare,et al.
A Theory of Communicating Sequential Processes
,
1984,
JACM.
[5]
Rocco De Nicola,et al.
Testing Equivalences for Processes
,
1984,
Theor. Comput. Sci..
[6]
Matthew Hennessy,et al.
Algebraic theory of processes
,
1988,
MIT Press series in the foundations of computing.
[7]
Davide Sangiorgi,et al.
On the origins of bisimulation and coinduction
,
2009,
TOPL.
[8]
Robin Milner,et al.
Algebraic laws for nondeterminism and concurrency
,
1985,
JACM.
[9]
J. C. M. Baeten,et al.
Process Algebra: Bibliography
,
1990
.
[10]
Robin Milner,et al.
Communication and concurrency
,
1989,
PHI Series in computer science.
[11]
Rob J. van Glabbeek,et al.
The Linear Time - Branching Time Spectrum II
,
1993,
CONCUR.
[12]
Rocco De Nicola,et al.
Extensional equivalences for transition systems
,
1987,
Acta Informatica.