Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-63166-6_39
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Global Model-Checking of Infinite-State Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Infinite-State Model Checking of LTLR Formulas Using Narrowing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Symbolic Model Checking for Simply-Timed Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Complexity of Subcases of Presburger Arithmetic

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1984English

Model Checking the Biological Model of Membrane Computing With Probabilistic Symbolic Model Checker by Using Two Biological Systems

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2010English

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

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Verifying Functional Properties of Smart Contracts Using Symbolic Model-Checking

Proceedings of the Institute for System Programming of the RAS
2018English

Conformant Planning via Symbolic Model Checking

Journal of Artificial Intelligence Research
Artificial Intelligence
2000English

TaPAS: The Talence Presburger Arithmetic Suite

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy