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; zbMATH DE number 2186713
• 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)

• A coinductive calculus for asynchronous side-effecting processes
• Proof systems for Moss' coalgebraic logic
• Recursive coalgebras of finitary functors
• Network-conscious \(\pi\)-calculus -- a model of Pastry
• Quantitative Kleene coalgebras
• G-reactive systems as coalgebras
• Coalgebraising subsequential transducers
• Coequational logic for finitary functors
• Observational coalgebras and complete sets of co-operations
• Monoid-labeled transition systems
• On the structure of categories of coalgebras
• Relational properties of sequential composition of coalgebras
• A bialgebraic approach to automata and formal language theory
• Universality of categories of coalgebras
• Control of discrete-event systems with partial observations using coalgebra and coinduction
• Channel-based coordination via constraint satisfaction
• Synthesis of Reo circuits from scenario-based interaction specifications
• On universal categories of coalgebras
• A Category of Explicit Fusions
• Coalgebraic Models for Reactive Systems
• Information hiding in probabilistic concurrent systems
• Completeness for flat modal fixpoint logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• A hierarchy of probabilistic system types
• System theory for system identification.
• Finitary coalgebraic multisemilattices and multilattices.
• Bisimulation relations for dynamical and control systems
• Kleisli morphisms and randomized congruences for the Giry monad
• A Decision Procedure for Bisimilarity of Generalized Regular Expressions
• From modal logic to terminal coalgebras
• Specifying coalgebras with modal logic
• Complementation of coalgebra automata
• Confluence of the coinductive \(\lambda\)-calculus
• Structural operational semantics for continuous state stochastic transition systems
• Coalgebraic logic over general measurable spaces -- a survey
• A network-conscious \(\pi\)-calculus and its coalgebraic semantics
• Axiomatizing GSOS with termination
• Binary trees as a computational framework
• The intersection of algebra and coalgebra
• Services and Contracts: Coalgebraically
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• Bisimulation relations for dynamical, control, and hybrid systems
• Symmetries, local names and dynamic (de)-allocation of names
• Subsequential transducers: a coalgebraic perspective
• Semantic constructions for the specification of objects
• A categorical approach to syntactic monoids
• Control of discrete-event systems with modular or distributed structure
• Deriving Syntax and Axioms for Quantitative Regular Behaviours
• Coalgebraic logic for stochastic right coalgebras
• A stochastic interpretation of propositional dynamic logic: expressivity
• Completeness and the finite model property for Kleene algebra, reconsidered
• Characterising behavioural equivalence: Three sides of one coin
• A Kleene Theorem for Polynomial Coalgebras
• Towards weak bisimulation for coalgebras
• Recursion and corecursion have the same equational logic
• A perspective on service orchestration
• Many-sorted coalgebraic modal logic: A model-theoretic study
• A coalgebraic equational approach to specifying observational structures
• A Bialgebraic Approach to Automata and Formal Language Theory
• The dual equivalence of equations and coequations for automata
• Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
• The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator
• A compositional coalgebraic model of a fragment of fusion calculus
• Generalised coinduction
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Structural operational semantics for stochastic and weighted transition systems
• A coalgebraic approach to non-determinism: applications to multilattices
• Dynamical systems in categories
• Fibrational bisimulations and quantitative reasoning
• Behavioural equivalences for coalgebras with unobservable moves
• Enhanced coalgebraic bisimulation
• Bialgebraic methods and modal logic in structural operational semantics
• A general account of coinduction up-to
• 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

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)