Orna Kupferman, Moshe Y. Vardi, Pierre Wolper  Home/Search
Context Related
| rice.edu/~vardi/papers...cav96rj1.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its environment and whose behavior depends on this interaction. The ability of temporal logics to describe an ongoing interaction of a reactive program with its environment makes them particularly appropriate for the specification of open systems. Nevertheless, model-checking... (Update)
Cited by: More
Verification of Open Systems - Orna Kupferman Hebrew (Correct)
Timed Games With Branching-Time Winning Conditions - Aniello Murano Dipartimento (Correct)
Automata-theoretic Decision of Timed Games - Marco Faella Salvatore (2002) (Correct)
Similar documents (at the sentence level):
46.6%: Module Checking - Kupferman, Vardi (1996) (Correct)
10.5%: Linear vs. Branching Time: A Complexity-Theoretic Perspective - Vardi (1998) (Correct)
5.1%: Branching vs. Linear Time: Final Showdown - Vardi (2001) (Correct)
Active bibliography (related documents): More All
0.4: Robust Satisfaction - Kupferman, Vardi (1999) (Correct)
0.4: Module Checking Revisited - Kupferman, Vardi (1997) (Correct)
0.3: Relating Linear and Branching Model Checking - Kupferman, Vardi (1996) (Correct)
Similar documents based on text: More All
0.6: Constructing Automata from Temporal Logic Formulas: A Tutorial - Wolper (Correct)
0.4: Open Systems in Reactive Environments: Control and.. - Kupferman, Madhusudan, .. (2000) (Correct)
0.4: Constraint-Generating Dependencies - Baudinet, Chomicki, Wolper (1995) (Correct)
Related documents from co-citation: More All
16: the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
14: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic S.. (context) - Clarke, Emerson et al. - 1986
14: The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
BibTeX entry: (Update)
O. Kupferman and M.Y. Vardi. Module checking. In Proc. 8th CAV, LNCS 1102, pp. 75--86, August 1996. http://citeseer.ist.psu.edu/kupferman98module.html More
@inproceedings{ kupferman96module,
author = "{O. Kupferman} and {M. Y. Vardi}",
title = "Module Checking",
booktitle = "Proceedings of the Eighth International Conference on Computer Aided Verification {CAV}",
volume = "1102",
month = "/",
publisher = "Springer Verlag",
address = "New Brunswick, NJ, USA",
editor = "{Rajeev Alur} and {Thomas A. Henzinger}",
pages = "75--86",
year = "1996",
url = "citeseer.ist.psu.edu/kupferman98module.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
2732 Communicating Sequential Processes (context) - Hoare - 1985
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
650 An axiomatic basis of computer programming (context) - Hoare - 1969
603 Kluwer Academic Publishers (context) - McMillan, checking - 1993
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
397 Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
241 Decidability of second order theories and automata on infini.. (context) - Rabin - 1969
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
223 Assigning meaning to programs (context) - Floyd - 1967
222 The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
221 Specification and verification of concurrent systems in Cesa.. (context) - Queille, Sifakis - 1981
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
194 the development of reactive systems (context) - Harel, Pnueli - 1985
165 Theoretical Computer Science (context) - Kozen, the et al. - 1983
162 Automata-theoretic techniques for modal logics of programs (context) - Vardi, Wolper - 1986
139 Reasoning about infinite computations - Vardi, Wolper - 1994
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
127 An automata-theoretic approach to branchingtime model checki.. - Bernholtz, Vardi et al. - 1994
120 Handbook of theoretical computer science (context) - Emerson, modal - 1990
119 Alternating-time temporal logic - Alur, Henzinger et al. - 1997
110 the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
106 A linear-time model-checking algorithm for the alternation-f.. - Cleaveland - 1993
106 An algebraic definition of simulation between programs (context) - Milner - 1971
102 Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1993
90 Characterizing finite Kripke structures in propositional tem.. (context) - Browne, Clarke et al. - 1988
53 Sometimes and not never revisited: On branching versus linea.. (context) - Emerson, Halpern - 1986
52 A modal process logic (context) - Larsen, Thomsen - 1988
46 Modal specifications (context) - Larsen - 1989
42 on Programming Languages and Systems (context) - Grumberg, Long et al. - 1994
40 Improved upper and lower bounds for modal logics of programs (context) - Vardi, Stockmeyer - 1985
39 Methodology and system for practical formal verification of .. - Beer, Ben-David et al. - 1994
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980
33 The monotone and planar circuit value problems are log space.. (context) - Goldschlager - 1977
31 the synthesis of an asynchronous reactive module (context) - Pnueli, Rosner - 1989
28 A near-optimal method for reasoning about action (context) - Pratt - 1980
26 Realizable and unrealizable concurrent program specification.. (context) - Abadi, Lamport et al. - 1989
26 the complexity of branching modular model checking (context) - Kupferman, Vardi - 1995
25 Temporal model checking under generalized fairness constrain.. (context) - Emerson, Lei - 1985
25 Deciding branching time logic (context) - Emerson, Sistla - 1984
19 get one free (context) - Kupferman, Grumberg - 1996
19 Formula-dependent equivalence for compositional CTL model ch.. - Aziz, Shiple et al. - 1994
16 abstraction and compositional verification (context) - Long - 1993
14 the complexity of modular model checking - Vardi - 1995
12 Reasoning about uncertainty in fault-tolerant distributed sy.. (context) - Fischer, Zuck - 1988
10 Augmenting branching temporal logics with existential quanti.. (context) - Kupferman - 1997
9 Temporal specification and verification of reactive modules - Manna, Pnueli - 1992
6 Synthesis and verification of discrete controllers for robot.. (context) - Antoniotti - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (Correct)
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