Traces, Executions and Schedulers, Coalgebraically
From MaRDI portal
Publication:2888488
DOI10.1007/978-3-642-03741-2_15zbMATH Open1239.68052OpenAlexW1901730722MaRDI QIDQ2888488FDOQ2888488
Authors: Bart Jacobs, Ana Sokolova 
Publication date: 1 June 2012
Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2066/75653
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
Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Trace semantics for coalgebras
- Generic Trace Semantics via Coinduction
- Generic Forward and Backward Simulations
- Introduction to extensive and distributive categories
- Distributing probability over non-determinism
- CONCUR 2005 – Concurrency Theory
- Making Random Choices Invisible to the Scheduler
- The Microcosm Principle and Concurrency in Coalgebra
- Algebra and Coalgebra in Computer Science
- Title not available (Why is that?)
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)
