scientific article; zbMATH DE number 1064116
From MaRDI portal
Publication:4355684
Recommendations
Cited in
(only showing first 100 items - show all)- Bialgebraic methods and modal logic in structural operational semantics
- Bi-inductive structural semantics
- Coinduction for exact real number computation
- Terminal metric spaces of finitely branching and image finite linear processes
- Observational ultraproducts of polynomial coalgebras.
- A transition system semantics for the control-driven coordination language MANIFOLD
- Fixpoint semantics and simulation
- Object-oriented hybrid systems of coalgebras plus monoid actions
- Swinging types=functions+relations+transition systems
- Universal coalgebra: A theory of systems
- CSP, partial automata, and coalgebras.
- On institutions for modular coalgebraic specifications.
- Combining a monad and a comonad
- p-adic physics, non-well-founded reality and unconventional computing
- Undecidability of equality for codata types
- Coalgebras and monads in the semantics of Java
- Observational logic, constructor-based logic, and their duality.
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- De Bakker-Zucker processes revisited
- Cut elimination for a logic with induction and co-induction
- Partition refinement of component interaction automata
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Non-well-founded deduction for induction and coinduction
- Integrating induction and coinduction via closure operators and proof cycles
- Intuitionistic fixed point logic
- Finitary coalgebraic multisemilattices and multilattices.
- Interactive verification of architectural design patterns in FACTum
- Structural operational semantics for continuous state stochastic transition systems
- Circular proofs for the Gödel-Löb provability logic
- Soundness and completeness proofs by coinductive methods
- Recursively defined metric spaces without contraction
- A description based on languages of the final non-deterministic automaton
- Distributive laws for the coinductive solution of recursive equations
- Coalgebraic semantics for timed processes
- A modal proof theory for final polynomial coalgebras
- Approximating and computing behavioural distances in probabilistic transition systems
- Final coalgebras and the Hennessy-Milner property
- Some properties of coalgebras and their rôle in computer science
- Many-sorted coalgebraic modal logic: A model-theoretic study
- A coalgebraic semantics of subtyping
- Coalgebras for binary methods: Properties of bisimulations and invariants
- GSOS for probabilistic transition systems (extended abstract)
- Comprehension for coalgebras
- Modal predicates and coequations
- Towards behavioral Maude: behavioral membership equational logic
- A syntactical approach to weak (bi-)simulation for coalgebras
- Bialgebraic methods in structural operational semantics (invited talk)
- Co-algebraic models for quantitative spatial logics
- Bi-inductive structural semantics (extended abstract)
- Inductive and coinductive components of corecursive functions in Coq
- Regular strategies as proof tactics for \textsf{CIRC}
- Expander2: program verification between interaction and automation
- Coalgebraic components in a many-sorted microcosm
- Characterising behavioural equivalence: Three sides of one coin
- Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
- Equivalences and congruences on infinite Conway games
- Data intensive distributed computing in data aware self-organizing networks
- Probabilistic operational semantics for the lambda calculus
- A single complete relational rule for coalgebraic refinement
- From grammars and automata to algebras and coalgebras
- scientific article; zbMATH DE number 5994844 (Why is no real title available?)
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Timing-Sensitive Noninterference through Composition
- How to reason coinductively informally
- Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
- A Brief Overview of PVS
- Actors without Directors: A Kahnian View of Heterogeneous Systems
- Using Structural Recursion for Corecursion
- Two extensions of System F with (co)iteration and primitive (co)recursion principles
- Systems analysis of life cycle of large-scale information-control systems
- Foundations for structuring behavioural specifications
- An approach to innocent strategies as graphs
- Natural duality, modality, and coalgebra
- scientific article; zbMATH DE number 1314221 (Why is no real title available?)
- A Note on Hyperspaces and Terminal Coalgebras
- Generalised coinduction
- Relational graph models at work
- Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
- The mechanical generation of fault trees for reactive systems via retrenchment. II. Clocked and feedback circuits
- An approach to object semantics based on terminal co-algebras
- From Böhm's theorem to observational equivalences: an informal account
- Generalised coinduction
- When is a function a fold or an unfold?
- Modal operators for coequations
- From algebras and coalgebras to dialgebras
- Elements of stream calculus (an extensive exercise in coinduction)
- Final Dialgebras: From Categories to Allegories
- Minimality Notions via Factorization Systems and Examples
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Efficient Coalgebraic Partition Refinement
- Distribution bisimilarity via the power of convex algebras
- Modularity and implementation of mathematical operational semantics
- Proving the unique fixed-point principle correct: an adventure with category theory
- Efficient and modular coalgebraic partition refinement
- Formalizing bialgebraic semantics in PVS 6.0
- Coalgebras as types determined by their elimination rules
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
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)
