C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory e#cient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275--288, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dividing and Conquering the Layered Land - Franceschet (Correct)
.... and Rabin tree automata (a survey is [114] have been proved very useful in order to provide clean and asymptotically optimal satisfiability and model checking algorithms for temporal logics [79, 118] as well as to cope with the state explosion problem that frighten concurrent system verification [24, 73, 117]. Moreover, automata themselves can be directly used as a specification formalism, provided with a natural graphical interpretation [87] A granular reactive systems is a reactive system whose components have dynamic behaviours regulated by very di#erent time constants. As an example, consider a ....
....linear temporal logic, we can replace Buchi automata by Muller automata. Third, the specification automaton # can be used to cope with the state explosion problem by preventing the complete construction of the system automaton P from happening, whenever possible (on the fly model checking) [24, 73, 117]. More precisely, some system states, which are incompatible with or irrelevant to the specification, may not be generated at all; furthermore, a counterexample for #A # can be detected before the completion of P construction, making such a completion no more necessary. Finally, the ....
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory e#cient algorithms for the verification of temporal properties. In Edmund M. Clarke and Robert P. Kurshan, editors, Proceedings of Computer-Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 233--242, Berlin, Germany, 1991. Springer.
Towards an automata-theoretic counterpart Of Combined.. - Franceschet, Montanari (2001) (Correct)
....linear temporal logic, we can replace Buchi automata by Muller automata. Third, the specification automaton # can be used to cope with the state explosion problem by preventing the complete construction of the system automaton from happening, whenever possible (on the fly model checking) [5, 23, 36]. More precisely, some system states, which are incompatible with or irrelevant to the specification, may not be generated at all; furthermore, a counterexample for AP # A # can be detected before the completion of construction, making such a completion no more necessary. Finally, the ....
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory e#cient algorithms for the verification of temporal properties. In Edmund M. Clarke and Robert P. Kurshan, editors, Proceedings of Computer-Aided Verification (CAV '90), volume 531 of LNCS, pages 233--242, Berlin, Germany, 1991. Springer.
LTL Model Checking for Systems with Unbounded Number of.. - Yahav, Reps, Sagiv (2001) (1 citation) (Correct)
....DDFS 2 , which corresponds to model checking with no abstraction. SPIN only uses 2 valued propositional logic (the edge labeled BA# stands for the step in which S P 2 is combined with the automaton that represents the negation of the property of interest) SPIN uses the double DFS algorithm [25, 14] for state space exploration. Previous work by the first author [39] corresponds to the path S FO 2 # S FO 3 , where the resulting model is later explored for configurations violating a specified safety property. In this paper, we concentrate on the following aspects of Figure 1: ....
....2 Preliminaries Verification using Linear Temporal Logic Verification of an LTL property consists of verifying that all of the infinite execution sequences of a program satisfy the property formula. It is common to use automata based verification techniques to verify LTL properties [24, 14, 37]. Automata based verification represents the verified system and the desired LTL property using Buchi automata. A Buchi automaton is a five tuple A = # # , S, # s , S 0 , F #, where # is the finite alphabet of the automaton, S is the finite set of states, # s # S # S is the ....
[Article contains additional citation context not shown here]
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory e#cient algorithms for the verification of temporal properties. In Proc. of Computer-Aided Verification (CAV '90), volume 531 of LNCS, pages 233--242, Berlin, Germany, June 1991. Springer.
Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) Self-citation (Vardi) (Correct)
No context found.
C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory e#cient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275--288, 1992.
Conversation Protocols: A Formalism for Specification and.. - Fu, Bultan, Su (2004) (1 citation) (Correct)
No context found.
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-e#cient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275 -- 288, 1992.
LTL Model Checking for Modular Petri Nets - Latvala, Mäkelä (2004) (Correct)
No context found.
Courcoubetis, C., Vardi, M., Wolper, P., Yannakakis, M.: Memory e#cient algorithms for the verification of temporal properties. Formal Methods in System Design 1 (1992) 275--288
Using Fairness to Make Abstractions Work - Bosnacki, Ioustinova, Sidorova (2004) (Correct)
No context found.
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory e#cient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275--288, 1992.
Distribution of Explicit-State LTL Model-Checking - Brim, Barnat (2003) (Correct)
No context found.
Courcoubetis, C., M. Vardi, P. Wolper and M. Yannakakis, Memory-E#cient Algorithms for the Verification of Temporal Properties, Formal Methods in System Design 1 (1992), pp. 275--288.
Verification of the WAP Transaction Layer - Using The Model (Correct)
No context found.
C. Courcoubetis, M. Vardi, P. Wolper and M. Yannakakis. Memory-e#cient algorithms for the verification of temporal properties. In Formal methods in system design, Volume 1, pp. 275--288, 1992.
Minimization of counterexamples in SPIN - Paul Gastin Pierre (2004) (3 citations) (Correct)
No context found.
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory e#cient algorithms for the verification of temporal properties. In Computer-aided verification '90 (New Brunswick, NJ, 1990), volume 3 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 207--218. Amer. Math. Soc., Providence, RI, 1991.
Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2002) (3 citations) (Correct)
No context found.
C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis. Memory-e#cient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275--288, 1992.
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