A decision procedure for bisimilarity of generalized regular expressions
- Citation:
- Bonsangue M, Caltais G, Goriac E, Lucanu D, Rutten J, Silva A. 2010. A decision procedure for bisimilarity of generalized regular expressions. Proceedings of the 13th Brazilian Symposium on Formal Methods (SBMF 2010). 6527:226–241.
Tertiary Title:
Lecture Notes in Computer ScienceDate Presented:
NovemberAbstract:
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene’s theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems covered include infinite streams, deterministic automata and Mealy machines. In this paper, we present a tool where the aforementioned expressions can be derived automatically and a novel algorithm to decide whether two expressions are bisimilar or not. The procedure is implemented in the automatic theorem prover CIRC, by reducing coinduction to an entailment relation between an algebraic specification and an appropriate set of equations.
Citation Key:
BG10DOI:
10.1007/978-3-642-19829
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.