Algebra and Coalgebra in Computer Science
From MaRDI portal
Publication:5492834
DOI10.1007/11548133zbMath1151.68558OpenAlexW249899439MaRDI QIDQ5492834
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11548133
Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30) Theories (e.g., algebraic theories), structure, and semantics (18C10)
Related Items (12)
Relating Coalgebraic Notions of Bisimulation ⋮ A finite model construction for coalgebraic modal logic ⋮ A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ Choice structures in games ⋮ Maximal traces and path-based coalgebraic temporal logics ⋮ Universal type structures with unawareness ⋮ Unnamed Item ⋮ Coalgebraic Logic over Measurable Spaces: Behavioral and Logical Equivalence ⋮ Stochastic coalgebraic logic: bisimilarity and behavioral equivalence ⋮ Bisimulation on Markov Processes over Arbitrary Measurable Spaces ⋮ Final coalgebras for functors on measurable spaces ⋮ Structural operational semantics for continuous state stochastic transition systems
This page was built for publication: Algebra and Coalgebra in Computer Science
