Sciweavers

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

14

ICALP
2000
Springer

favoriteEmaildiscussreport

88views Programming Languages» more ICALP 2000»

A New Unfolding Approach to LTL Model Checking

13 years 8 months ago

A New Unfolding Approach to LTL Model Checking

Download lib.tkk.fi

Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniques presented so far required to run an elaborate algorithm on the prefix.

Javier Esparza, Keijo Heljanko

Real-time Traffic

Certain Finite Prefix | ICALP 2000 | Model Checking | Model Checking Problem | Programming Languages |

claim paper

Related Content

» SelfLoop Aggregation Product A New Hybrid Approach to OntheFly LTL Model Checking

» LTL satisfiability checking

» LTL Model Checking for Security Protocols

» LP Deadlock Checking Using Partial Order Dependencies

» Symbolic Systems Explicit Properties On Hybrid Approaches for LTL Symbolic Model Checking

» Model Checking with Finite Complete Prefixes Is PSPACEComplete

» ClusterBased LTL Model Checking of Large Systems

» Truly OntheFly LTL Model Checking

» Proving More Properties with Bounded Model Checking

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	ICALP
Authors	Javier Esparza, Keijo Heljanko

Comments (0)