scholarly journals Ultimately-periodic Interval Model Checking for Temporal Dataset Evaluation

10.29007/r3pf ◽  
2019 ◽  
Author(s):  
Dario Della Monica ◽  
Angelo Montanari ◽  
Aniello Murano ◽  
Guido Sciavicco
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Interval Length ◽  
Finite Model ◽  
Temporal Data ◽  
Interval Model ◽  
Interval Temporal Logic ◽  
Periodic Interval

Temporal dataset evaluation is the problem of establishing to what extent a set of temporal data (histories) complies with a given temporal condition. Checking interval temporal logic formulas against a finite model has been recently proposed, and proved successful, as a tool to solve such a problem. In this paper, we address the problem of checking interval temporal logic specifications, supporting interval length constraints, against infinite, finitely representable models, and we show the applicability of the resulting procedure to the evaluation of incomplete temporal datasets viewed as finite prefixes of ultimately-periodic histories.

Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments

2016 ◽  
pp. 389-405 ◽  
Author(s):  
Laura Bozzelli ◽  
Alberto Molinari ◽  
Angelo Montanari ◽  
Adriano Peron ◽  
Pietro Sala
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Logic Model ◽  
Interval Temporal Logic ◽  
Logic Model Checking

Model Checking Multirate Hybrid Systems with Dense Timed Interval Temporal Logic

2012 ◽  
Vol 198-199 ◽  
pp. 889-893
Author(s):  
Hai Bin Zhang ◽  
Li Ya Yang
Keyword(s):  
Model Checking ◽  
Hybrid Systems ◽  
Temporal Logic ◽  
Desirable Property ◽  
Interval Temporal Logic

This paper investigates the model checking issue of multirate hybrid systems. To this end, multirate automata are used to represent the possible behavior of multirate hybrid systems, and a dense timed interval temporal logic (DTITL) is defined to describe the desirable property. To check whether a multirate automaton satisfies a DTITL formula, a corresponding region automaton and a propositional interval temporal logic (PITL) formula are constructed. After each vertex of the region automaton being labeled with propositions appearing in the corresponding PITL formula, the model checking problem for mutirate hybrid systems is reduced to the same issue for PITL, which can be solved readily.

scholarly journals Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications

2019 ◽  
Author(s):  
Jakub Michaliszyn ◽  
Piotr Witkowski
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Order Logic ◽  
Regular Expressions ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Interval Temporal Logic ◽  
Multi Agent ◽  
Second Order Logic ◽  
Monadic Second Order Logic

Epistemic Halpern-Shoham logic (EHS) is an interval temporal logic defined to verify properties of Multi-Agent Systems. In this paper we show that the model checking Multi-Agent Systems with regular expressions against the EHS specifications is decidable. We achieve this by reducing the model checking problem to the satisfiability problem of Monadic Second-Order Logic on trees.

A Novel Approach for Intrusion Detection Based on Model Checking Interval Temporal Logic with Past Construct

2014 ◽  
Vol 680 ◽  
pp. 451-454
Author(s):  
Peng Zhe Qiao ◽  
Wei Jun Zhu
Keyword(s):  
Model Checking ◽  
Intrusion Detection ◽  
Temporal Logic ◽  
Pattern Matching ◽  
New Method ◽  
Network Attacks ◽  
New Model ◽  
Interval Temporal Logic ◽  
Novel Approach ◽  
Attack Models

Compared with the Intrusion Detection (ID) based on pattern matching, the model-checking-based methods can find the complex attacks. But their rates of missing report are still high. To solve this problem, we firstly use the Interval Temporal Logic with Past Construct (ITLPC) formulae to describe some signatures for network attacks. And then, we can use some automata to establish models of audit logs. On the basis of it, automata, i.e., attack models, and ITLPC formulae, i.e., signatures, constitute the two inputs of the ITLPC model checking algorithm. Therefore, a new model-checking-based ID algorithm is obtained by calling the ITLPC algorithm. Compared with the existing methods, the new method is more powerful, as shown in the experimental simulations.

scholarly journals Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy

2018 ◽  
Vol 262 ◽  
pp. 241-264 ◽  
Author(s):  
Laura Bozzelli ◽  
Alberto Molinari ◽  
Angelo Montanari ◽  
Adriano Peron ◽  
Pietro Sala
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Polynomial Time ◽  
Interval Temporal Logic ◽  
Low Levels ◽  
Polynomial Time Hierarchy
Sign in / Sign up

Export Citation Format

Share Document