Pregled bibliografske jedinice broj: 1209519
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems // Theoretical Aspects of Computing – ICTAC 2022. Lecture Notes in Computer Science, vol 13572 / Seidl, Helmut ; Liu, Zhiming ; Pasareanu, Corina S. (ur.).
Cham: Springer, 2022. str. 96-113 doi:10.1007/978-3-031-17715-6_8 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 1209519 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On the Formalization and Computational
Complexity of Resilience Problems for
Cyber-Physical Systems
Autori
Alturki, Musab A. ; Ban Kirigin, Tajana ; Kanovich, Max ; Nigam, Vivek ; Scedrov, Andre ; Talcott, Carolyn
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Theoretical Aspects of Computing – ICTAC 2022. Lecture Notes in Computer Science, vol 13572
/ Seidl, Helmut ; Liu, Zhiming ; Pasareanu, Corina S. - Cham : Springer, 2022, 96-113
ISBN
978-3-031-17715-6
Skup
19th International Colloquium on Theoretical Aspects of Computing (ICTAC 2022)
Mjesto i datum
Tbilisi, Gruzija, 27.09.2022. - 29.09.2022
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Resilience ; Planning ; Formal Methods ; Verification ; Multiset Rewriting ; Computational Complexity
Sažetak
Cyber-Physical Systems (CPS) are used to perform complex, safety-critical missions autonomously. Examples include applications of autonomous vehicles and drones. Given the complexity of these systems, CPS must be able to adapt to possible changes during mission execution, such as regulatory updates or changes in mission objectives. This capability is informally referred to as resilience. We formalize the intuitive notion of resilience as a formal verification property using timed multiset rewriting. An important innovation in our formalization is the distinction between rules that are under the control of the CPS and those that are not. We also study the computational complexity of resilience problems. Although undecidable in general, we show that these problems are PSPACE-complete for a class of bounded systems, more precisely, balanced systems where the rules do not affect the number of facts of the configurations and where facts are of bounded size.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Projekti:
HRZZ-UIP-2017-05-9219 - Formalno rasuđivanje i semantike (FORMALS) (Perkov, Tin, HRZZ - 2017-05) ( CroRIS)
Ustanove:
Sveučilište u Rijeci, Fakultet za matematiku
Profili:
Tajana Ban Kirigin
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Scopus