TY - GEN
T1 - A game-theoretic approach to simulation of data-parameterized systems
AU - Grumberg, Orna
AU - Kupferman, Orna
AU - Sheinvald, Sarai
N1 - Publisher Copyright: © Springer International Publishing Switzerland 2014.
PY - 2014
Y1 - 2014
N2 - This work focuses on data-parameterized abstract systems that extend standard modelling by allowing atomic propositions to be parameterized by variables that range over some infinite domain. These variables may range over process ids, message numbers, etc. Thus, abstract systems enable simple modelling of infinite-state systems whose source of infinity is the data. We define and study a simulation pre-order between abstract systems. The definition extends the definition of standard simulation by referring also to variable assignments. We define VCTL* – an extension of CTL* by variables, which is capable of specifying properties of abstract systems. We show that VCTL* logically characterizes the simulation pre-order between abstract systems. That is, that satisfaction of VACTL*, namely the universal fragment of VCTL*, is preserved in simulating abstract systems. For the second direction, we show that if an abstract system A2 does not simulate an abstract system A1, then there exists a VACTL formula that distinguishes A1 from A2. Finally, we present a game-theoretic approach to simulation of abstract systems and show that the prover wins the game iff A2 simulates A1. Further, if A2 does not simulate A1, then the refuter wins the game and his winning strategy corresponds to a VACTL formula that distinguishes A1 from A2. Thus, the many appealing practical advantages of simulation are lifted to the setting of data-parameterized abstract systems.
AB - This work focuses on data-parameterized abstract systems that extend standard modelling by allowing atomic propositions to be parameterized by variables that range over some infinite domain. These variables may range over process ids, message numbers, etc. Thus, abstract systems enable simple modelling of infinite-state systems whose source of infinity is the data. We define and study a simulation pre-order between abstract systems. The definition extends the definition of standard simulation by referring also to variable assignments. We define VCTL* – an extension of CTL* by variables, which is capable of specifying properties of abstract systems. We show that VCTL* logically characterizes the simulation pre-order between abstract systems. That is, that satisfaction of VACTL*, namely the universal fragment of VCTL*, is preserved in simulating abstract systems. For the second direction, we show that if an abstract system A2 does not simulate an abstract system A1, then there exists a VACTL formula that distinguishes A1 from A2. Finally, we present a game-theoretic approach to simulation of abstract systems and show that the prover wins the game iff A2 simulates A1. Further, if A2 does not simulate A1, then the refuter wins the game and his winning strategy corresponds to a VACTL formula that distinguishes A1 from A2. Thus, the many appealing practical advantages of simulation are lifted to the setting of data-parameterized abstract systems.
UR - http://www.scopus.com/inward/record.url?scp=84908669311&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-319-11936-6_25
DO - https://doi.org/10.1007/978-3-319-11936-6_25
M3 - منشور من مؤتمر
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 348
EP - 363
BT - Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Proceedings
A2 - Cassez, Franck
A2 - Raskin, Jean-François
T2 - 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014
Y2 - 3 November 2014 through 7 November 2014
ER -