Partial Model Checking for the Verification and Synthesis of Secure Service Compositions

Partial model checking with ROBDDs

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/bfb0035379 ◽

1997 ◽

pp. 35-49 ◽

Cited By ~ 4

Author(s):

Henrik Reif Andersen ◽

Jørgen Staunstrup ◽

Niels Maretti

Keyword(s):

Model Checking ◽

Partial Model

Download Full-text

Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems

Logical Methods in Computer Science ◽

10.2168/lmcs-9(4:1)2013 ◽

2013 ◽

Vol 9 (4) ◽

Cited By ~ 3

Author(s):

Frédéric Lang ◽

Radu Mateescu

Keyword(s):

Model Checking ◽

Transition Systems ◽

Labelled Transition Systems ◽

Partial Model

Download Full-text

Partial model checking of modal equations: A survey

International Journal on Software Tools for Technology Transfer ◽

10.1007/s100090050032 ◽

1999 ◽

Vol 2 (3) ◽

pp. 242 ◽

Cited By ~ 10

Author(s):

Henrik Reif Andersen ◽

Jorn Lind-Nielsen

Keyword(s):

Model Checking ◽

Partial Model

Download Full-text

A Quantitative Partial Model-Checking Function and Its Optimisation

10.29007/rb2p ◽

2018 ◽

Author(s):

Stefano Bistarelli ◽

Fabio Martinelli ◽

Ilaria Matteucci ◽

Francesco Santini

Keyword(s):

Model Checking ◽

Modal Logic ◽

Algebraic Structure ◽

Process Algebra ◽

Software Systems ◽

Efficient Tool ◽

Combinatorial Explosion ◽

Loosely Coupled ◽

Partial Model ◽

Final Score

Partial Model-Checking (PMC) is an efficient tool to reduce the combinatorial explosion of a state-space, arising in the verification of loosely-coupled software systems. At the same time, it is useful to consider quantitative temporal-modalities. This allows for checking whether satisfying such a desired modality is too costly, by comparing the final score consisting of how much the system spends to satisfy the policy, to a given threshold. We stir these two ingredients together in order to provide a Quantitative PMC function (QPMC), based on the algebraic structure of semirings. We design a method to extract part of the weight during QPMC, with the purpose to avoid the evaluation of a modality as soon as the threshold is crossed. Moreover, we extend classical heuristics to be quantitative, and we investigate the complexity of QPMC.Keyword: Partial Model Checking, Semirings, Optimisation, Quantitative Modal Logic Quantitative Process Algebra, Quantitative Evaluation of Systems.

Download Full-text

Natural Projection as Partial Model Checking

Journal of Automated Reasoning ◽

10.1007/s10817-020-09568-7 ◽

2020 ◽

Vol 64 (7) ◽

pp. 1445-1481

Author(s):

Gabriele Costa ◽

Letterio Galletta ◽

Pierpaolo Degano ◽

David Basin ◽

Chiara Bodei

Keyword(s):

Model Checking ◽

Control Theory ◽

Control Flow ◽

Point Of View ◽

Natural Projection ◽

Transition Systems ◽

Partial Model ◽

Finite State ◽

Symbolic Transition Systems ◽

Large Systems

Abstract Verifying the correctness of a system as a whole requires establishing that it satisfies a global specification. When it does not, it would be helpful to determine which modules are incorrect. As a consequence, specification decomposition is a relevant problem from both a theoretical and practical point of view. Until now, specification decomposition has been independently addressed by the control theory and verification communities through natural projection and partial model checking, respectively. We prove that natural projection reduces to partial model checking and, when cast in a common setting, the two are equivalent. Apart from their foundational interest, our results build a bridge whereby the control theory community can reuse algorithms and results developed by the verification community. Furthermore, we extend the notions of natural projection and partial model checking from finite-state to symbolic transition systems and we show that the equivalence still holds. Symbolic transition systems are more expressive than traditional finite-state transition systems, as they can model large systems, whose behavior depends on the data handled, and not only on the control flow. Finally, we present an algorithm for the partial model checking of both kinds of systems that can be used as an alternative to natural projection.

Download Full-text