Flavors of sequential information flow
We study the problem of specifying sequential information-flow properties of systems.
Information-flow properties are hyperproperties, as they compare different traces of a …
Information-flow properties are hyperproperties, as they compare different traces of a …
[PDF][PDF] Linear temporal logic: Expressiveness and model checking
J Strejcek - 2004 - Citeseer
Abstract Model checking of finite-state systems with specifications given as formulae of
Linear Temporal Logic (LTL) is one of the most common verification problems. Like other …
Linear Temporal Logic (LTL) is one of the most common verification problems. Like other …
[HTML][HTML] Taming past LTL and flat counter systems
Reachability and LTL model-checking problems for flat counter systems are known to be
decidable but whereas the reachability problem can be shown in NP, the best known …
decidable but whereas the reachability problem can be shown in NP, the best known …
Computation tree logic for synchronization properties
K Chatterjee, L Doyen - arXiv preprint arXiv:1604.06384, 2016 - arxiv.org
We present a logic that extends CTL (Computation Tree Logic) with operators that express
synchronization properties. A property is synchronized in a system if it holds in all paths of a …
synchronization properties. A property is synchronized in a system if it holds in all paths of a …
Iterated games with LDL goals over finite traces
Linear Dynamic Logic on finite traces (LDLF) is a powerful logic for reasoning about the
behaviour of concurrent and multi-Agent systems. In this paper, we investigate techniques …
behaviour of concurrent and multi-Agent systems. In this paper, we investigate techniques …
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
M Bauland, M Mundhenk, T Schneider… - ACM Transactions on …, 2011 - dl.acm.org
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem
for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on …
for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on …
Weak Kripke structures and LTL
L Kuhtz, B Finkbeiner - International Conference on Concurrency Theory, 2011 - Springer
We revisit the complexity of the model checking problem for formulas of linear-time temporal
logic (LTL). We show that the classic PSPACE-hardness result is actually limited to a …
logic (LTL). We show that the classic PSPACE-hardness result is actually limited to a …
On the expressiveness of MTL variants over dense time
CA Furia, M Rossi - International Conference on Formal Modeling and …, 2007 - Springer
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several
variants. In particular it can be strict (when it does not constrain the current instant) or not …
variants. In particular it can be strict (when it does not constrain the current instant) or not …
On verifying timed hyperproperties
We study the satisfiability and model-checking problems for timed hyperproperties specified
with HyperMTL, a timed extension of HyperLTL. Depending on whether interleaving of …
with HyperMTL, a timed extension of HyperLTL. Depending on whether interleaving of …