Introduction to coalgebra. Towards mathematics of states and observation
DOI10.1017/CBO9781316823187zbMATH Open1364.68001OpenAlexW4232277105MaRDI QIDQ2828459FDOQ2828459
Authors: Bart Jacobs 
Publication date: 26 October 2016
Published in: Cambridge Tracts in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/cbo9781316823187
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modal logic (including the logic of norms) (03B45) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20) Categorical semantics of formal languages (18C50) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (47)
- Title not available (Why is that?)
- Coalgebraic semantics for nominal automata
- Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic
- Extended Static Checking by Calculation Using the Pointfree Transform
- Coalgebraic quantum computation
- Up-to techniques for branching bisimilarity
- Title not available (Why is that?)
- Differential 2-rigs
- Open Dynamical Systems as Coalgebras for Polynomial Functors, with Application to Predictive Processing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Many-valued coalgebraic modal logic: one-step completeness and finite model property
- The Vietoris functor and modal operators on rings of continuous functions
- Weighted and branching bisimilarities from generalized open maps
- Coinduction in Flow: The Later Modality in Fibrations
- The Lattice-Theoretic Essence of Property Directed Reachability Analysis
- Learners' languages
- Categories for dynamic epistemic logic
- Probabilistic logics based on Riesz spaces
- Algebraic-coalgebraic recursion theory of history-dependent dynamical system models
- Title not available (Why is that?)
- Lax Liftings and Lax Distributive Laws
- Congruences for stochastic automata
- Minimality Notions via Factorization Systems and Examples
- Categorical Büchi and parity conditions via alternating fixed points of functors
- Logical predicates in higher-order mathematical operational semantics
- Hybrid automata as coalgebras
- Distributive laws for monotone specifications
- Distributive laws for monotone specifications
- Title not available (Why is that?)
- Remarks on hyperspaces for Priestley spaces
- (In)finite trace equivalence of probabilistic transition systems
- Preservation and reflection of bisimilarity via invertible steps
- Monoidal streams for dataflow programming
- On star expressions and completeness theorems
- Convexity and order in probabilistic call-by-name FPC
- Title not available (Why is that?)
- Efficient Coalgebraic Partition Refinement
- Distribution bisimilarity via the power of convex algebras
- Algebraic-coalgebraic recursion theory of history-dependent dynamical system models
- Coalgebra and abstraction
- Rough and Near: Modal History of Two Theories
- Abstract categorical logic
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Bialgebraic methods and modal logic in structural operational semantics
- New Bisimulation Semantics for Distributed Systems
- Efficient and modular coalgebraic partition refinement
This page was built for publication: Introduction to coalgebra. Towards mathematics of states and observation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828459)
