Degano, Pierpaolo and De Nicola, Rocco and Montanari, Ugo Partial ordering derivations for CCS. In: Fundamentals of Computation Theory (FCT 1985). Lecture Notes in Computer Science, 199 . Springer, pp. 520-533. ISBN 3-540-15689-5 (1985)
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/BFb0028836
Abstract
In this paper we extend CCS transitions, labelled by strings, to concurrent histories, i.e. to transitions labelled by partial orderings. The two notions are linked by a theorem which shows that the strings can be obtained by taking all interleavings compatible with the partial orderings.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1007/BFb0028836 |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Rocco De Nicola |
| Date Deposited: | 24 May 2011 14:02 |
| Last Modified: | 11 Jul 2011 14:36 |
| URI: | http://eprints.imtlucca.it/id/eprint/390 |
Actions (login required)
 |
Edit Item |
