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
- 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
- Title not available (Why is that?)
- 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
- 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 Modal Logic Beyond Sets
- 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
- A Formalized Hierarchy of Probabilistic System Types
- Coinduction for exact real number computation
- A coinductive calculus for asynchronous side-effecting processes
- Modalities in the Stone age: a comparison of coalgebraic logics
- Coalgebraic Semantic Model for the Clock Constraint Specification Language
- 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
- On tree coalgebras and coalgebra presentations
- A coalgebraic approach to Kleene algebra with tests
- Simulations in coalgebra
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)
