References of "ACM Transactions on Computational Logic"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailModel Checking MITL formulae on Timed Automata: a Logic-Based Approach
Menghi, Claudio UL; Bersani, Marcello; Rossi, Matteo et al

in ACM Transactions on Computational Logic (2020), 21(3),

Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used for ... [more ▼]

Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used for checking whether the behaviours of a system satisfy a set of properties of interest. Even if efficient model-checkers for Timed Automata exist, these tools are not easily configurable. First, they are not designed to easily allow adding new Timed Automata constructs, such as new synchronization mechanisms or communication procedures, but they assume a fixed set of Timed Automata constructs. Second, they usually do not support the Metric Interval Temporal Logic (MITL) and rely on a precise semantics for the logic in which the property of interest is specified which cannot be easily modified and customized. Finally, they do not easily allow using different solvers that may speed up verification in different contexts. This paper presents a novel technique to perform model checking of Metric Interval Temporal Logic (MITL) properties on TA. The technique relies on the translation of both the TA and the MITL formula into an intermediate Constraint LTL over clocks (CLTLoc) formula which is verified through an available decision procedure. The technique is flexible since the intermediate logic allows the encoding of new semantics as well as new TA constructs, by just adding new CLTLoc formulae. Furthermore, our technique is not bound to a specific solver as the intermediate CLTLoc formula can be verified using different procedures. [less ▲]

Detailed reference viewed: 126 (16 UL)
Full Text
Peer Reviewed
See detailReasoning about Strategic Abilities: Agents with Truly Perfect Recall
Bulling, Nils; Jamroga, Wojciech UL; Popovici, Matei

in ACM Transactions on Computational Logic (2019), 20(2), 101--1046

Detailed reference viewed: 18 (0 UL)
Full Text
Peer Reviewed
See detailDe Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic
Horne, Ross James UL; Tiu, Alwen; Aman, Bogdan et al

in ACM Transactions on Computational Logic (2019), 20(4), 221--2244

Detailed reference viewed: 42 (2 UL)
Full Text
Peer Reviewed
See detailAn Automatic Proving Approach to Parameterized Verification
Li, Yongjian; Duan, Kaiqiang; Jansen, David et al

in ACM Transactions on Computational Logic (2018), 19(4), 1-27

Detailed reference viewed: 125 (1 UL)