Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies

DOI10.1016/j.entcs.2018.11.003OpenAlexW2904770693WikidataQ113317497 ScholiaQ113317497MaRDI QIDQ2134814

Nathan Bowler, Gordon D. Plotkin, Paul Blain Levy

Publication date: 3 May 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2018.11.003

zbMATH Keywords

tracesemilatticesfinal coalgebraalgebraic effectsnondeterministic strategies

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Unnamed Item ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Steps and traces
• Exploring probabilistic bisimulations. I
• Trace semantics via determinization
• Infinite trace equivalence
• Combining effects: sum and tensor
• Environmental bisimulations for probabilistic higher-order languages
• Well-Pointed Coalgebras
• Exploring the Boundaries of Monad Tensorability on Set
• Coalgebraic Trace Semantics via Forgetful Logics
• Probabilistic Bisimulation: Naturally on Distributions
• Concurrency and Composition in a Stochastic World
• Unbounded Non-determinism in CSP
• Quantales, observational logic and process semantics
• Transition systems over games
• Generic Trace Semantics via Coinduction
• Algebra valued functors in general and tensor products in particular
• Realization of Coinductive Types

This page was built for publication: Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies