Sciweavers

499 search results - page 1 / 100
» LTL satisfiability checking
Sort
View
STTT
2010
116views more  STTT 2010»
14 years 7 months ago
LTL satisfiability checking
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
Kristin Y. Rozier, Moshe Y. Vardi
139
Voted
CADE
2007
Springer
16 years 19 days ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
103
Voted
FOSSACS
2008
Springer
15 years 1 months ago
Model Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
ICFEM
2004
Springer
15 years 5 months ago
Linear Inequality LTL (iLTL): A Model Checker for Discrete Time Markov Chains
Abstract. We develop a way of analyzing the behavior of systems modeled using Discrete Time Markov Chains (DTMC). Specifically, we define iLTL, an LTL with linear inequalities on...
YoungMin Kwon, Gul Agha
ICALP
2009
Springer
16 years 18 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner