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)
- 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
- Institutionalising many-sorted coalgebraic modal logic
- A new foundation for finitary corecursion and iterative algebras
- A description based on languages of the final non-deterministic automaton
- Covarieties and complete covarieties
- Categorically algebraic topology versus universal topology
- Hausdorff coalgebras
- Mongruences and cofree coalgebras
- Title not available (Why is that?)
- Limits in categories of Vietoris coalgebras
- Duality of equations and coequations via contravariant adjunctions
- Coalgebraic trace semantics via forgetful logics
- Using coalgebras and the Giry monad for interpreting game logics -- a tutorial
- On final coalgebras of power-set functors and saturated trees
- Coinductive predicates and final sequences in a fibration
- Linearization of automatic arrays and weave specifications
- Rational operational models
- Varieties and covarieties of languages (extended abstract)
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Some co-Birkhoff type theorems
- Lattice properties of congruences for stochastic relations
- Approximating Markov processes through filtration
- Initial algebras and terminal coalgebras in many-sorted sets
- A presheaf environment for the explicit fusion calculus
- From algebras and coalgebras to dialgebras
- Coalgebras for fuzzy transition systems
- Unprovability of the logical characterization of bisimulation
- On the final sequence of a finitary set functor
- Bialgebraic methods in structural operational semantics (invited talk)
- Bialgebras for structural operational semantics: an introduction
- Maximal traces and path-based coalgebraic temporal logics
- Recursively defined metric spaces without contraction
- A finite model construction for coalgebraic modal logic
- Coinduction for exact real number computation
- A coinductive calculus for asynchronous side-effecting processes
- Modalities in the Stone age: a comparison of coalgebraic logics
- Expressive logics for coalgebras via terminal sequence induction
- An approach to object semantics based on terminal co-algebras
- Coalgebras for binary methods: Properties of bisimulations and invariants
- Stone coalgebras
- Parametric corecursion
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Relation lifting, a survey
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- A coalgebraic perspective on linear weighted automata
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
- A coalgebraic perspective on logical interpretations
- Coalgebraic semantics of modal logics: an overview
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- Coalgebraic modal logic beyond sets
- On tree coalgebras and coalgebra presentations
- A coalgebraic approach to Kleene algebra with tests
- Simulations in coalgebra
- Coalgebraic logic
- Factorization systems and fibrations: toward a fibred Birkhoff variety theorem
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)
