Infinite-State Model Checking of LTLR Formulas Using Narrowing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-12904-4_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Global Model-Checking of Infinite-State Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

On-The-Fly Model Checking of RCTL Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Model Checking With SAT-Based Characterization of ACTL Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1999English

Parallel State Space Construction for Model-Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Model Checking Using Net Unfoldings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Checking Sequence Generation Using State Distinguishing Subsequences

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy