Degano, Pierpaolo and De Nicola, Rocco and Montanari, Ugo A Partial Ordering Semantics for CCS. Theoretical Computer Science, 75 (3). pp. 223-262. ISSN 0304-3975 (1990)
Full text not available from this repository.Abstract
A new operational semantics for “pure” CCS is proposed that considers the parallel operator as a first class one, and permits a description of the calculus in terms of partial orderings. The new semantics (also for unguarded agents) is given in the SOS style via the partial ordering derivation relation. CCS agents are decomposed into sets of sequential subagents. The new derivations relate sets of subagents, and describe their actions and the casual dependencies among them. The computations obtained by composing partial ordering derivations are “observed” either as interleaving or partial orderings of events. Interleavings coincide with Milner's many step derivations, and “linearizations” of partial orderings are all and only interleavings. Abstract semantics are obtained by introducing two relations of observational equivalence and congruence that preserve concurrency. These relations are finer than Milner's in that they distinguish interleaving of sequential nondeterministic agents from their concurrent execution.
| Item Type: | Article |
|---|---|
| Identification Number: | https://doi.org/10.1016/0304-3975(90)90095-Y |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Rocco De Nicola |
| Date Deposited: | 10 Jun 2011 14:15 |
| Last Modified: | 11 Jul 2011 14:36 |
| URI: | http://eprints.imtlucca.it/id/eprint/380 |
Actions (login required)
 |
Edit Item |
