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

DOI10.1016/S0304-3975(01)00235-3zbMATH Open1016.68052OpenAlexW2062390531MaRDI QIDQ1608893FDOQ1608893

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1361485
• Transition systems from event structures revisited
• From event-oriented models to transition systems
• Configuration- and residual-based transition systems for event structures with asymmetric conflict
• scientific article; zbMATH DE number 2088670
• Transition systems, event structures, and unfoldings
• Consistent reduction in discrete-event systems
• Refinement, decomposition, and instantiation of discrete models: application to Event-B
• An event structure model for probabilistic concurrent Kleene algebra
• Transitively reduced and transitively closed event networks

zbMATH Keywords

distributive domainsevent structuresabstract reduction systemsredex families

Mathematics Subject Classification ID

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

Cites Work

• Petri nets, event structures and domains. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal and Optimal Computations of Recursive Programs
• The optimal implementation of functional programming languages
• Parallel beta reduction is not elementary recursive
• Concurrent transition systems
• An Abstract form of the church-rosser theorem. I
• Discrete normalization and standardization in deterministic residual structures
• Relating two categorical models of term rewriting
• Title not available (Why is that?)
• An abstract concept of optimal implementation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stable results and relative normalization
• Title not available (Why is that?)
• Axiomatizing permutation equivalence
• On relating rewriting systems and graph grammars to event structures
• Relative normalization in Deterministic Residual Structures

Cited In (3)

• The conflict-free reduction geometry
• Title not available (Why is that?)
• Proof pearl: Abella formalization of \(\lambda \)-calculus cube property

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608893)