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 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
- Transposing partial components--an exercise on coalgebraic refinement
- Data types with symmetries and polynomial functors over groupoids
- Title not available (Why is that?)
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Copower functors
- Relatively terminal coalgebras
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- On coalgebra based on classes
- Diagrammatic logic applied to a parameterisation process
- Notions of bisimulation and congruence formats for SOS with data
- Approximating and computing behavioural distances in probabilistic transition systems
- Bisimulation for labelled Markov processes
- Structural congruence for bialgebraic semantics
- Quasipolynomial computation of nested fixpoints
- An introduction to (co)algebra and (co)induction
- About permutation algebras, (pre)sheaves and named sets
- A hidden agenda
- Swinging types=functions+relations+transition systems
- On rational monads and free iterative theories
- Weighted automata as coalgebras in categories of matrices
- Semantics of higher-order quantum computation via geometry of interaction
- Final coalgebras and the Hennessy-Milner property
- A logic of implications in algebra and coalgebra
- Modular construction of complete coalgebraic logics
- Expressivity of coalgebraic modal logic: the limits and beyond
- Structural Operational Semantics for Weighted Transition Systems
- A decision procedure for (co)datatypes in SMT solvers
- A decision procedure for (co)datatypes in SMT solvers
- Coalgebras, Chu spaces, and representations of physical systems
- Big toy models. Representing physical systems as Chu spaces
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Terminal Sequence Induction via Games
- Lax extensions of coalgebra functors and their logic
- Applications of algebra and coalgebra in scientific modelling: illustrated with the logistic map
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
- Traces for coalgebraic components
- Compositional SOS and beyond: A coalgebraic view of open systems
- A tutorial on coinductive stream calculus and signal flow graphs
- Coalgebraic semantic model for the clock constraint specification language
- Components as coalgebras: the refinement dimension
- A formalized hierarchy of probabilistic system types. Proof pearl
- Bisimulation indexes and their applications
- A behavioural pseudometric for probabilistic transition systems
- 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?)
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)
