|Reachability for Two-Counter Machines with One Test and One Reset|
du groupe Séminaire Méthodes Formelles
|Date|| 2019-03-26 11:00-12:00|
|Titre||Reachability for Two-Counter Machines with One Test and One Reset |
|Résumé||We prove that the reachability relation of two-counter machines with one zero-test and one reset is Presburger-definable and effectively computable. Our proof is based on the introduction of two classes of Presburger-definable relations effectively stable by transitive closure. This approach generalizes and simplifies the existing different proofs and it solves an open problem introduced by Finkel and Sutre in 2000.
This is a joint work with Alain Finkel and Jérôme Leroux. |
|Orateur||Grégoire Sutre |
Aucun document lié à cet événement.RetourRetour à l'index