A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications
[chapter]
2013
Lecture Notes in Computer Science
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
doi:10.1007/978-3-319-02444-8_28
fatcat:2ge5kkx4kbfsxls442ekuuanqq