scientific article; zbMATH DE number 1064116
From MaRDI portal
Publication:4355684
Recommendations
Cited in
(only showing first 100 items - show all)- Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
- A description based on languages of the final non-deterministic automaton
- Data intensive distributed computing in data aware self-organizing networks
- A transition system semantics for the control-driven coordination language MANIFOLD
- Generalised coinduction
- Covarieties and complete covarieties
- Intuitionistic fixed point logic
- Relational graph models at work
- Bi-inductive structural semantics (extended abstract)
- Timing-Sensitive Noninterference through Composition
- Behavioral abstraction is hiding information
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- Object-oriented hybrid systems of coalgebras plus monoid actions
- Co-algebraic models for quantitative spatial logics
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- A declarative framework for object-oriented programming with genetic inheritance
- Efficient Coalgebraic Partition Refinement
- Systems analysis of life cycle of large-scale information-control systems
- Distribution bisimilarity via the power of convex algebras
- Modularity and implementation of mathematical operational semantics
- Equivalences and congruences on infinite Conway games
- Bialgebraic methods and modal logic in structural operational semantics
- Expander2: program verification between interaction and automation
- Regular strategies as proof tactics for \textsf{CIRC}
- From Böhm's theorem to observational equivalences: an informal account
- Efficient and modular coalgebraic partition refinement
- Bi-inductive structural semantics
- Actors without Directors: A Kahnian View of Heterogeneous Systems
- Computational ludics
- Circular proofs for the Gödel-Löb provability logic
- Reversible monadic computing
- Distributive laws for the coinductive solution of recursive equations
- CSP, partial automata, and coalgebras.
- On institutions for modular coalgebraic specifications.
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Foundations for structuring behavioural specifications
- Coalgebraic semantics for timed processes
- A modal proof theory for final polynomial coalgebras
- Into the Infinite - Theory Exploration for Coinduction
- Synthesis of Reo circuits from scenario-based interaction specifications
- A folk model structure on omega-cat
- Observational logic, constructor-based logic, and their duality.
- scientific article; zbMATH DE number 7121901 (Why is no real title available?)
- From algebras and coalgebras to dialgebras
- Bialgebraic methods in structural operational semantics (invited talk)
- Observational ultraproducts of polynomial coalgebras.
- Recursively defined metric spaces without contraction
- An approach to innocent strategies as graphs
- Natural duality, modality, and coalgebra
- Using Structural Recursion for Corecursion
- On equal -terms
- CafeOBJ Traces
- Some properties of coalgebras and their rôle in computer science
- Coinduction for exact real number computation
- Interactive verification of architectural design patterns in FACTum
- A hierarchy of probabilistic system types
- Equational axiomatizability for coalgebra
- Final Dialgebras: From Categories to Allegories
- De Bakker-Zucker processes revisited
- When is a function a fold or an unfold?
- Finitary coalgebraic multisemilattices and multilattices.
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- A Brief Overview of PVS
- Coalgebras for binary methods: Properties of bisimulations and invariants
- An approach to object semantics based on terminal co-algebras
- Coalgebras and monads in the semantics of Java
- Coinduction in Flow: The Later Modality in Fibrations
- Universal coalgebra: A theory of systems
- From modal logic to terminal coalgebras
- Terminal metric spaces of finitely branching and image finite linear processes
- p-adic physics, non-well-founded reality and unconventional computing
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- Proving the unique fixed-point principle correct: an adventure with category theory
- Fusion of recursive programs with computational effects
- Structural operational semantics for continuous state stochastic transition systems
- A Note on Hyperspaces and Terminal Coalgebras
- Elements of stream calculus (an extensive exercise in coinduction)
- Coinduction for preordered algebra
- Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
- A coalgebraic semantics of subtyping
- Fixpoint semantics and simulation
- Combining a monad and a comonad
- Multigames and strategies, coalgebraically
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Modal operators for coequations
- Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
- Partition refinement of component interaction automata
- Generalised coinduction
- Soundness and completeness proofs by coinductive methods
- Non-well-founded trees in categories
- Proof-theoretic foundations of normal logic programs
- Services and Contracts: Coalgebraically
- The mechanical generation of fault trees for reactive systems via retrenchment. II. Clocked and feedback circuits
- Symmetries, local names and dynamic (de)-allocation of names
- Minimality Notions via Factorization Systems and Examples
- From grammars and automata to algebras and coalgebras
- Approximating and computing behavioural distances in probabilistic transition systems
- An introduction to (co)algebra and (co)induction
- Comprehension for coalgebras
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355684)
