Paper Info
Title
Relating Conflict-Free Stable Transition and Event Models (Extended Abstract)
Abstract
We describe an event-style (or poset) semantics for conflict-free rewrite systems, such as the -calculus, and other stable transition systems with a residual relation. Our interpretation is based on considering redex families as events. It treats permutation-equivalent reductions as representing the same concurrent computation. Due to erasure of redexes, Event Structures are inadequate for such an interpretation. We therefore extend the Prime Event Structure model by axiomatizing permutation-equivalence on finite configurations in two different ways, for the conflict-free case, and show that these extended models are equivalent to known stable transition models with axiomatized residual and family relations.
Year
DOI
Venue
1997
10.1007/BFb0029970
MFCS
Keywords
Field
DocType
extended abstract,relating conflict-free stable transition,event models
Prime (order theory),Discrete mathematics,Residual,Lambda calculus,Computer science,Rewriting,Event structure,Semantics,Partially ordered set,Erasure
Conference
ISBN
Citations 
PageRank 
3-540-63437-1
3
0.38
References 
Authors
16
2
Name
Order
Citations
PageRank
Zurab Khasidashvili130725.40
John R. W. Glauert214512.14