HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Reachability is decidable for ground AC Rewrite systems

Richard Mayr 1 Michaël Rusinowitch
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Résumé : Nous montrons que l'accessibilité est décidable pour les systèmes de réécriture clos modulo AC. Ce résultat s'interprète dans l'algèbre des processus.
keyword : Process ALgebra Verification Reachability Accessibilité Algèbre de Processus
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00098437
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, September 25, 2006 - 5:01:21 PM
Last modification on : Friday, February 4, 2022 - 3:22:39 AM

Identifiers

  • HAL Id : inria-00098437, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE | INRIA2

Citation

Richard Mayr, Michaël Rusinowitch. Reachability is decidable for ground AC Rewrite systems. INFINITY '98, 3rd International Workshop on Verification of Infinite State Systems, 1998, Aalborg, Denmark, 12 p. ⟨inria-00098437⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

37

 

Contact                    Legal Notice                    Personal Data