Universal coalgebra: A theory of systems
From MaRDI portal
Publication:1583483
DOI10.1016/S0304-3975(00)00056-6zbMATH Open0951.68038OpenAlexW2088189323MaRDI QIDQ1583483FDOQ1583483
Authors: Jan J. M. M. Rutten 
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00056-6
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Cites Work
- Structured operational semantics and bisimulation as a congruence
- Structural induction and coinduction in a fibrational setting
- Bisimulation from open maps
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- A final coalgebra theorem
- A calculus of communicating systems
- Coalgebraic logic
- A general Galois theory for cofunctions and corelations
- Relational properties of domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A domain equation for bisimulation
- Formal verification of parallel programs
- Reactive, generative, and stratified models of probabilistic processes
- Terminal coalgebras in well-founded set theory
- Title not available (Why is that?)
- An approach to object semantics based on terminal co-algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving reflexive domain equations in a category of complete metric spaces
- A small final coalgebra theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coalgebraic methods in computer science, CMCS '98. Proceedings of the 1st workshop, Lisbon, Portugal, March 28--29, 1998
- Title not available (Why is that?)
- On the Foundations of Corecursion
- Machines in a category
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A co-induction principle for recursively defined domains
- Algebraic specification of data types: A synthetic approach
- Processes and hyperuniverses
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- Title not available (Why is that?)
- A coinduction principle for recursive data types based on bisimulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Co-induction in relational semantics
- Mechanizing coinduction and corecursion in higher-order logic
- Parametrized data types do not need highly constrained parameters
- Terminal metric spaces of finitely branching and image finite linear processes
- Final universes of processes
- Universal coalgebra and categories of transition systems
- Processes as terms: non-well-founded models for bisimulation
- Mongruences and cofree coalgebras
- Title not available (Why is that?)
- Final semantics for a higher order concurrent language
- Covarieties and complete covarieties
Cited In (only showing first 100 items - show all)
- A Calculus of Terms for Coalgebras of Polynomial Functors
- A coinductive calculus of binary trees
- A modal proof theory for final polynomial coalgebras
- Final coalgebras in accessible categories
- Equational coalgebraic logic
- On the computational complexity of bisimulation, redux
- Generic infinite traces and path-based coalgebraic temporal logics
- Structural operational semantics and modal logic, revisited
- Equational axiomatizability for coalgebra
- Pointwise extensions of GSOS-defined operations
- A simplification functor for coalgebras
- Behavioural equivalences for timed systems
- A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum
- A formal abstract framework for modelling and testing complex software systems
- Equational and implicational classes of coalgebras
- A compositional treatment of iterated open games
- From generic partition refinement to weighted tree automata minimization
- Coalgebraic representations of distributive lattices with operators
- More existence theorems for recursion categories.
- Elements of stream calculus (an extensive exercise in coinduction)
- Refinement patterns for ASTDs
- Dualising initial algebras
- A calculus for generic, QoS-aware component composition
- Solving Algebraic Equations Using Coalgebra
- Separation of clones of cooperations by cohyperidentities
- A coalgebraic semantics of subtyping
- Weak homomorphisms of coalgebras beyond \(\mathsf{Set}\)
- Algebraic-coalgebraic recursion theory of history-dependent dynamical system models
- A coalgebraic semantics for causality in Petri nets
- The graph conception of set
- μ-Bicomplete Categories and Parity Games
- Coequational logic for accessible functors
- Complete sets of cooperations
- Proving language inclusion and equivalence by coinduction
- Object oriented institutions to specify symbolic computation systems
- An institution of modal logics for coalgebras
- (Co)algebraic characterizations of signal flow graphs
- A coalgebraic approach to the semantics of the ambient calculus
- On minimal coalgebras
- Stochastic coalgebraic logic: bisimilarity and behavioral equivalence
- The Microcosm Principle and Concurrency in Coalgebra
- A coalgebraic theory of reactive systems
- Algebraic-coalgebraic specification in CoCASL
- Coalgebraic monads
- GSOS for probabilistic transition systems (extended abstract)
- Greatest bisimulations for binary methods
- A coalgebraic presentation of structured transition systems
- What is the coalgebraic analogue of Birkhoff's variety theorem?
- Revisiting causality, coalgebraically
- Title not available (Why is that?)
- Generating the algebraic theory of $C(X)$: the case of partially ordered compact spaces
- The continuum as a final coalgebra
- Continuous normalization for the lambda-calculus and Gödel's T
- Introduction to coalgebra. Towards mathematics of states and observation
- CIA structures and the semantics of recursion
- Efficient Coalgebraic Partition Refinement
- Coalgebraic symbolic semantics
- Fixed Points of Functors - A Short Abstract
- New Bisimulation Semantics for Distributed Systems
- Coalgebra morphisms subsume open maps
- CSP, partial automata, and coalgebras.
- On institutions for modular coalgebraic specifications.
- A coinductive completeness proof for the equivalence of recursive types
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- Final coalgebras and a solution theorem for arbitrary endofunctors
- Observational ultraproducts of polynomial coalgebras.
- Bisimulation on Markov processes over arbitrary measurable spaces
- Interpreted systems and Kripke models for multiagent systems from a categorical perspective
- Tree-functors, determinacy and bisimulations
- Coalgebraic minimization of automata by initiality and finality
- Title not available (Why is that?)
- Equivalence co-relatios and co-congruences of co-algebras
- Probabilistic mediator: a coalgebraic perspective
- Title not available (Why is that?)
- Extensional quotient coalgebras
- Smooth coalgebra: testing vector analysis
- Choice structures in games
- The converse of a stochastic relation
- Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
- Bisimulation maps in presheaf categories
- Duality for some categories of coalgebras.
- A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
- Semantic Foundations for Deterministic Dataflow and Stream Processing
- Title not available (Why is that?)
- Recursive coalgebras from comonads
- Languages and models for hybrid automata: a coalgebraic perspective
- Hybrid automata as coalgebras
- On induction principles for partial orders
- Comprehension for coalgebras
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- Coalgebraic logics \& duality
- Long-term values in Markov decision processes, (co)algebraically
- Undecidability of equality for codata types
- Coalgebras as types determined by their elimination rules
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- Finite behaviours and finitary corecursion
- Proper functors and fixed points for finite behaviour
- (In)finite trace equivalence of probabilistic transition systems
This page was built for publication: Universal coalgebra: A theory of systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583483)
