Relating conflict-free stable transition and event models via redex families

DOI10.1016/S0304-3975(01)00235-3zbMath1016.68052OpenAlexW2062390531MaRDI QIDQ1608893

Zurab Khasidashvili, John Glauert

Publication date: 13 August 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00235-3

zbMATH Keywords

event structuresdistributive domainsabstract reduction systemsredex families

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Unnamed Item ⋮ Proof Pearl: Abella Formalization of λ-Calculus Cube Property ⋮ The conflict-free reduction geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Concurrent transition systems
• Petri nets, event structures and domains. I
• Parallel beta reduction is not elementary recursive
• Discrete Normalization and Standardization in Deterministic Residual Structures
• Minimal and Optimal Computations of Recursive Programs
• Stable results and relative normalization
• Axiomatizing permutation equivalence
• Relating two categorical models of term rewriting
• On relating rewriting systems and graph grammars to event structures
• An Abstract form of the church-rosser theorem. I
• Relative normalization in Deterministic Residual Structures

This page was built for publication: Relating conflict-free stable transition and event models via redex families