TY - GEN

T1 - MLv

T2 - 11th International Symposium on NASA Formal Methods, NFM 2019

AU - Ortiz Vega, James Jerson

AU - Amrani, Moussa

AU - Schobbens, Pierre Yves

PY - 2019/5/23

Y1 - 2019/5/23

N2 - Distributed Real-Time Systems (DRTS) can be characterized by several communicating components whose behavior depends on a large number of timing constraints and such components can basically be located at several computers spread over a communication network. Extensions of Timed Modal Logics (TML) such as, Timed Propositional Modal Logic (TPML), Timed Modal μ-calculus and Lv have been proposed to capture timed and temporal properties in real-time systems. However, these logics rely on a so-called mono-timed semantics for the underlying Timed Labelled Transition Systems (TLTS). This semantics does not capture complex interactions between components with their associated local clocks, thus missing possible action sequences. Based on Multi-Timed Labelled Transition Systems (MLTS), which are an extension of TLTS in order to cope with the notion of distributed clocks, we propose MLv, an extension of Lv that relies on a distributed semantics for Timed Automata (TA) instead of considering uniform clocks over the distributed systems, we let time vary independently in each TA. We define the syntax and the semantics of MLv over executions of MLTS with such a semantics and we show that its model checking problem against MLv is EXPTIME-complete.

AB - Distributed Real-Time Systems (DRTS) can be characterized by several communicating components whose behavior depends on a large number of timing constraints and such components can basically be located at several computers spread over a communication network. Extensions of Timed Modal Logics (TML) such as, Timed Propositional Modal Logic (TPML), Timed Modal μ-calculus and Lv have been proposed to capture timed and temporal properties in real-time systems. However, these logics rely on a so-called mono-timed semantics for the underlying Timed Labelled Transition Systems (TLTS). This semantics does not capture complex interactions between components with their associated local clocks, thus missing possible action sequences. Based on Multi-Timed Labelled Transition Systems (MLTS), which are an extension of TLTS in order to cope with the notion of distributed clocks, we propose MLv, an extension of Lv that relies on a distributed semantics for Timed Automata (TA) instead of considering uniform clocks over the distributed systems, we let time vary independently in each TA. We define the syntax and the semantics of MLv over executions of MLTS with such a semantics and we show that its model checking problem against MLv is EXPTIME-complete.

UR - http://www.scopus.com/inward/record.url?scp=85066844203&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-20652-9_2

DO - 10.1007/978-3-030-20652-9_2

M3 - Conference contribution

AN - SCOPUS:85066844203

SN - 9783030206512

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 19

EP - 35

BT - NASA Formal Methods - 11th International Symposium, NFM 2019, Proceedings

A2 - Badger, Julia M.

A2 - Rozier, Kristin Yvonne

PB - Springer Verlag

Y2 - 7 May 2019 through 9 May 2019

ER -