TY  - CHAP
SP  - 1624
Y1  - 2011///
T2  - Encyclopedia of Parallel Computing
A1  - De Nicola, Rocco
PB  - Springer
EP  - 1636
SN  - 978-0-387-09765-7
UR  - http://dx.doi.org/10.1007/978-0-387-09766-4_450
ED  - Padua, David
N2  - Process Algebras are mathematically rigorous languages with well defined semantics that permit describing and verifying properties of concurrent communicating systems.
They can be seen as models of processes, regarded as agents that act and interact continuously with other similar agents and with their common environment. The agents may be real-world objects (even people), or they may be artifacts, embodied perhaps in computer hardware or software systems.
Many different approaches (operational, denotational, algebraic) are taken for describing the meaning of processes. However, the operational approach is the reference one. By relying on the so called Structural Operational Semantics (SOS), labelled transition systems are built and composed by using the different operators of the many different process algebras. Behavioral equivalences are used to abstract from unwanted details and identify those systems that react similarly to external
experiments.
AV  - public
TI  - Process Algebras
ID  - eprints1072
ER  -