Traces, Executions and Schedulers, Coalgebraically
From MaRDI portal
Publication:2888488
Recommendations
- scientific article; zbMATH DE number 1836352
- Traces for coalgebraic components
- A coalgebraic approach to process equivalence and a coinduction principle for traces
- Coalgebraic infinite traces and Kleisli simulations
- Coalgebraic Infinite Traces and Kleisli Simulations
- Trace semantics for coalgebras
- Coalgebraic trace semantics for continuous probabilistic transition systems
- Coalgebraic semantics for timed processes
- Abstract interpretation of trace semantics for concurrent calculi
- A formal, resource consumption-preserving translation from actors with cooperative scheduling to Haskell
Cites work
- scientific article; zbMATH DE number 2061699 (Why is no real title available?)
- Algebra and Coalgebra in Computer Science
- CONCUR 2005 – Concurrency Theory
- Distributing probability over non-determinism
- Generic Forward and Backward Simulations
- Generic Trace Semantics via Coinduction
- Introduction to extensive and distributive categories
- Making Random Choices Invisible to the Scheduler
- The Microcosm Principle and Concurrency in Coalgebra
- Trace semantics for coalgebras
Cited in
(3)
This page was built for publication: Traces, Executions and Schedulers, Coalgebraically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888488)