Universal coalgebra: A theory of systems

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

• scientific article; zbMATH DE number 1064116
• scientific article; zbMATH DE number 2172972
• scientific article
• Generalised coinduction
• State-based systems and \((F_1,F_2)\)-coalgebras

zbMATH Keywords

universal coalgebra

Mathematics Subject Classification ID

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)

• On \(\mathbf{MV} \)-coalgebras over the category of BL-algebras
• Final semantics for decorated traces
• Coalgebraic semantics for nominal automata
• Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic
• Saturated Kripke structures as Vietoris coalgebras
• Stick breaking, in coalgebra and probability
• Expressiveness of component-based frameworks: a study of the expressiveness of BIP
• Invariants of monadic coalgebras
• Bisimulation and coinduction enhancements: a historical perspective
• A calculus of concurrent graph-rewriting processes
• Title not available (Why is that?)
• Context-free coalgebras
• Up-to techniques for behavioural metrics via fibrations
• Up-to techniques for branching bisimilarity
• Title not available (Why is that?)
• Title not available (Why is that?)
• A quantified coalgebraic van Benthem theorem
• Distributivity of categories of coalgebras
• The Burnside algebra of a quasigroup.
• Realization of coinductive types
• A (co)algebraic theory of succinct automata
• (Metric) bisimulation games and real-valued modal logics for coalgebras
• From global to local state, coalgebraically and compositionally
• Free-lattice functors weakly preserve epi-pullbacks
• Hennessy-Milner and van Benthem for instantial neighbourhood logic
• Accessible set functors are universal
• Generalised coinduction
• Monotone subintuitionistic logic: duality and transfer results
• A parameterization process: from a functorial point of view
• Problems of constructing intelligent systems. Intelligent modeling
• A proof of Moessner's theorem by coinduction
• Isomorphism theorems for coalgebras
• Non-well-founded deduction for induction and coinduction
• Distributive laws for monotone specifications
• Distributive laws for monotone specifications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integrating induction and coinduction via closure operators and proof cycles
• Coinductive predicates and final sequences in a fibration
• Title not available (Why is that?)
• Practical coinduction
• A single complete relational rule for coalgebraic refinement
• Extending set functors to generalised metric spaces
• A semantic model for interacting cyber-physical systems
• Title not available (Why is that?)
• Stream differential equations: specification formats and solution methods
• On the complexity of stream equality
• Coinduction in concurrent timed systems
• Pre-Galois connection on coalgebras for generic component refinement
• Coalgebra and abstraction
• Nominal automata with name binding
• Efficient and modular coalgebraic partition refinement
• Formal Methods in Software and Systems Modeling
• 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
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• On coalgebra of real numbers
• How to reason coinductively informally
• Weak completeness of coalgebraic dynamic logics
• A complete logic for behavioural equivalence in coalgebras of finitary set functors

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)