A Decision Procedure for Bisimilarity of Generalized Regular Expressions
From MaRDI portal
Publication:2999323
Recommendations
- A characterization of regular expressions under bisimulation
- Unified decision procedures for regular expression equivalence
- A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions
- scientific article; zbMATH DE number 7315073
- A Compact Proof of Decidability for Regular Expression Equivalence
- Expressiveness modulo bisimilarity of regular expressions with parallel composition
- scientific article; zbMATH DE number 871236
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- On a generalization of regular expressions
- An Equational Axiomatization of Bisimulation over Regular Expressions
Cites work
- scientific article; zbMATH DE number 1688351 (Why is no real title available?)
- A Kleene Theorem for Polynomial Coalgebras
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Behavioral and coinductive rewriting
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- Circular coinduction: a proof theoretical foundation
- Non-deterministic Kleene coalgebras
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Two Complete Axiom Systems for the Algebra of Regular Events
- Universal coalgebra: A theory of systems
Cited in
(5)- Quantitative Kleene coalgebras
- scientific article; zbMATH DE number 7315073 (Why is no real title available?)
- Verified decision procedures for MSO on words based on derivatives of regular expressions
- Proof Pearl: regular expression equivalence and relation algebra
- Program equivalence by circular reasoning
This page was built for publication: A Decision Procedure for Bisimilarity of Generalized Regular Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999323)