Proving language inclusion and equivalence by coinduction
From MaRDI portal
(Redirected from Publication:899321)
Recommendations
Cites work
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 1304993 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- A calculus of communicating systems
- Algebra and Coalgebra in Computer Science
- Automated analysis of regular algebra
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Bialgebras for structural operational semantics: an introduction
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- Calculi for synchrony and asynchrony
- Checking NFA equivalence with bisimulations up to congruence
- Circular coinduction in Coq using bisimulation-up-to techniques
- Coinduction up-to in a fibrational setting
- Coinductive proof techniques for language equivalence
- Concurrent Kleene algebra and its foundations
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Deciding Kleene algebras in \texttt{Coq}
- Deciding regular expressions (in-)equivalence in Coq
- Derivatives of Regular Expressions
- Enhanced coalgebraic bisimulation
- Enhancements of the bisimulation proof method
- On the bisimulation proof method
- Proof Pearl: regular expression equivalence and relation algebra
- Regular expression containment, coinductive axiomatization and computational interpretation
- Two Families of Languages Related to ALGOL
- Une condition impliquant toutes les identités rationnelles
- Universal coalgebra: A theory of systems
Cited in
(9)- Companions, codensity and causality
- 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
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)
