We propose a partial order reduction method for reachability analysis of networks of timed automata interacting via synchronous channel communication and via shared variables. Our method is based on (classical) symbolic delay transition systems and exploits the urgent behavior of a system, where time does not introduce dependencies among actions. In the presence of urgent behavior in the network, we apply partial order reduction techniques for discrete systems based on stubborn sets. We first describe the framework in the general setting of symbolic delay time transition systems and then instantiate it to the case of timed automata. We implement our approach in the model checker Uppaal and observe a substantial reduction in the reachable state space for case studies that exhibit frequent urgent behaviour and only a moderate slowdown on models with limited occurrence of urgency.
|Title of host publication||Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Proceedings|
|Editors||Dang Van Hung, Oleg Sokolsky|
|Number of pages||17|
|Publication status||Published - 2020|
|Event||18th International Symposium on Automated Technology for Verification and Analysis, ATVA 2020 - Hanoi, Viet Nam|
Duration: 19 Oct 2020 → 23 Oct 2020
|Conference||18th International Symposium on Automated Technology for Verification and Analysis, ATVA 2020|
|Period||19/10/2020 → 23/10/2020|
|Series||Lecture Notes in Computer Science|
Bibliographical notePublisher Copyright:
© 2020, Springer Nature Switzerland AG.
Copyright 2020 Elsevier B.V., All rights reserved.