Representations of Reversible Automata and State Graphs of Vector Addition Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

Representations of Reversible Automata and State Graphs of Vector Addition Systems

Eric Badouel
  • Function : Author
  • PersonId : 833447

Abstract

Using the interpretation of a place of a vector addition system as a synchronic constraint we derive a characterization of the state graphs of vector addition systems as the maximal quotients of polyhedral automata. We give a classification of the representations of reversible automata (automata in which events are local bijections on states) as full subgraphs of Schreier graphs. We describe the computation of the canonical representation of a commutative automaton (automaton that fully embedds in the Cayley graph of an abelian group). We suggest on that basis an algorithm to decide whether a finite automaton is isomorphic to the state graph of a vector addition system. The correction of this algorithm however relies on the conjecture that the state graphs of vector addition systems are torsion-free.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3490.pdf (680.84 Ko) Télécharger le fichier

Dates and versions

inria-00073197 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073197 , version 1

Cite

Eric Badouel. Representations of Reversible Automata and State Graphs of Vector Addition Systems. [Research Report] RR-3490, INRIA. 1998. ⟨inria-00073197⟩
80 View
194 Download

Share

Gmail Facebook Twitter LinkedIn More