## Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System (2000)

### Cached

### Download Links

- [www.aladdin.cs.cmu.edu]
- [araxa.lecom.dcc.ufmg.br]
- [www.cs.technion.ac.il]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the Eighth International Conference on Computer Aided Verification CAV, volume 1102 of Lecture Notes in Computer Science |

Citations: | 17 - 5 self |

### BibTeX

@INPROCEEDINGS{Campos00selectivequantitative,

author = {Sergio Campos and Edmund M. Clarke and Orna Grumberg},

title = {Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System},

booktitle = {Proceedings of the Eighth International Conference on Computer Aided Verification CAV, volume 1102 of Lecture Notes in Computer Science},

year = {2000},

pages = {257--268},

publisher = {Springer Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this work we propose a verification methodology consisting of selective quantitative analysis and interval model checking. Our methods can aid not only in determining if a system works correctly, but also in understanding how well the system works.

### Citations

3268 | Scheduling algorithms for multiprogramming in a hard-real-time environment
- Liu, Layland
- 1973
(Show Context)
Citation Context ...oposed method. In [14] quantitative analysis is implemented, but with a more limited scope. Analytical methods for analyzing real-time systems also exist, such as the rate-monotonic scheduling theory =-=[22, 19, 26]-=-. In this method a real-time system is characterized by a set of periodic tasks, each having a period and an execution time. Assumptions about system behavior are made (such as no task preempts itself... |

3180 | Graph-based algorithms for boolean function manipulation
- Bryant
- 1986
(Show Context)
Citation Context ...al circuits, and have been successfully verified using techniques such as the one proposed [10, 9, 8]. Another advantage of this approach is that it is amenable to symbolic implementations using bdds =-=[5]-=-. This makes it possible to verify systems with extremely large state spaces, allowing realistic and interesting problems to be handled. Moreover, the fact that properties are verified over finite int... |

1255 | Automatic verification of finite-state concurrent systems using temporal logic specifications
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...tisfiability and did not handle either quantitative analysis or interval model checking. The closest method to our selection of paths or intervals is the use of fairness constraints in model checking =-=[13, 24, 15]-=-. However, there a fairly restricted types of properties were used for selection, while we can handle any LTL formula. Moreover, only infinite paths can be selected in these works. A Distributed Real-... |

626 | An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986 |

550 |
Symbolic Model Checking: An Approach to the State Explosion Problem
- McMillan
- 1992
(Show Context)
Citation Context ...tisfiability and did not handle either quantitative analysis or interval model checking. The closest method to our selection of paths or intervals is the use of fairness constraints in model checking =-=[13, 24, 15]-=-. However, there a fairly restricted types of properties were used for selection, while we can handle any LTL formula. Moreover, only infinite paths can be selected in these works. A Distributed Real-... |

443 |
D.,: “Automata for modeling real-time systems
- Alur, Dill
- 1990
(Show Context)
Citation Context ... the system works, but also in understanding how well the system works. Related Methods: There are several other approaches to the verification of timed systems. For example, dense time is modeled by =-=[1, 2, 25, 17]-=-. Those methods provide a very accurate notion of passage of time. However, the state space of dense time models is infinite, and these verification tools rely on the construction of a finite quotient... |

384 |
Model checking for real-timed systems
- Alur, Courcoubetis, et al.
- 1990
(Show Context)
Citation Context ... the system works, but also in understanding how well the system works. Related Methods: There are several other approaches to the verification of timed systems. For example, dense time is modeled by =-=[1, 2, 25, 17]-=-. Those methods provide a very accurate notion of passage of time. However, the state space of dense time models is infinite, and these verification tools rely on the construction of a finite quotient... |

326 | Symbolic Model Checking: 10 States and Beyond - Burch, Clarke, et al. - 1992 |

249 | Checking that finite state concurrent programs satisfy their linear specification
- Lichtenstein
- 1985
(Show Context)
Citation Context ...aths and over finite intervals. To strengthen our verification methodology, we combine the selective quantitative analysis with model checking techniques. Traditionally, LTL model checking procedures =-=[20, 11]-=- accept a structure that models the system, a set of designated states, and an LTL formula. The procedures determine whether the formula holds on all infinite paths of the structure that start from so... |

205 |
Synthesis of synchronization skeletons for branching time temporal logic
- Clarke, Emerson
- 1981
(Show Context)
Citation Context ...e next section are based on the tableau, as described in the previous section, and in addition on two verification techniques: CTL model checking and quantitative analysis. 3.1 CTL Model Checking CTL =-=[4, 12] is a branch-=-ing-time temporal logic that is similar to LTL except that each temporal operator is preceded by a path quantifier – either� standing for “there exists a path” or� standing for “for all pa... |

177 |
The temporal logic of branching time
- Ben-Ari, Manna, et al.
- 1983
(Show Context)
Citation Context ...e next section are based on the tableau, as described in the previous section, and in addition on two verification techniques: CTL model checking and quantitative analysis. 3.1 CTL Model Checking CTL =-=[4, 12] is a branch-=-ing-time temporal logic that is similar to LTL except that each temporal operator is preceded by a path quantifier – either� standing for “there exists a path” or� standing for “for all pa... |

157 | The Temporal Semantics of Concurrent Programs - Pnueli - 1981 |

144 |
The glory of the past
- Lichtenstein, Pnueli, et al.
- 1985
(Show Context)
Citation Context ...rs can be analyzed in isolation, not allowing as rich an analysis as the proposed method. Linear-time temporal logics interpreted over both infinite paths and finite intervals have been introduced in =-=[21, 23]-=-. However, they use tableau only for satisfiability and did not handle either quantitative analysis or interval model checking. The closest method to our selection of paths or intervals is the use of ... |

116 | Another look at LTL model checking
- Clarke, Grumberg, et al.
- 1997
(Show Context)
Citation Context ...aths and over finite intervals. To strengthen our verification methodology, we combine the selective quantitative analysis with model checking techniques. Traditionally, LTL model checking procedures =-=[20, 11]-=- accept a structure that models the system, a set of designated states, and an LTL formula. The procedures determine whether the formula holds on all infinite paths of the structure that start from so... |

114 | HyTech: The next generation
- Henzinger, Ho, et al.
- 1995
(Show Context)
Citation Context ... the system works, but also in understanding how well the system works. Related Methods: There are several other approaches to the verification of timed systems. For example, dense time is modeled by =-=[1, 2, 25, 17]-=-. Those methods provide a very accurate notion of passage of time. However, the state space of dense time models is infinite, and these verification tools rely on the construction of a finite quotient... |

112 |
Generalized rate monotonic scheduling theory: A framework for developing real-time systems
- Sha, Rajkumar, et al.
- 1994
(Show Context)
Citation Context ...works. A Distributed Real-Time System: To demonstrate the usefulness of our method, we have applied it to a distributed real-time system of realistic complexity, derived from the example described in =-=[27]-=-. Real-time systems are used in many critical applications such as aircraft control or medical monitoring systems. Because of the consequences of failures in such systems, determining their correctnes... |

95 |
Symbolic model checking
- Clarke, McMillan, et al.
- 1996
(Show Context)
Citation Context ...od. Currently the system is specified in the SMV language [24]. The structure is represented symbolically using BDDs. It is then traversed using algorithms based on symbolic model checking techniques =-=[6]-=-. All computations are performed on states reachable from a predefined set of initial states. We also assume that the transition relation is total. This requirement is not necessary for the minimum al... |

82 | From atp to timed graphs and hybrid systems - Nicollin, Sifakis, et al. - 1993 |

70 |
Modalities for model checking: Branching time strikes back
- Emerson, Lei
- 1985
(Show Context)
Citation Context ...tisfiability and did not handle either quantitative analysis or interval model checking. The closest method to our selection of paths or intervals is the use of fairness constraints in model checking =-=[13, 24, 15]-=-. However, there a fairly restricted types of properties were used for selection, while we can handle any LTL formula. Moreover, only infinite paths can be selected in these works. A Distributed Real-... |

63 | Two examples of verification of multirate timed automata with KRONOS - Daws, Yovine - 1995 |

56 |
Rate Monotonic Analysis for Real-Time Systems
- Sha, Klein, et al.
- 1993
(Show Context)
Citation Context ...oposed method. In [14] quantitative analysis is implemented, but with a more limited scope. Analytical methods for analyzing real-time systems also exist, such as the rate-monotonic scheduling theory =-=[22, 19, 26]-=-. In this method a real-time system is characterized by a set of periodic tasks, each having a period and an execution time. Assumptions about system behavior are made (such as no task preempts itself... |

53 | The anchored version of the temporal framework
- Manna, Pnueli
- 1989
(Show Context)
Citation Context ...rs can be analyzed in isolation, not allowing as rich an analysis as the proposed method. Linear-time temporal logics interpreted over both infinite paths and finite intervals have been introduced in =-=[21, 23]-=-. However, they use tableau only for satisfiability and did not handle either quantitative analysis or interval model checking. The closest method to our selection of paths or intervals is the use of ... |

44 |
ªMT: A Toolset for Specifying and Analyzing Real-time Systems,º
- Clements, Heitmeyer, et al.
- 1993
(Show Context)
Citation Context ...y other tools such as [16, 28]. The tool described in [28] also uses symbolic algorithms using BDDs. These tools, however, do not allow the quantitative analysis of systems as the proposed method. In =-=[14]-=- quantitative analysis is implemented, but with a more limited scope. Analytical methods for analyzing real-time systems also exist, such as the rate-monotonic scheduling theory [22, 19, 26]. In this ... |

40 | Computing quantitative characteristics of finite-state real-time systems
- Campos, Clarke, et al.
- 1994
(Show Context)
Citation Context ... suggested methodology consists of selective quantitative analysis and interval model checking and it is based on two concepts – quantitative analysis, and tableaux for linear-time temporal logic. I=-=n [10]-=- it has been proposed how quantitative symbolic algorithms can be used to analyze the model of a system. The technique suggested there computes minimum and maximum delays between the occurrence of two... |

29 | Verus: a tool for quantitative analysis of finite-state real-time systems
- Campos, Clarke, et al.
- 1995
(Show Context)
Citation Context ... predictability. In fact, several real-time systems we have analyzed are even more synchronous than traditional circuits, and have been successfully verified using techniques such as the one proposed =-=[10, 9, 8]-=-. Another advantage of this approach is that it is amenable to symbolic implementations using bdds [5]. This makes it possible to verify systems with extremely large state spaces, allowing realistic a... |

29 |
Fixed Priority Scheduling Theory for Hard Real-Time Systems
- Lehoczky, Sha, et al.
- 1991
(Show Context)
Citation Context ...oposed method. In [14] quantitative analysis is implemented, but with a more limited scope. Analytical methods for analyzing real-time systems also exist, such as the rate-monotonic scheduling theory =-=[22, 19, 26]-=-. In this method a real-time system is characterized by a set of periodic tasks, each having a period and an execution time. Assumptions about system behavior are made (such as no task preempts itself... |

20 | Verifying the performance of the PCI local bus using symbolic techniques
- Campos, Clarke, et al.
- 1996
(Show Context)
Citation Context ...e every state ��� � � in is the beginning of some infinite (fair) path. We have applied this method in the analysis of the PCI Local Bus to show how it can be used in the verification of rea=-=l systems [7]-=-. In this example we have computed the minimum and maximum transaction times in the PCI bus for several different configurations. One of the most important characteristics of the PCI bus is the abilit... |

20 | A Quantitative Approach to the Formal Verification of RealTime Systems - Campos - 1996 |

17 |
RTSL: A language for real-time schedulability analysis
- Fredette, Cleaveland
- 1993
(Show Context)
Citation Context ...struction of a finite quotient structure called region graph. This construction is extremely expensive, limiting the size of problems that can be handled. Discrete time is used by other tools such as =-=[16, 28]-=-. The tool described in [28] also uses symbolic algorithms using BDDs. These tools, however, do not allow the quantitative analysis of systems as the proposed method. In [14] quantitative analysis is ... |

15 | Symbolic model checking for event-driven real-time systems
- Yang, Mok, et al.
- 1997
(Show Context)
Citation Context ...struction of a finite quotient structure called region graph. This construction is extremely expensive, limiting the size of problems that can be handled. Discrete time is used by other tools such as =-=[16, 28]-=-. The tool described in [28] also uses symbolic algorithms using BDDs. These tools, however, do not allow the quantitative analysis of systems as the proposed method. In [14] quantitative analysis is ... |

15 | Really Visual Temporal Reasoning - Ramakrishna, Melliar-Smith, et al. - 1993 |

12 | Chemical Process Safety and Operability Analysis using Symbolic Model Checking - Probst - 1996 |

11 | Chin-Laung Lei: “Modalities for Model Checking: Branching Time Strikes Back - Emerson - 1987 |

11 | F.: Verification of a safety-critical railway interlocking system with real-time constraints - Hartonas-Garmhausen, Campos, et al. - 2000 |

8 | Timing analysis of industrial real-time systems
- Campos, Clarke, et al.
- 1995
(Show Context)
Citation Context ... predictability. In fact, several real-time systems we have analyzed are even more synchronous than traditional circuits, and have been successfully verified using techniques such as the one proposed =-=[10, 9, 8]-=-. Another advantage of this approach is that it is amenable to symbolic implementations using bdds [5]. This makes it possible to verify systems with extremely large state spaces, allowing realistic a... |

7 | Timing behavior analysis for real-time systems - Wang - 1995 |

3 | Z316.5-94, American National Standards Institute CCOHS. Website: www.CCOHS.ca Concordia University, Laboratory Safety Manual, Radiation Safety, Laser Safety - standard - 1994 |

1 |
FDDI Token Ring Media Access Control
- Std
- 1986
(Show Context)
Citation Context ...ocessor connected to this network and one of the processors in the multiprocessor, the control processor. The FDDI network is a 100Mb/s local/metropolitan area network that uses a token ring topology =-=[3]-=-. It has gained popularity recently, particularly in real-time applications, since it allows communication time to be bounded. There are several stations connected to the network in the system. They g... |

1 |
Board and American NationalStandards Institute. IEEE Standard Backplane Bus Specification for Multiprocessor Architectures: Futurebus+, ansi/ieee std 896.1 edition
- Standard
- 1990
(Show Context)
Citation Context ...e only the behavior of video and audio. Therefore all the remaining traffic in the network has been grouped together). In the multiprocessor, four active processors are connected through a Futurebus+ =-=[18]. The first is the network interface, it receives da-=-ta from the network and sends it to the control processor. The network interface uses the bus 9s� � � � � � � � � � � � � � � � � � � � � � � � � � ... |