On the complexity of verification of time-sensitive distributed systems
From MaRDI portal
Publication:2154017
DOI10.1007/978-3-030-91631-2_14zbMath1498.68161arXiv2105.03531OpenAlexW3217038706MaRDI QIDQ2154017
Carolyn L. Talcott, Tajana Ban Kirigin, Vivek Nigam, Max I. Kanovich, Andrej Scedrov
Publication date: 13 July 2022
Full work available at URL: https://arxiv.org/abs/2105.03531
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Distributed systems (68M14)
Related Items (2)
On the formalization and computational complexity of resilience problems for cyber-physical systems ⋮ A semantic model for interacting cyber-physical systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Collaborative planning with confidentiality
- Quantitative temporal logics over the reals: PSpace and below
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Recognizing safety and liveness
- On the expressivity and complexity of quantitative branching-time temporal logics
- Abstraction and Completeness for Real-Time Maude
- A rewriting framework and logic for activities subject to regulations
- On the security of public key protocols
- Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
- Model Checking Quantitative Linear Time Logic
- Formal Methods for the Design of Real-Time Systems
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: On the complexity of verification of time-sensitive distributed systems
