Opening book details…
Can I read Relating Conflict-free Stable Transition and Event Models via Redex Families on EtoBox?
Relating Conflict-free Stable Transition and Event Models via Redex Families by Zurab Khasidashvili; John Glauert is a Computer Science article available to read on EtoBox.
What is Relating Conflict-free Stable Transition and Event Models via Redex Families about?
We describe an event-style (or poset) semantics for con ict-free rewrite systems, including term and graph rewriting (possibly with bound variables), 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 in two di erent but equivalent ways: by axiomatizing permutation-equivalence on ÿnite conÿgurations, and by axiomatizing the erasure of events, for the con ict-free case, and show that these extended models are equivalent to stable transition models with axiomatized residual and family relations. We then construct ÿnitary prime algebraic domains from the set of conÿgurations in these extended models by deÿning orderings relative to stable sets of 'results'. All useful sets of results for which the normalization (by neededness) theorem can be proved are stable.
Who reads Relating Conflict-free Stable Transition and Event Models via Redex Families?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Zurab Khasidashvili; John Glauert
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)
- Published
- 2002
- Language
- EN
- Field
- Computer Science (Physical Sciences)