A Finite Exact Representation of Register Automata Configurations

Yu-Fang Chen
(Academia Sinica, Taiwan)
Bow-Yaw Wang
(Academia Sinica, Taiwan)
Di-De Yen
(Academia Sinica, Taiwan)

A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many configurations. We describe a technique to classify infinite register automata configurations into finitely many exact representative configurations. Using the finitary representation, we give an algorithm solving the reachability problem for register automata. We moreover define a computation tree logic for register automata and solve its model checking problem.

In Lukas Holik and Lorenzo Clemente: Proceedings 15th International Workshop on Verification of Infinite-State Systems (INFINITY 2013), Hanoi, Vietnam, 14th October 2013, Electronic Proceedings in Theoretical Computer Science 140, pp. 16–34.
Published: 23rd February 2014.

ArXived at: https://dx.doi.org/10.4204/EPTCS.140.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org