TY - GEN
T1 - An automata-theoretic approach to reasoning about parameterized systems and specifications
AU - Grumberg, Orna
AU - Kupferman, Orna
AU - Sheinvald, Sarai
PY - 2013
Y1 - 2013
N2 - We introduce generalized register automata (GRAs) and study their properties and applications in reasoning about systems and specifications over infinite domains. We show that GRAs can capture both VLTL - a logic that extends LTL with variables over infinite domains, and abstract systems - finite state systems whose atomic propositions are parameterized by variable over infinite domains. VLTL and abstract systems naturally model and specify infinite-state systems in which the source of infinity is the data domain (c.f., range of processes id, context of messages). Thus, GRAs suggest an automata-theoretic approach for reasoning about such systems. We demonstrate the usefulness of the approach by pushing forward the known border of decidability for the model-checking problem in this setting. From a theoretical point of view, GRAs extend register automata and are related to other formalisms for defining languages over infinite alphabets.
AB - We introduce generalized register automata (GRAs) and study their properties and applications in reasoning about systems and specifications over infinite domains. We show that GRAs can capture both VLTL - a logic that extends LTL with variables over infinite domains, and abstract systems - finite state systems whose atomic propositions are parameterized by variable over infinite domains. VLTL and abstract systems naturally model and specify infinite-state systems in which the source of infinity is the data domain (c.f., range of processes id, context of messages). Thus, GRAs suggest an automata-theoretic approach for reasoning about such systems. We demonstrate the usefulness of the approach by pushing forward the known border of decidability for the model-checking problem in this setting. From a theoretical point of view, GRAs extend register automata and are related to other formalisms for defining languages over infinite alphabets.
UR - http://www.scopus.com/inward/record.url?scp=84887414549&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-02444-8_28
DO - 10.1007/978-3-319-02444-8_28
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84887414549
SN - 9783319024431
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 397
EP - 411
BT - Automated Technology for Verification and Analysis - 11th International Symposium, ATVA 2013, Proceedings
T2 - 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013
Y2 - 15 October 2013 through 18 October 2013
ER -