Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CONCUR
2003
Springer

favoriteEmaildiscussreport

120views Distributed And Parallel Com...» more CONCUR 2003»

Model Checking a Path

13 years 9 months ago

Model Checking a Path

Download www.lsv.ens-cachan.fr

We consider the problem of checking whether a ﬁnite (or ultimately periodic) run satisﬁes a temporal logic formula. This problem is at the heart of “runtime veriﬁcation” but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved eﬃciently, and proﬁt from specialized algorithms. We further show it is possible to eﬃciently check paths given in compressed form.

Nicolas Markey, Ph. Schnoebelen

Real-time Traffic

CONCUR 2003 | Extended Temporal Logics | Temporal Logic Formula | Temporal Logics |

claim paper

Related Content

» Mucalculus path checking

» Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths

» Model Checking Restricted Sets of Timed Paths

» Model Checking of Software Components Combining Java PathFinder and Behavior Protocol Mode...

» Active property checking

» Checking and deriving module paths in Verilog cell library descriptions

» Dynamic Path Reduction for Software Model Checking

» Model Checking on Trees with Path Equivalences

» Approximate Model Checking of PCTL Involving Unbounded Path Properties

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CONCUR
Authors	Nicolas Markey, Ph. Schnoebelen

Comments (0)