Moshe Y. Vardi  Home/Search
Context Related
Links: ACM DBLP | rice.edu/~vardi/papers/fst97.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,... (Update)
Context of citations to this paper: More
...but is only unaware of what is currently happening at other locations. This is also different from what is termed modular reasoning ([12]) where processes operate in environments about which nothing can be assumed at all. This is necessary in the verification of open...
Cited by: More
A Presentation of Regular Languages in the.. - Mohalik, Ramanujam (Correct)
Similar documents (at the sentence level): More
44.5%: Module Checking Revisited - Kupferman, Vardi (1997) (Correct)
15.4%: Module Checking - Kupferman, Vardi (1996) (Correct)
6.8%: Robust Satisfaction - Kupferman, Vardi (1999) (Correct)
Active bibliography (related documents): More All
0.4: Relating Linear and Branching Model Checking - Kupferman, Vardi (1996) (Correct)
0.4: Linear vs. Branching Time: A Complexity-Theoretic Perspective - Vardi (1998) (Correct)
0.3: Sometimes and Not Never Re-revisited: On Branching Versus Linear.. - Vardi (1998) (Correct)
Similar documents based on text: More All
0.2: Infinitary Logic and Inductive Definability over Finite.. - Dawar, Lindell (1995) (Correct)
0.2: Vacuity Detection in Temporal Model Checking - Kupferman, Vardi (1999) (Correct)
0.1: Weak Alternating Automata Are Not That Weak - Kupferman, Vardi (1997) (Correct)
BibTeX entry: (Update)
Vardi, M., "Verification of open systems", Proc FST & TCS 17, LNCS 1346, 1997, 250-266. http://citeseer.ist.psu.edu/vardi97verification.html More
@article{ vardi97verification,
author = "Moshe Y. Vardi",
title = "Verification of Open Systems",
journal = "Lecture Notes in Computer Science",
volume = "1346",
pages = "250--??",
year = "1997",
url = "citeseer.ist.psu.edu/vardi97verification.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986 ACM DBLP
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
603 Kluwer Academic Publishers (context) - McMillan, checking - 1993
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
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985 ACM DBLP
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 ACM DBLP
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979 DBLP
194 the development of reactive systems (context) - Harel, Pnueli - 1985
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988 ACM DBLP
127 An automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994 ACM DBLP
114 The temporal semantics of concurrent programs (context) - Pnueli - 1981 ACM DBLP
110 the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
106 An algebraic definition of simulation between programs (context) - Milner - 1971 ACM DBLP
102 Verification tools for finite-state concurrent systems - Clarke, Grumberg et al. - 1993 ACM DBLP
75 Modalities for model checking: Branching time logic strikes .. (context) - Emerson, Lei - 1985 DBLP
66 Reasoning about networks with many identical finite-state pr.. (context) - Clarke, Grumberg et al. - 1986 ACM DBLP
58 Alternating automata on infinite trees (context) - Muller, Schupp - 1987 ACM DBLP
53 Sometimes and not never revisited: On branching versus linea.. (context) - Emerson, Halpern - 1986
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 ACM
39 Weak alternating automata are not that weak - Kupferman, Vardi - 1997 ACM DBLP
39 Methodology and system for practical formal verification of .. - Beer, Ben-David et al. - 1994 ACM DBLP
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980 ACM DBLP
37 Module checking - andM, Vardi - 1996 ACM DBLP
33 The monotone and planar circuit value problems are log space.. (context) - Goldschlager - 1977 ACM
28 A near-optimal method for reasoning about action (context) - Pratt - 1980 DBLP
26 the complexity of branching modular model checking (context) - Kupferman, Vardi - 1995
25 and temporal logics (context) - Emerson, tableaux - 1985
25 Deciding branching time logic (context) - Emerson, Sistla - 1984 ACM DBLP
23 Formal Methods in System Design (context) - Clarke, Grumberg et al. - 1995
19 get one free (context) - Kupferman, Grumberg - 1996
17 Module checking revisited - Kupferman, Vardi - 1997
17 The complexity of two-player games of incomplete information (context) - Reif - 1984 DBLP
14 the complexity of modular model checking - Vardi - 1995
12 Reasoning about uncertainty in fault-tolerant distributed sy.. (context) - Fischer, Zuck - 1988 ACM DBLP
9 Temporal specification and verification of reactive modules - Manna, Pnueli - 1992
4 Simulating aternating tree automata by nondeterministic auto.. (context) - Muller, Schupp - 1995
3 Automata-theoretic techniquesfor modal logics of programs (context) - andP - 1986
1 submitted for publication (context) - Kupferman, Vardi et al. - 1997
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