Proving language inclusion and equivalence by coinduction
From MaRDI portal
Publication:899321
DOI10.1016/J.IC.2015.11.009zbMATH Open1333.68174OpenAlexW2184297521MaRDI QIDQ899321FDOQ899321
Authors: 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
Recommendations
Cites Work
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- Derivatives of Regular Expressions
- Universal coalgebra: A theory of systems
- Checking NFA equivalence with bisimulations up to congruence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bialgebras for structural operational semantics: an introduction
- Calculi for synchrony and asynchrony
- A calculus of communicating systems
- Automated analysis of regular algebra
- Deciding Kleene algebras in \texttt{Coq}
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- On the bisimulation proof method
- Une condition impliquant toutes les identités rationnelles
- Coinduction up-to in a fibrational setting
- Enhancements of the bisimulation proof method
- Concurrent Kleene algebra and its foundations
- Two Families of Languages Related to ALGOL
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Proof Pearl: regular expression equivalence and relation algebra
- Regular expression containment, coinductive axiomatization and computational interpretation
- Algebra and Coalgebra in Computer Science
- Enhanced coalgebraic bisimulation
- Deciding regular expressions (in-)equivalence in Coq
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- Coinductive proof techniques for language equivalence
- Circular coinduction in Coq using bisimulation-up-to techniques
Cited In (9)
- Brzozowski's and up-to algorithms for must testing
- Planning to chronicle
- Coalgebraic up-to techniques
- Checking NFA equivalence with bisimulations up to congruence
- Algebra and Coalgebra in Computer Science
- Coinductive proof techniques for language equivalence
- Complete Abstractions for Checking Language Inclusion
- A coinductive equational characterisation of trace inclusion for regular processes
- Companions, codensity and causality
Uses Software
This page was built for publication: Proving language inclusion and equivalence by coinduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899321)
