 |
|
|
|
| HAL : hal-00639716, version 5 |
| DOI : 10.1145/2429069.2429124 |
| Fiche détaillée |  Récupérer au format |
|
|
| Principle of Programming Languages (POPL), Roma : Italy (2013) |
|
|
| Versions disponibles : | v1 (10-11-2011) | v2 (06-12-2011) | v3 (16-01-2012) | v4 (28-02-2012) | v5 (11-07-2012) |
|
|
|
|
| Checking NFA equivalence with bisimulations up to congruence |
|
|
Filippo Bonchi 1Damien Pous 1 |
|
|
| (01/2013) |
|
|
|
| We introduce bisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp. We compare our algorithm to the recently introduced antichain algorithms, by analysing and relating the two underlying coinductive proof methods. We give concrete examples where we exponentially improve over antichains; experimental results moreover show non negligible improvements on random automata. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire de l'Informatique du Parallélisme (LIP) |
|
|
|
Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I |
|
|
|
|
|
|
|
|
|
| Plume |
|
|
|
|
| Domaine | : | Informatique/Algorithme et structure de données Informatique/Mathématique discrète |
|
|
| Language Equivalence – Non-deterministic Finite Automata – Bisimulation – Coinduction – Up-to techniques – Congruence |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00639716, version 5 | |
| http://hal.archives-ouvertes.fr/hal-00639716 | |
| oai:hal.archives-ouvertes.fr:hal-00639716 | |
| Contributeur : Damien Pous | |
| Soumis le : Mercredi 11 Juillet 2012, 09:47:56 | |
| Dernière modification le : Dimanche 10 Mars 2013, 19:51:50 | |
