Universal coalgebra: A theory of systems

From MaRDI portal

Publication:1583483

Jump to:navigation, search

DOI10.1016/S0304-3975(00)00056-6zbMath0951.68038OpenAlexW2088189323MaRDI QIDQ1583483

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

zbMATH Keywords

universal coalgebra

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items

Coalgebras for Bisimulation of Weighted Automata over Semirings, Soundness Conditions for Big-Step Semantics, Semantic Foundations for Deterministic Dataflow and Stream Processing, Minimality Notions via Factorization Systems and Examples, The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games, The costructure–cosemantics adjunction for comodels for computational effects, Bisimulation as a logical relation, Coalgebraic Geometric Logic: Basic Theory, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, Unnamed Item, AUTOMATA AND TREE AUTOMATA AS (F₁, F₂)-COALGEBRAS, Abstract categorical logic, Kantorovich functors and characteristic logics for behavioural distances, Weighted and branching bisimilarities from generalized open maps, Preservation and reflection of bisimilarity via invertible steps, On difunctions, COUNTING TO INFINITY: GRADED MODAL LOGIC WITH AN INFINITY DIAMOND, Choice structures in games, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Completeness and the finite model property for Kleene algebra, reconsidered, Smooth coalgebra: testing vector analysis, Enhanced coalgebraic bisimulation, Practical coinduction, Morpho-logic from a topos perspective -- application to symbolic AI, Up-to techniques for behavioural metrics via fibrations, Unnamed Item, Coinduction in Flow: The Later Modality in Fibrations, WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES, Computing with continuous objects: a uniform co-inductive approach, Algebra-coalgebra duality in brzozowski's minimization algorithm, Initial Algebras of Terms with Binding and Algebraic Structure, Services and Contracts: Coalgebraically, Bisimulation on Markov Processes over Arbitrary Measurable Spaces, (Co)Algebraic Characterizations of Signal Flow Graphs, A Final Coalgebra for k-regular Sequences, Realization of Coinductive Types, Fixed Points of Functors - A Short Abstract, Transitivity and Difunctionality of Bisimulations, Duality of Equations and Coequations via Contravariant Adjunctions, Product Rules and Distributive Laws, A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors, Bisimulation proof methods in a path-based specification language for polynomial coalgebras, Semantic constructions for the specification of objects, A coalgebraic presentation of structured transition systems, Equational and implicational classes of coalgebras, Covarieties and complete covarieties, On the structure of categories of coalgebras, Specifying coalgebras with modal logic, Parametric corecursion, From modal logic to terminal coalgebras, Equational axiomatizability for coalgebra, Bisimilarity is not Borel, Unnamed Item, Unnamed Item, Object oriented institutions to specify symbolic computation systems, Unnamed Item, Unnamed Item, Operators on classes of coalgebras, What is the coalgebraic analogue of Birkhoff's variety theorem?, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Accessible set functors are universal, A coalgebraic view on reachability, Efficient Coalgebraic Partition Refinement, Unnamed Item, Unnamed Item, Coalgebraic Modal Logic Beyond Sets, A Compositional Coalgebraic Model of a Fragment of Fusion Calculus, Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting, Discussion on: ``Supervisory control of discrete event systems with flexible marking, On coalgebra of real numbers, μ-Bicomplete Categories and Parity Games, Complementation of Coalgebra Automata, Characterising Behavioural Equivalence: Three Sides of One Coin, Weak Bisimilarity Coalgebraically, Coalgebraic Symbolic Semantics, Relating Coalgebraic Notions of Bisimulation, Data Intensive Distributed Computing in Data Aware Self-organizing Networks, Unnamed Item, A stochastic interpretation of propositional dynamic logic: expressivity, A Co-inductive Language and Truth Degrees, A Decision Procedure for (Co)datatypes in SMT Solvers, Coalgebraic Representation Theory of Fractals, Final Semantics for Decorated Traces, Data Types with Symmetries and Polynomial Functors over Groupoids, Hybrid Automata as Coalgebras, A PARAMETERIZATION PROCESS: FROM A FUNCTORIAL POINT OF VIEW, Unnamed Item, Coalgebraic Semantic Model for the Clock Constraint Specification Language, Causal Trees, Finally, Deriving Syntax and Axioms for Quantitative Regular Behaviours, A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum, Structural Operational Semantics for Weighted Transition Systems, Categorifying Computations into Components via Arrows as Profunctors, Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics, Applications of Algebra and Coalgebra in Scientific Modelling, Structural Operational Semantics and Modal Logic, Revisited, Coinduction in Concurrent Timed Systems, Newton series, coinductively: a comparative study of composition, Regular Varieties of Automata and Coequations, A Formalized Hierarchy of Probabilistic System Types, Equations and Coequations for Weighted Automata, The p-adic Integers as Final Coalgebra, Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions, Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis, A Category of Explicit Fusions, Recursive coalgebras of finitary functors, Unnamed Item, Unnamed Item, A coalgebraic view on decorated traces, Unnamed Item, Unnamed Item, Nonflatness and totality, Unnamed Item, Coalgebraic trace semantics via forgetful logics, Unnamed Item, Nominal Automata with Name Binding, Unnamed Item, Unnamed Item, A Single Complete Relational Rule for Coalgebraic Refinement, Up-to Techniques for Branching Bisimilarity, A Decision Procedure for Bisimilarity of Generalized Regular Expressions, How to Reason Coinductively Informally, Coalgebraic logic over general measurable spaces – a survey, Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra, Traces for coalgebraic components, Pointwise extensions of GSOS-defined operations, Initial algebras and terminal coalgebras in many-sorted sets, Some facets of Horn covarieties in a category, Up-To Techniques for Behavioural Metrics via Fibrations, (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras, Tree-functors, determinacy and bisimulations, From Grammars and Automata to Algebras and Coalgebras, Generalised powerlocales via relation lifting, Unnamed Item, Unnamed Item, Generalised Coinduction, A Calculus of Terms for Coalgebras of Polynomial Functors, Monoid-labeled transition systems, Modal Rules are Co-Implications, Invariants of monadic coalgebras, From Algebras and Coalgebras to Dialgebras, Elements of Stream Calculus, Generating the algebraic theory of $C(X)$: the case of partially ordered compact spaces, Diagrammatic logic applied to a parameterisation process, A Bialgebraic Approach to Automata and Formal Language Theory, New Bisimulation Semantics for Distributed Systems, A Kleene Theorem for Polynomial Coalgebras, Terminal Sequence Induction via Games, A Coinductive Calculus for Asynchronous Side-Effecting Processes, Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme, Final coalgebras in accessible categories, Extending set functors to generalised metric spaces, Coinductive predicates and final sequences in a fibration, On Rational Monads and Free Iterative Theories, Bisimulation Relations for Dynamical and Control Systems, Factorization systems and fibrations, Limits in categories of Vietoris coalgebras, Unnamed Item, G-Reactive Systems as Coalgebras, Bialgebraic Methods in Structural Operational Semantics, A Coalgebraic Theory of Reactive Systems, Co-Algebraic Models for Quantitative Spatial Logics, Unnamed Item, On Products of Transition Systems, Coalgebraising Subsequential Transducers, Observational Coalgebras and Complete Sets of Co-operations, Coequational Logic for Finitary Functors, Pre-Galois Connection on Coalgebras for Generic Component Refinement, On the complexity of stream equality, Varieties and covarieties of languages (extended abstract), Coinductive predicates and final sequences in a fibration, Rational operational models, Linearization of automatic arrays and weave specifications, Components as coalgebras: the refinement dimension, Coalgebras for fuzzy transition systems, ``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, Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets, About permutation algebras, (pre)sheaves and named sets, Transposing partial components--an exercise on coalgebraic refinement, Structural congruence for bialgebraic semantics, The intersection of algebra and coalgebra, A coalgebraic approach to the semantics of the ambient calculus, Semantics of higher-order quantum computation via geometry of interaction, Coalgebras, Chu spaces, and representations of physical systems, Coalgebraic representations of distributive lattices with operators, A coalgebraic perspective on logical interpretations, On universal categories of coalgebras, Big toy models. Representing physical systems as Chu spaces, Structural operational semantics for stochastic and weighted transition systems, A coinductive calculus for asynchronous side-effecting processes, A complete logic for behavioural equivalence in coalgebras of finitary set functors, Algebraic-coalgebraic recursion theory of history-dependent dynamical system models, Behavioural equivalences for coalgebras with unobservable moves, A coalgebraic semantics for causality in Petri nets, Symmetries, local names and dynamic (de)-allocation of names, Subsequential transducers: a coalgebraic perspective, Complete sets of cooperations, Coequational logic for accessible functors, Proof systems for Moss' coalgebraic logic, A coalgebraic approach to non-determinism: applications to multilattices, A bialgebraic approach to automata and formal language theory, Recursion and corecursion have the same equational logic, Universality of categories of coalgebras, Proving language inclusion and equivalence by coinduction, A coalgebraic perspective on linear weighted automata, Modalities in the Stone age: a comparison of coalgebraic logics, Lattice properties of congruences for stochastic relations, Observational ultraproducts of polynomial coalgebras., Completeness for flat modal fixpoint logics, Maximal traces and path-based coalgebraic temporal logics, Bialgebras for structural operational semantics: an introduction, Coalgebraic semantics of modal logics: an overview, Approximating Markov processes through filtration, Using coalgebras and the Giry monad for interpreting game logics -- a tutorial, System theory for system identification., Relatively terminal coalgebras, Binary trees as a computational framework, More existence theorems for recursion categories., On coalgebra based on classes, Constructive logical characterizations of bisimilarity for reactive probabilistic systems, Completeness for \(\mu\)-calculi: a coalgebraic approach, On minimal coalgebras, The dual equivalence of equations and coequations for automata, Stochastic coalgebraic logic: bisimilarity and behavioral equivalence, Coalgebraic minimization of automata by initiality and finality, Structural operational semantics for non-deterministic processes with quantitative aspects, Dynamical systems in categories, Extensional quotient coalgebras, A general account of coinduction up-to, Network-conscious \(\pi\)-calculus -- a model of Pastry, Quantitative Kleene coalgebras, A coinductive calculus of binary trees, Synthesis of Reo circuits from scenario-based interaction specifications, Channel-based coordination via constraint satisfaction, Information hiding in probabilistic concurrent systems, A hierarchy of probabilistic system types, A coalgebraic approach to Kleene algebra with tests, Simulations in coalgebra, Stone coalgebras, Unprovability of the logical characterization of bisimulation, On the computational complexity of bisimulation, redux, On the final sequence of a finitary set functor, Expressive logics for coalgebras via terminal sequence induction, A formal abstract framework for modelling and testing complex software systems, A compositional treatment of iterated open games, Kleisli morphisms and randomized congruences for the Giry monad, Refinement patterns for ASTDs, Copower functors, Weak homomorphisms of coalgebras beyond \(\mathsf{Set}\), The graph conception of set, Separation of clones of cooperations by cohyperidentities, Bialgebraic methods and modal logic in structural operational semantics, Coinduction for exact real number computation, Coalgebraic logic for stochastic right coalgebras, Swinging types=functions+relations+transition systems, A hidden agenda, Coalgebraic logic, A logic of implications in algebra and coalgebra, CSP, partial automata, and coalgebras., A coalgebraic equational approach to specifying observational structures, On institutions for modular coalgebraic specifications., The continuum as a final coalgebra, Coalgebra morphisms subsume open maps, Compositional SOS and beyond: A coalgebraic view of open systems, Bisimulation indexes and their applications, A coinductive completeness proof for the equivalence of recursive types, Control of discrete-event systems with partial observations using coalgebra and coinduction, A decision procedure for (co)datatypes in SMT solvers, Axiomatizing GSOS with termination, Interpreted systems and Kripke models for multiagent systems from a categorical perspective, An institution of modal logics for coalgebras, Algebraic-coalgebraic specification in CoCASL, Behavioural differential equations: a coinductive calculus of streams, automata, and power series, Distributivity of categories of coalgebras, Coalgebraic modal logic: soundness, completeness and decidability of local consequence, Bisimulation maps in presheaf categories, Confluence of the coinductive \(\lambda\)-calculus, From global to local state, coalgebraically and compositionally, On tree coalgebras and coalgebra presentations, The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator, The Burnside algebra of a quasigroup., Free-lattice functors weakly preserve epi-pullbacks, A compositional coalgebraic model of fusion calculus, Recursively defined metric spaces without contraction, Hennessy-Milner and van Benthem for instantial neighbourhood logic, Monotone subintuitionistic logic: duality and transfer results, A finite model construction for coalgebraic modal logic, A perspective on service orchestration, Factoring stochastic relations, A presheaf environment for the explicit fusion calculus, On induction principles for partial orders, Some properties of coalgebras and their rôle in computer science, A proof of Moessner's theorem by coinduction, A (co)algebraic theory of succinct automata, A calculus for generic, QoS-aware component composition, Bisimulation for probabilistic transition systems: A coalgebraic approach, Expressiveness of component-based frameworks: a study of the expressiveness of BIP, Categorically algebraic topology versus universal topology, A description based on languages of the final non-deterministic automaton, A quantified coalgebraic van Benthem theorem, Coalgebra and abstraction, Modular construction of complete coalgebraic logics, Control of discrete-event systems with modular or distributed structure, From generic partition refinement to weighted tree automata minimization, A simplification functor for coalgebras, Integrating Observational and Computational Features in the Specification of State-Based, Dynamical Systems, Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study, A Coalgebraic Semantics of Subtyping, Coalgebras for Binary Methods: Properties of Bisimulations and Invariants, Expressivity of coalgebraic modal logic: the limits and beyond, Finitary coalgebraic multisemilattices and multilattices., A network-conscious \(\pi\)-calculus and its coalgebraic semantics, Revisiting causality, coalgebraically, The converse of a stochastic relation, Notions of bisimulation and congruence formats for SOS with data, Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types, A behavioural pseudometric for probabilistic transition systems, Continuous normalization for the lambda-calculus and Gödel's T, A modular approach to defining and characterising notions of simulation, Isomorphism theorems for coalgebras, Hausdorff coalgebras, A modal proof theory for final polynomial coalgebras, Approximating and computing behavioural distances in probabilistic transition systems, Bisimulation and coinduction enhancements: a historical perspective, Languages and models for hybrid automata: a coalgebraic perspective, Bisimulation for labelled Markov processes, A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata, Coalgebraic logics \& duality, Undecidability of equality for codata types, Long-term values in Markov decision processes, (co)algebraically, (in)finite trace equivalence of probabilistic transition systems, Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract), Fibrational bisimulations and quantitative reasoning, On final coalgebras of power-set functors and saturated trees, Equational Coalgebraic Logic, A calculus of concurrent graph-rewriting processes, Problems of constructing intelligent systems. Intelligent modeling, Quasipolynomial computation of nested fixpoints, A New Foundation for Finitary Corecursion, A new foundation for finitary corecursion and iterative algebras, Non-well-founded deduction for induction and coinduction, Towards Weak Bisimulation For Coalgebras, Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors, GSOS for probabilistic transition systems, Institutionalising Many-Sorted Coalgebraic Modal Logic, Some Co-Birkhoff Type Theorems, Comprehension for Coalgebras, Towards coalgebraic behaviourism, Towards Behavioral Maude, Greatest Bisimulations for Binary Methods, A semantic model for interacting cyber-physical systems, Probabilistic mediator: a coalgebraic perspective, Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus, Distributive laws for monotone specifications, Bisimulation relations for dynamical, control, and hybrid systems, A tutorial on coinductive stream calculus and signal flow graphs, Integrating induction and coinduction via closure operators and proof cycles, Final coalgebras and the Hennessy-Milner property, From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference, Structural operational semantics for continuous state stochastic transition systems, Lax extensions of coalgebra functors and their logic, Context-free coalgebras, On \(\mathbf{MV} \)-coalgebras over the category of BL-algebras, Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic, Coalgebraic semantics for nominal automata, Saturated Kripke structures as Vietoris coalgebras, Stick breaking, in coalgebra and probability

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1583483&oldid=13876006"