A stable non-interleaving early operational semantics for the pi-calculus
We give the first non-interleaving early operational semantics for the pi-calculus which generalises the standard interleaving semantics and unfolds to the stable model of prime event structures. Our starting point is the non-interleaving semantics given for CCS by Mukund and Nielsen, where the so-c...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 104; pp. 227 - 253 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.04.2019
|
Subjects | |
Online Access | Get full text |
ISSN | 2352-2208 |
DOI | 10.1016/j.jlamp.2019.02.006 |
Cover
Loading…
Summary: | We give the first non-interleaving early operational semantics for the pi-calculus which generalises the standard interleaving semantics and unfolds to the stable model of prime event structures. Our starting point is the non-interleaving semantics given for CCS by Mukund and Nielsen, where the so-called structural (prefixing or subject) causality and events are defined from a notion of locations derived from the syntactic structure of the process terms. We conservatively extend this semantics with a notion of extruder histories, from which we infer the so-called link (name or object) causality and events introduced by the dynamic communication topology of the pi-calculus. We prove that the semantics generalises both the standard interleaving early semantics for the pi-calculus and the non-interleaving semantics for CCS. In particular, it gives rise to a labelled asynchronous transition system unfolding to prime event structures. |
---|---|
Bibliography: | NFR/248113 |
ISSN: | 2352-2208 |
DOI: | 10.1016/j.jlamp.2019.02.006 |