On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report

This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified using explicit time constraints. A good trace is an infinite trace in which the goals are satisfied perpetually despite possible interference from the environment. In our previous work [16], we discussed two desirable properties of TSDSes, realizability (there exists a good trace) and survivability (where, in addition, all admissible traces are good). Here we consider two additional properties, recoverability (all compliant traces do not reach points-of-no-return) and reliability (the system can always continue functioning using a good trace). Following [16], we focus on a class of systems called Progressing Timed Systems (PTS), where intuitively only a finite number of actions can be carried out in a bounded time period. We prove that for this class of systems the properties of recoverability and reliability coincide and are PSPACE-complete. Moreover, if we impose a bound on time (as in bounded model-checking), we show that for PTS the reliability property is in the Π 2 class of the polynomial hierarchy, a subclass of PSPACE. We also show that the bounded survivability is both NP-hard and coNP-hard.

[1]  Tajana Ban Kirigin,et al.  Resource-Bounded Intruders in Denial of Service Attacks , 2019, 2019 IEEE 32nd Computer Security Foundations Symposium (CSF).

[2]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[3]  Carolyn L. Talcott,et al.  Resource and timing aspects of security protocols , 2021, J. Comput. Secur..

[4]  Carolyn L. Talcott,et al.  Time, computational complexity, and probability in the analysis of distance-bounding protocols , 2017, J. Comput. Secur..

[5]  Bowen Alpern,et al.  Recognizing safety and liveness , 2005, Distributed Computing.

[6]  Carolyn L. Talcott,et al.  A rewriting framework and logic for activities subject to regulations , 2017, Math. Struct. Comput. Sci..

[7]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[8]  Max I. Kanovich,et al.  Collaborative Planning with Confidentiality , 2011, Journal of Automated Reasoning.

[9]  Farhad Arbab,et al.  Soft Agents: Exploring Soft Constraints to Model Robust Adaptive Distributed Cyber-Physical Agent Systems , 2015, Software, Services, and Systems.

[10]  Joël Ouaknine,et al.  Safety Metric Temporal Logic Is Fully Decidable , 2006, TACAS.

[11]  Carolyn L. Talcott,et al.  Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems , 2016, FORMATS.

[12]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[13]  P. Alam.  ‘N’ , 2021, Composites Engineering: An A–Z Guide.

[14]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[15]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[16]  Max I. Kanovich,et al.  Bounded Memory Protocols and Progressing Collaborative Systems , 2013, ESORICS.

[17]  Philippe Schnoebelen,et al.  On the expressivity and complexity of quantitative branching-time temporal logics , 2000, Theor. Comput. Sci..

[18]  Peter Csaba Ölveczky,et al.  The Real-Time Maude Tool , 2008, TACAS.

[19]  Carolyn L. Talcott,et al.  Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols , 2015, POST.

[20]  Farhad Arbab,et al.  Formal Specification and Analysis of Robust Adaptive Distributed Cyber-Physical Systems , 2016, SFM.

[21]  Tajana Ban Kirigin,et al.  Progressing Collaborative Systems , 2014 .

[22]  S. Shankar Sastry,et al.  Secure Control: Towards Survivable Cyber-Physical Systems , 2008, 2008 The 28th International Conference on Distributed Computing Systems Workshops.

[23]  John C. Mitchell,et al.  A meta-notation for protocol analysis , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[24]  KoymansRon.  Specifying real-time properties with metric temporal logic , 1990 .

[25]  Peter Csaba Ölveczky,et al.  Abstraction and Completeness for Real-Time Maude , 2006, WRLA.

[26]  Michael R. Clarkson,et al.  Hyperproperties , 2008, 2008 21st IEEE Computer Security Foundations Symposium.

[27]  Carolyn L. Talcott,et al.  A Rewriting Framework for Activities Subject to Regulations , 2012, RTA.

[28]  Carsten Lutz,et al.  Quantitative temporal logics: PSpace and below , 2005, 12th International Symposium on Temporal Representation and Reasoning (TIME'05).

[29]  Max I. Kanovich,et al.  Bounded memory Dolev-Yao adversaries in collaborative systems , 2014, Inf. Comput..

[30]  John C. Mitchell,et al.  Multiset rewriting and the complexity of bounded security protocols , 2004, J. Comput. Secur..

[31]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[32]  Rajeev Alur,et al.  Decision Problems for Timed Automata: A Survey , 2004, SFM.

[33]  Axel Legay,et al.  Model Checking Quantitative Linear Time Logic , 2008, QAPL.