A general account of coinduction up-to
From MaRDI portal
Publication:523132
DOI10.1007/S00236-016-0271-4zbMath1371.68186OpenAlexW2468444917MaRDI QIDQ523132
Filippo Bonchi, Jurriaan Rot, Damien Pous, Daniela Petrişan
Publication date: 20 April 2017
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-016-0271-4
Related Items (16)
A symbolic decision procedure for symbolic alternating finite automata ⋮ Unnamed Item ⋮ Preservation and reflection of bisimilarity via invertible steps ⋮ Unnamed Item ⋮ Up-to techniques for behavioural metrics via fibrations ⋮ Unnamed Item ⋮ Companions, Codensity and Causality ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Up-to Techniques for Branching Bisimilarity ⋮ Unnamed Item ⋮ (in)finite trace equivalence of probabilistic transition systems ⋮ Unnamed Item ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Distributive laws for monotone specifications ⋮ Corecursion up-to via causal transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coinductive predicates and final sequences in a fibration
- A coalgebraic perspective on linear weighted automata
- On cool congruence formats for weak bisimulations
- Bialgebras for structural operational semantics: an introduction
- Probabilistic systems coalgebraically: a survey
- Structural operational semantics for weak bisimulations
- Simulations in coalgebra
- Behavioural equivalences for coalgebras with unobservable moves
- A congruence rule format for name-passing process calculi
- Structural induction and coinduction in a fibrational setting
- Categorical logic and type theory
- Fixpoint semantics and simulation
- Universal coalgebra: A theory of systems
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
- Positive Fragments of Coalgebraic Logics
- Nominal Sets
- Checking NFA equivalence with bisimulations up to congruence
- Weak bisimulation for coalgebras over order enriched monads
- Relating coalgebraic notions of bisimulation
- Finitary Functors: From Set to Preord and Poset
- Introduction to Bisimulation and Coinduction
- Graphes canoniques de graphes algébriques
- Complete Lattices and Up-To Techniques
- On the bisimulation proof method
- Bisimulation can't be traced
- Branching time and abstraction in bisimulation semantics
- Generalised coinduction
- Coinduction up-to in a fibrational setting
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads
- Turing Machines with Atoms
- Lax Bialgebras and Up-To Techniques for Weak Bisimulations
- Enhanced coalgebraic bisimulation
- Enhancements of the bisimulation proof method
- Derivatives of Regular Expressions
This page was built for publication: A general account of coinduction up-to
