E. M. Clarke, O. Grumberg, and D. E. Long. Model Checking. Nato ASI Series F, 152, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Behavior of Interacting Agents - Dekhtyar, Dikovsky, Valiev (2002) (Correct)
....description languages. The MA BEHAVIOR problem we consider in this paper, consists in verifying that a temporal logic formula holds on the tree of trajectories of a given MA system. So it is a model checking type problem. Model checking has been extensively studied since the early 80ies (see [8, 36, 28, 40, 43, 41, 10, 16, 17, 9]) We use some of these well known results in order to establish some upper complexity bounds. There is however a substantial difference between the classical problem statement and that of this paper. Traditionally, the complexity results are established for explicitly presented transition ....
Clarke, E. M., Grumberg, O. and Long, D., Model Checking, NATO ASI series F, v. 152, 1996.
Model Checking for the Concurrent Constraint Paradigm - Garcia Self-citation (Long) (Correct)
....Figure 5.5 9 The speci cation of the property In this chapter we describe in detail the second phase of our model checking approach. Once we have a model that represents the system behavior, we have to specify the property that we want to verify. In many classical approaches (see [CES86, McM93, CGL96] di erent temporal logic formalisms are used for such purpose. Some of the most popular logics used for model checking are CTL, CTL or LTL. First to introduce the logic used in our approach, we describe brie y the di erent logics used in the literature and its characteristics in order to ....
....logics, it is possible to de ne other logic operators such as the always or eventually operators from the basic ones. For example, if we want to express that a formula is satis ed at some point in the future, we write that The reader can nd the formal de nitions of state formula in [CGL96, CGP99] true U . To express that a formula is always satis ed, we can write that ( true U : Moreover, as usually we denote with the formula : We de ne a reaction as a pair of constraints of the form hc; di where c represents the input provided by the ....
E. M. Clarke, O. Grumberg, and D. E. Long. Model Checking. Nato ASI Series F, 152, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC