A Divide and Conquer Approach to Model Checking of Liveness Properties

2013 ◽  
Author(s):  
Kazuhiro Ogata ◽  
Min Zhang
Keyword(s):  
Model Checking ◽  
Divide And Conquer ◽  
Liveness Properties

scholarly journals Model Checking via Reachability Testing for Timed Automata

1997 ◽  
Vol 4 (29) ◽  
Author(s):  
Luca Aceto ◽  
Augusto Burgueno ◽  
Kim G. Larsen
Keyword(s):  
Model Checking ◽  
Timed Automata ◽  
Reachability Problem ◽  
Liveness Properties ◽  
Time Logic ◽  
Definition Of ◽  
Reachability Testing ◽  
Time Systems ◽  
Timed Automaton ◽  
Theoretical Side

In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time logic with clocks. This logic may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every logical formula phi, a so-called test automaton T_phi in such a way that checking whether a system S satisfies the property phi can be reduced to a reachability question over the system obtained by making T_phi interact with S. <br />The testable logic we consider is both of practical and theoretical interest. On the practical side, we have used the logic, and the associated approach to model-checking via reachability testing it supports, in the specification and verification in Uppaal of a collision avoidance protocol. On the theoretical side, we show that the logic is powerful enough to permit the definition of characteristic properties, with respect to a timed version of<br />the ready simulation preorder, for nodes of deterministic, tau-free timed automata. This allows one to compute behavioural relations via our model-checking technique, therefore effectively reducing the problem of checking the existence of a behavioural relation among states of a timed automaton to a reachability problem.

scholarly journals Handling Liveness Properties in (ω-)Regular Model Checking

2005 ◽  
Vol 138 (3) ◽  
pp. 101-115 ◽  
Author(s):  
Ahmed Bouajjani ◽  
Axel Legay ◽  
Pierre Wolper
Keyword(s):  
Model Checking ◽  
Regular Model ◽  
Liveness Properties ◽  
Regular Model Checking

Formal Modeling and Verification of Blockchain Consensus Protocol for IoT Systems

2020 ◽  
Author(s):  
Abdelhakim Baouya ◽  
Salim Chehida ◽  
Saddek Bensalem ◽  
Marius Bozga
Keyword(s):  
Model Checking ◽  
Statistical Model ◽  
Temporal Logic ◽  
Communication Protocol ◽  
Information Gathering ◽  
Consensus Algorithm ◽  
Smart Contracts ◽  
Consensus Protocol ◽  
Statistical Model Checking ◽  
Liveness Properties

Many industrials consider blockchain as a technology breakthrough for cybersecurity, with use cases ranging from cryptocurrency system to smart contracts, and so forth. While IoT systems employ a lightweight communication protocol between physical objects, blockchain may ensure safe information gathering. Unfortunately, the mixture of both technologies has yet to be formally investigated regarding the consensus algorithm. In this paper, statistical model checking is applied to provide quantitative answers on whether the modeled system satisfies safety and liveness properties expressed in LTL temporal logic.

A Method to Analyze Predicate Transition Nets Using SPIN Model Checker

2017 ◽  
Vol 27 (09n10) ◽  
pp. 1455-1481 ◽  
Author(s):  
Dewan Mohammad Moksedul Alam ◽  
Xudong He
Keyword(s):  
Model Checking ◽  
Formal Method ◽  
Expressive Power ◽  
Spin Model ◽  
Analysis Method ◽  
Detailed Model ◽  
Liveness Properties ◽  
High Level ◽  
Concurrent And Distributed Systems ◽  
Spin Model Checker

High-level Petri nets (HLPNs) are a formal method for studying concurrent and distributed systems and have been widely used in many application domains. However, their strong expressive power hinders their analyzability. In this paper, we present a new transformational analysis method for analyzing a special class of HLPNs — predicate transition (PrT) nets. This method extends and improves our prior results by covering more PrT net features including full first-order logic formulas and exploring additional alternative translation schemes. This new analysis method is supported by a tool chain — front-end PIPE[Formula: see text] for creating and simulating PrT nets and back-end SPIN for model checking safety and liveness properties. We have applied this method to two benchmark systems used in annual Petri net model checking contest 2015. We discuss several properties and show the detailed model checking results in one system.

To split or to group: from divide-and-conquer to sub-task sharing for verifying multiple properties in model checking

2017 ◽  
Vol 20 (3) ◽  
pp. 313-325 ◽  
Author(s):  
G. Cabodi ◽  
P. E. Camurati ◽  
C. Loiacono ◽  
M. Palena ◽  
P. Pasini ◽  
...  
Keyword(s):  
Model Checking ◽  
Divide And Conquer ◽  
Task Sharing

scholarly journals Formal Modeling, Proving, and Model Checking of a Flood Warning, Monitoring, and Rescue System-of-Systems

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Abdul Rehman ◽  
Nadeem Akhtar ◽  
Omar H. Alhazmi
Keyword(s):  
Model Checking ◽  
Formal Model ◽  
Economic Losses ◽  
Formal Modeling ◽  
Intensity Level ◽  
Flood Warning ◽  
Liveness Properties ◽  
Snake Bites ◽  
Flood Monitoring ◽  
Flood Intensity

Floods after monsoon rains are frequent disasters that affect millions of lives in Pakistan. Human lives are lost, agriculture economies are destroyed, and livestock animals, houses, fruit farms, and crops are lost which are the major livelihoods of thousands of people in Punjab. Each year there are heavy rains in the monsoon season and, due to global warming, there is the rapid melting of snow in northern glaciers; these factors subsequently cause floods. There is also loss of life due to the spread of waterborne diseases and snake bites. Flood monitoring provides early detection of a flood and the calculation of its intensity, which results in reduced human life losses and economic losses. Most casualties are caused by the lack of timely real-time, authentic information about the high-risk areas, and flood intensity, speed, and direction. Therefore, the proposed approach is centered on formal modeling and verification of safety and liveness properties of flood monitoring perceivers. Each flood perceiver has several sensors. It requires the collection of information starting from the flood perceiver, observer, and environmental forecast. This information is processed to determine the flood intensity level. We have developed a CP-Nets’ formal model and model-checked it. We have verified the safety and liveness properties of correctness by exhaustive verification of the system using model-based proof obligations (Event-B method using Rodin). Our objective in this research is to propose a correct, reliable, and efficient flood warning, monitoring, and rescue (WMR) SoS based on formal methods. We have used formal modeling and model-checking based on state-of-the-art hierarchical CP-Nets supported by exhaustive formal proof obligations of Event-B.

scholarly journals Model Checking $$\omega $$-Regular Properties with Decoupled Search

2021 ◽  
pp. 411-434
Author(s):  
Daniel Gnad ◽  
Jan Eisenhut ◽  
Alberto Lluch Lafuente ◽  
Jörg Hoffmann
Keyword(s):  
Model Checking ◽  
State Space ◽  
Partial Order ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
Ai Planning ◽  
Symbolic Representations ◽  
State Space Search ◽  
Liveness Properties ◽  
Reduction Methods

AbstractDecoupled search is a state space search method originally introduced in AI Planning. Similar to partial-order reduction methods, decoupled search exploits the independence of components to tackle the state explosion problem. Similar to symbolic representations, it does not construct the explicit state space, but sets of states are represented in a compact manner, exploiting component independence. Given the success of both partial-order reduction and symbolic representations when model checking liveness properties, our goal is to add decoupled search to the toolset of liveness checking methods. Specifically, we show how decoupled search can be applied to liveness verification for composed Büchi automata by adapting, and showing correct, a standard algorithm for detecting lassos (i.e., infinite accepting runs), namely nested depth-first search. We evaluate our approach using a prototype implementation.

scholarly journals Predicate Abstraction for Dense Real-Time Systems

2001 ◽  
Vol 8 (44) ◽  
Author(s):  
M. Oliver Möller ◽  
Harald Ruess ◽  
Maria Sorea
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Timed Automata ◽  
Finite Sequence ◽  
Finite Basis ◽  
Predicate Abstraction ◽  
Real Time Systems ◽  
Liveness Properties ◽  
Small Set ◽  
Time Systems

We propose predicate abstraction as a means for verifying a rich class of safety and liveness properties for dense real-time systems. First, we define a restricted semantics of timed systems which is observationally equivalent to the standard semantics in that it validates the same set of mu-calculus formulas without a next-step operator. Then, we recast the model checking problem S |= phi for a timed automaton S and a mu-calculus formula phi in terms of predicate abstraction. Whenever a set of abstraction predicates forms a so-called <em>basis</em>, the resulting abstraction is strongly preserving in the sense that S validates phi iff the corresponding finite abstraction validates this formula phi. Now, the abstracted system can be checked using familiar mu-calculus model checking.<br /> <br />Like the region graph construction for timed automata, the predicate abstraction algorithm for timed automata usually is prohibitively expensive. In many cases it suffices to compute an approximation of a finite bisimulation by using only a subset of the basis of abstraction predicates. Starting with some coarse abstraction, we define a finite sequence of refined abstractions that converges to a strongly preserving abstraction. In each step, new abstraction predicates are selected nondeterministically from a finite basis. Counterexamples from failed mu-calculus model checking attempts can be used to heuristically choose a small set of new abstraction predicates for refining the abstraction.

Sign in / Sign up

Export Citation Format

Share Document