NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Cimatti, Alessandro; Clarke, Edmund M.; Giunchiglia, Enrico; Giunchiglia, Fausto; Pistore, Marco; Roveri, Marco; Sebastiani, Roberto; Tacchella, Armando

doi:10.1007/3-540-45657-0_29

Cited by 1,237 publications

(942 citation statements)

References 17 publications

(15 reference statements)

Supporting

Mentioning

927

Contrasting

Unclassified

Order By: Relevance

“…In example 2 of Kohn's map with 800 reaction rules over 500 molecular compounds, simple CTL properties have been model-checked in Biocham in a few seconds [16] using the symbolic model-checker NuSMV [50]. This shows the efficiency of model-checking techniques for querying all possible behaviors of a reaction model under the boolean semantics.…”

Section: -And Loop(pq) Stands For Ag((p ⇒ Ef Q) ∧ (Q ⇒ Ef P ))mentioning

confidence: 97%

Formal Cell Biology in Biocham

Fages

Soliman

Formal Methods for Computational Systems Biology

View full text Add to dashboard Cite

Abstract. Biologists use diagrams to represent interactions between molecular species, and on the computer, diagrammatic notations are also employed in interactive maps. These diagrams are fundamentally of two types: reaction graphs and activation/inhibition graphs. In this tutorial, we study these graphs with formal methods originating from programming theory. We consider systems of biochemical reactions with kinetic expressions, as written in the Systems Biology Markup Language (SBML), and interpreted in the Biochemical Abstract Machine (Biocham) at different levels of abstraction, by either an asynchronous boolean transition system, a continuous time Markov chain, or a system of Ordinary Differential Equations over molecular concentrations. We show that under general conditions satisfied in practice, the activation/inhibition graph is independent of the precise kinetic expressions, and is computable in linear time in the number of reactions. Then we consider the formalization of the biological properties of systems, as observed in experiments, in temporal logics. We show that these logics are expressive enough to capture semi-qualitative semi-quantitative properties of the boolean and differential semantics of reaction models, and that model-checking techniques can be used to validate a model w.r.t. its temporal specification, complete it, and search for kinetic parameter values. We illustrate this modelling method with examples on the MAPK signalling cascade, and on Kohn's map of the mammalian cell cycle.

show abstract

Section: -And Loop(pq) Stands For Ag((p ⇒ Ef Q) ∧ (Q ⇒ Ef P ))mentioning

confidence: 97%

Formal Cell Biology in Biocham

Fages

Soliman

Formal Methods for Computational Systems Biology

View full text Add to dashboard Cite

show abstract

“…The system, given a route map and delivery requirements (specified by LTL), automatically finds an optimal truck route that satisfies the requirements based on the framework. We use the NuSMV model checker [10], [11] to realize such a system. Several gaps to realize the system by NuSMV, and techniques to bridge them are explained.…”

Section: Implementing An Automated Route Planner For the Milk-run Logmentioning

confidence: 99%

“…The second gap lies between EMC, which our framework assumes, and UMC, which NuSMV is based on [10], [11]. In EMC, only one path of a model that satisfies a formula is required to prove the satisfaction relation between the model and the formula, which we may call the "witness".…”

Section: Bridging Gaps Between Umc and Emcmentioning

confidence: 99%

Automated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker

Kitamura

Okamoto

2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYIn this paper, we propose and implement an automated route planning framework for milk-run transport logistics by applying model checking techniques. First, we develop a formal specification framework for milk-run transport logistics. The framework adopts LTL (Linear Temporal Logic), a language based on temporal logics, as a specification language for users to be able to flexibly and formally specify complex delivery requirements for trucks. Then by applying the bounded semantics of LTL, the framework then defines the notion of "optimal truck routes", which mean truck routes on a given route map that satisfy given delivery requirements (specified by LTL) with the minimum cost. We implement the framework as an automated route planner using the NuSMV model checker, a state-of-the-art bounded model checker. The automated route planner, given route map and delivery requirements, automatically finds optimal trucks routes on the route map satisfying the given delivery requirements. The feasibility of the implementation design is investigated by analysing its computational complexity and by showing experimental results.

show abstract

“…Our technique has been implemented within NuSMV [7], a state-of-the-art symbolic model checker used both to verify industrial designs of hardware and software systems and to test new formal verification techniques. NuSMV that integrates BDD-based and SAT-based model checking techniques.…”

Section: Definition 3 (Open Pltl Encoding) the Open Translation Of Amentioning

confidence: 99%

“…Also, issues arising on the solving side are addressed, and two detailed examples are developed during the presentation. We apply our guidelines to the incrementalisation of a specific CTS approach (Bounded Model Checking, or BMC for short [6]) and show how to modify both the generation mechanism employed by a real BMC tool (NuSMV [7]) and a public-domain SAT solver (SIM [13]) (Section 5).…”

Section: Introductionmentioning

confidence: 99%

Incremental Compilation-to-SAT Procedures

Benedetti

Bernardini

2005

Theory and Applications of Satisfiability Testing

View full text Add to dashboard Cite

Abstract. We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework that encompasses all the aspects of an incremental decision procedure, from the encoding to the incremental solver. We apply our guidelines to a real-world CTS approach (Bounded Model Checking) and show how to modify both the generation mechanism of a real BMC tool (NuSMV) and the solving engine of a public-domain SAT solver (SIM). Related approaches and experimental results are discussed as well.

show abstract

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

Cited by 1,237 publications

References 17 publications

Formal Cell Biology in Biocham

Formal Cell Biology in Biocham

Automated Route Planning for Milk-Run Transport Logistics with the NuSMV Model Checker

Incremental Compilation-to-SAT Procedures

Contact Info

Product

Resources

About