Proving language inclusion and equivalence by coinduction
From MaRDI portal
Publication:899321
DOI10.1016/J.IC.2015.11.009zbMath1333.68174OpenAlexW2184297521MaRDI QIDQ899321
Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten
Publication date: 28 December 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.11.009
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Concurrent Kleene algebra and its foundations
- Bialgebras for structural operational semantics: an introduction
- Calculi for synchrony and asynchrony
- A calculus of communicating systems
- Universal coalgebra: A theory of systems
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Proof Pearl: regular expression equivalence and relation algebra
- Deciding Kleene Algebras in Coq
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- Automated Analysis of Regular Algebra
- Deciding Regular Expressions (In-)Equivalence in Coq
- Checking NFA equivalence with bisimulations up to congruence
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- On the bisimulation proof method
- Une condition impliquant toutes les identités rationnelles
- Coinduction up-to in a fibrational setting
- Coinductive Proof Techniques for Language Equivalence
- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
- Enhanced coalgebraic bisimulation
- Regular expression containment
- Enhancements of the bisimulation proof method
- Algebra and Coalgebra in Computer Science
- Two Families of Languages Related to ALGOL
- Derivatives of Regular Expressions
This page was built for publication: Proving language inclusion and equivalence by coinduction
