Mukund, Madhavan ; Nielsen, Mogens (2005) CCS, locations and asynchronous transition systems In: 12th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 18-20 Dec 1992, New Delhi, India.
Full text not available from this repository.
Official URL: https://link.springer.com/chapter/10.1007%2F3-540-...
Related URL: http://dx.doi.org/10.1007/3-540-56287-7_116
Abstract
We provide a simple non-interleaved operational semantics for CCS in terms of asynchronous transition systems. We identify the concurrency present in the system in a natural way, in terms of events occurring at independent locations in the system. We extend the standard interleaving transition system for CCS by introducing labels on the transitions with information about the locations of events. We then show that the resulting transition system is an asynchronous transition system which has the additional property of being elementary, which means that it can also be represented by a 1-safe net. We also introduce a notion of bisimulation on asynchronous transition systems which preserves independence. We conjecture that the induced equivalence on CCS processes coincides with the notion of location equivalence proposed by Boudol et al.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| Keywords: | Transition System; Operational Semantic; Process Expression; Independence Relation; Process Term |
| ID Code: | 114255 |
| Deposited On: | 25 May 2018 04:53 |
| Last Modified: | 25 May 2018 04:53 |
Repository Staff Only: item control page
