Napredna pretraga

Pregled bibliografske jedinice broj: 822635

Timed Multiset Rewriting and the Verification of Time- Sensitive Distributed Systems


Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre; Talcott, Carolyn
Timed Multiset Rewriting and the Verification of Time- Sensitive Distributed Systems // Lecture Notes in Computer Science, Volume 9884 / Fränzle, Martin ; Markey, Nicolas (ur.).
Cham: Springer International Publishing, 2016. str. 228-244 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


Naslov
Timed Multiset Rewriting and the Verification of Time- Sensitive Distributed Systems

Autori
Kanovich, Max ; Ban Kirigin, Tajana ; Nigam, Vivek ; Scedrov, Andre ; Talcott, Carolyn

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Lecture Notes in Computer Science, Volume 9884 / Fränzle, Martin ; Markey, Nicolas - Cham : Springer International Publishing, 2016, 228-244

ISBN
978-3-319-44877-0

Skup
14th International Conference on Formal Modelling and Analysis of Timed Systems

Mjesto i datum
Quebec City, Kanada, 24-26.08.2016

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Multiset Rewriting; Distributed Systems; Computational Complexity; Maude

Sažetak
Time-Sensitive Distributed Systems (TSDS), such as applications using autonomous drones, achieve goals under possible environment interference (e.g., winds). Moreover, goals are often specified using explicit time constraints which must be satisfied by the system perpetually. For example, drones carrying out the surveillance of some area must always have recent pictures, i.e., at most M time units old, of some strategic locations. This paper proposes a Multiset Rewriting language with explicit time for specifying and analysing TSDSes. We introduce two properties, realizability (some trace is good) and survivability (where, in addition, all admissible traces are good). A good trace is an infinite trace in which goals are perpetually satisfied. We propose a class of systems called progressive 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 both the realizability and the survivability problems are PSPACE-complete. Furthermore, if we impose a bound on time (as in bounded model-checking), we show that for PTS, realizability becomes NP-complete, while survivability is in the $\Delta_2^p$ class of the polynomial hierarchy. Finally, we demonstrate that the rewriting logic system Maude can be used to automate time bounded verification of PTS.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Računarstvo



POVEZANOST RADA


Ustanove
Sveučilište u Rijeci - Odjel za matematiku

Autor s matičnim brojem:
Tajana Ban-Kirigin, (229313)