De Nicola, Rocco Process Algebras. In: Encyclopedia of Parallel Computing. Springer, pp. 1624-1636. ISBN 978-0-387-09765-7 (2011)
|
PDF
- Accepted Version
Download (134kB) | Preview |
Abstract
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.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1007/978-0-387-09766-4_450 |
| Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 20 Jan 2012 08:52 |
| Last Modified: | 20 Jan 2012 09:28 |
| URI: | http://eprints.imtlucca.it/id/eprint/1072 |
Actions (login required)
 |
Edit Item |
