Traces, Executions and Schedulers, Coalgebraically

DOI10.1007/978-3-642-03741-2_15zbMath1239.68052OpenAlexW1901730722MaRDI QIDQ2888488

Ana Sokolova, Bart Jacobs

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

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics ⋮ Maximal traces and path-based coalgebraic temporal logics

Cites Work

• Introduction to extensive and distributive categories
• Making Random Choices Invisible to the Scheduler
• Generic Trace Semantics via Coinduction
• The Microcosm Principle and Concurrency in Coalgebra
• Distributing probability over non-determinism
• Algebra and Coalgebra in Computer Science
• Generic Forward and Backward Simulations
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item