Relating conflict-free stable transition and event models via redex families
From MaRDI portal
Publication:1608893
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
Cites work
- scientific article; zbMATH DE number 4074504 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 627411 (Why is no real title available?)
- scientific article; zbMATH DE number 1086711 (Why is no real title available?)
- scientific article; zbMATH DE number 1361485 (Why is no real title available?)
- scientific article; zbMATH DE number 4119660 (Why is no real title available?)
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- scientific article; zbMATH DE number 969069 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- An Abstract form of the church-rosser theorem. I
- An abstract concept of optimal implementation
- Axiomatizing permutation equivalence
- Concurrent transition systems
- Discrete normalization and standardization in deterministic residual structures
- Minimal and Optimal Computations of Recursive Programs
- On relating rewriting systems and graph grammars to event structures
- Parallel beta reduction is not elementary recursive
- Petri nets, event structures and domains. I
- Relating two categorical models of term rewriting
- Relative normalization in Deterministic Residual Structures
- Stable results and relative normalization
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The optimal implementation of functional programming languages
Cited in
(3)
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)