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)
- 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
- 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
- Game-based local model checking for the coalgebraic \(\mu\)-calculus
- 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
- 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
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)
