M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, April 1986. 22  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Decidability of Class-Based Knowledge Representation Formalisms - De Giacomo (1995) (11 citations) (Correct)
....deterministic, i.e. it leads to at most one state. It is easy to see that this possibility allows one to impose the so called global determinism too, i.e. that all runs of a given atomic program or the converse of an atomic program, are deterministic. Therefore, DIF subsumes the logic studied in [131], called Converse Deterministic PDL, where atomic programs, not their converse, are (globally) deterministic. 3.2 Reasoning in CIF and DIF The decidability and complexity of both satisfiability of CIF concepts and logical implication in CIF TBoxes can be derived immediately by exploiting the ....
....since DIF subsumes Converse Deterministic PDL, also formulae of that logic can be encoded in DI. This fact gives us an optimal procedure to decide the satisfiability of Converse Deterministic PDL formulae that does not rely on techniques based on automata on infinite structures as those in [129, 131]. Observe also that the mapping fl can be easily restricted to encode Deterministic PDL formulae in PDL. Though, in this simpler case there is no need of a sophisticated technique, as the one above, to build a model of a Deterministic PDL formula from its PDL counterpart, a standard filtration ....
[Article contains additional citation context not shown here]
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183--221, 1986.
Decidability of Class-Based Knowledge Representation Formalisms - De Giacomo (1995) (11 citations) (Correct)
....study both the expressive power and the computational complexity of subsumption and satisfiability for TBoxes expressed in ALC (no fixpoint constructs) that allow for mutually recursive definitions. To this end, a concept language is defined that corresponds to a variant of the modal mu calculus ([130]) in which mutual fixpoints are allowed but some restrictions on nested fixpoints are enforced. It is well known that mutual fixpoints can be re expressed by means of nested ones (see, for example, 33, 109] As a consequence of this observation it follows that both logics introduced in this ....
M. Y. Vardi and P. Wolper. Automata theoretic techniques for modal logics of programs. In Proceedings of the 16th Annual Symposium on the Foundations of Computer Science, pages 446--456, 1984.
2ATAs make DLs easy - Calvanese, De Giacomo, Lenzerini (2002) (2 citations) (Correct)
....R ) C 2 CLF (C 0 ) then 9R.9R if 9R .C 2 CLF (C 0 ) then 9R.9R if 9id(C) C 2 CLF (C 0 ) then C 2 CLF (C 0 ) if 9Q.C 2 CLF (C 0 ) then Q; Q ; Q; Q 2 CLF (C 0 ) The cardinality of CLF (C 0 ) is linear in the length of C 0 . It can be shown, following the lines of the proof in [15] for converse deterministic PDL, that ALCFI reg enjoys the tree model property, i.e. every satis able concept has a model that has the structure of a (possibly in nite) tree with branching degree linearly bounded by the size of the concept. More precisely, we have the following result. Theorem ....
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Sciences, 32:183-221, 1986. A preliminary version appeared in Proc. of the 16th ACM SIGACT Symp. on Theory of Computing (STOC'84). 12
Weak Muller Acceptance Conditions for Tree Automata - Torre, Murano, Napoli (2002) (Correct)
....of project Metodi Formali per la Sicurezza (MEFISTO) Automata on in nite words and trees turned out to be very useful for those areas of computer science where nonterminating computations are studied. They give a unifying paradigm to specify, verify, and synthesize nonterminating systems [7, 15, 16]. A system speci cation can be translated to an automaton, and thus, questions about systems and their speci cations are reduced to decision problems in the automata theory. For example, the satis ability of a speci cation and the correctness of a system with respect to its speci cation can ....
....complementation. MTA is closed under intersection, union, and complementation. In the following remark, we recall some known results on the decision problems of B uchi and Rabin tree automata. Remark 2. The emptiness problem for BTA is decidable [13] and is LOGSPACE complete for PTIME [15]. The non emptiness problem for RTA is NP complete [12, 5] Given a TA A = hQ; Q 0 ; F i, we de ne the size of A, denoted by Size(A) as the sum of the sizes of Q, and F . Let T be a language, we de ne the size of T , denoted by Size TA (T ) as the minimum over the sizes of the TA s ....
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:182 - 211, 1986.
Combining Deduction and Model Checking into Tableaux and.. - De Giacomo, Massacci (1998) (8 citations) (Correct)
....of the tableaux method (naively NEXPTIME) into an EXPTIME algorithm. 1 Introduction Propositional Dynamic Logics (PDLs) are modal logics introduced in [10] to model the evolution of the computation process by describing the properties of states reached by programs during their execution [15, 24, 27]. Over the years, PDLs have been proved to be a valuable formal tool in Computer Science, Logic, Computational Linguistics, and Artificial Intelligence far beyond their original use for program verification (e.g. 4, 12, 14, 15, 24, 23] In this paper we focus on Converse PDL (CPDL) 10] ....
.... cases inference procedures have been successfully developed for PDL, but their extension to CPDL has proved to be a difficult task and unsuccessful till now (to the best of our knowledge) To be precise, inference procedures based on model enumeration [10, 21] or on automata on infinite trees [27] have been extended to converse of programs. Yet, these procedures are more suited for proving theoretical results than for being used in applications. Tableaux procedures for PDL [20, 22] which are typically simpler in practice, have never been extended. In [20] Pratt says We do not have a ....
[Article contains additional citation context not shown here]
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Comp. and System Sci., 32:183--221, 1986.
Dynamic Logic - Harel, Kozen, Tiuryn (1984) (356 citations) (Correct)
....version consists of propositional modal logic with a least fixpoint operator. It is the most powerful logic of its type, subsuming all known variants of PDL, game logic of [Parikh, 1983] various forms of temporal logic (see Section 14.2) and other seemingly stronger forms of the calculus ( Vardi and Wolper, 1986b] In the following presentation we focus on this version, since it has gained fairly widespread acceptance; see [Kozen, 1984; Kozen and Parikh, 1983; Streett, 1985b; Streett and Emerson, 1984; Vardi and Wolper, 1986b; Walukiewicz, 1993; Walukiewicz, 1995; Walukiewicz, 2000; Stirling, 1992; ....
....success. See [Courcoubetis and Yannakakis, 1988; Emerson, 1985; Emerson and Jutla, 1988; Emerson and Sistla, 1984; Manna and Pnueli, 1987; Muller et al. 1988; Pecuchet, 1986; Safra, 1988; Sistla et al. 1987; Streett, 1982; Vardi, 1985a; Vardi, 1985b; Vardi, 1987; Vardi and Stockmeyer, 1985; Vardi and Wolper, 1986b; Vardi and Wolper, 1986a; Arnold, 1997a; Arnold, 1997b] and [Thomas, 1997] Especially noteworthy in this area is the result of [Safra, 1988] involving the complexity of converting a nondeterministic automaton on infinite strings into an equivalent deterministic one. This result has already ....
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci., 32:183--221, 1986.
A Modal Perspective on Path Constraints - Alechina, Demri, de Rijke (2003) (4 citations) (Correct)
.... P complete; this paper, Corollary 10 paper, Corollary 10 Satis ability problem non deterministic graphs deterministic graphs PDL EXPTIME complete [22, 40] EXPTIME complete [39, 9] PDL with nominals EXPTIME complete [23] EXPTIME complete [23] CPDL EXPTIME complete [22, 40] EXPTIME complete [44] CPDL with nominals EXPTIME complete [20, 7] open EXPTIME complete; this open paper, Theorem 12 Table 1: A summary of results on logical reasoning tasks. 5 The Complexity of Reasoning with Path Constraints In order to characterize the complexity of reasoning problems on path constraints, ....
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183-221, 1986.
A Modal Perspective on Path Constraints - Alechina, Demri, de Rijke (2003) (4 citations) (Correct)
.... P complete; this paper, Corollary 10 paper, Corollary 10 Satisfiability problem non deterministic graphs deterministic graphs PDL EXPTIME complete [22, 40] EXPTIME complete [39, 9] PDL with nominals EXPTIME complete [23] EXPTIME complete [23] CPDL EXPTIME complete [22, 40] EXPTIME complete [44] CPDL with nominals EXPTIME complete [20, 7] open EXPTIME complete; this open paper, Theorem 12 Table 1: A summary of results on logical reasoning tasks. Lemma 13 The problem below is in NLOGSPACE in jGj and jtj: instance: a finite L structure G, a path expression t, and u; v 2 V ; ....
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183--221, 1986.
Automata-Theoretic Decision Procedures for Information Logics - Demri, Sattler (2002) (Correct)
....automata. After the works of B uchi and Rabin [B uc62,Rab69] various classes of automata turned out to be well suited to solve decision procedures for logical problems, including some for temporal logics (see e.g. VW94,Var97,KVW00] for the calculus and its fragments (see e.g. EJ99,SE89,VW86,EJS01,Var98] and for description logics (see e.g. CDGL99,CGL02] to quote three families of logics. For instance, translating formulae in temporal logics to automata is a standard approach for implementing model checking, see e.g. the model checking tool SPIN [Hol97] More recently, such ....
.... results since SIM contains a universal modal connective with a family of B modal connectives (see e.g. Spa93,CL94,Hem96] The ExpTime upper bound is established by an exponential reduction into the emptiness problem for B uchi automata on in nite trees that is known to be in PTime (see e.g. VW86,EJ88] As mentioned previously, this technique is nowadays standard for logics of programs, but it has never been applied to information logics. Indeed, relative information logics contain features that are not traditionally present in most logics of programs (e.g. the presence of nominals on ....
[Article contains additional citation context not shown here]
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183-221, 1986.
Verification of Open Systems - Orna Kupferman Hebrew Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, April 1986. 22
Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, April 1986.
Safraless Decision Procedures - Orna Kupferman Hebrew Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, April 1986.
The Bulletin of Symbolic Logic - Volume Number June Self-citation (Vardi) (Correct)
No context found.
M. Y. Vardi and P. Wolper, Automata-theoretic techniques for modal logics of programs, Journal of Computer and System Science, vol. 32 (
Relating Word and Tree Automata - Orna Kupferman Bell (1996) (3 citations) Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automatatheoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, April 1986.
Relating Word and Tree Automata - Kupferman, Safra, Vardi (2004) (3 citations) Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182-221, April 1986.
Global Model-Checking of Infinite-State Systems - Piterman, Vardi Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. JCSS, 32(2):182--221, 1986.
Resets vs. Aborts in Linear Temporal Logic - Roy Armoni Doron (2003) Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, April 1986.
Fair Equivalence Relations - Orna Kupferman And Self-citation (Vardi) (Correct)
No context found.
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182-221, April 1986.
Resets vs. Aborts in Linear Temporal Logic - Armoni, Bustan, Kupferman, Vardi Self-citation (Vardi) (Correct)
....# 2 , and # 1 # 2 are the automata for # L(A 2 ) and L(A 1 ) L(A 2 ) respectively. # , #) s . For # = # 1 U# 2 , we define #S#1 #S#2 ###1 ###2 # ) An automata theoretic approach for LTL satisfiability and model checking is presented in [22, 23]. The approach is based on a construction of NBW for LTL formulas. Given an LTL formula , satisfiability of can be checked by first constructing an NBW for and then checking if L(A ) is empty. As for model checking, assume that we want to check whether a system that is modelled by an NBW AM ....
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, April 1986.
Query Optimization for Semistructured Data - Using Path Constraints (Correct)
No context found.
M. Y. Vardi and P. Wolper. "Automata-theoretic techniques for modal logic of programs". J. Comput. System Sci. (JCSS), 32(2), 1986.
Query Optimization for Semistructured Data using Path.. - In Deterministic Data (Correct)
No context found.
M. Y. Vardi and P. Wolper. "Automata-theoretic techniques for modal logic of programs". J. Comput. System Sci. (JCSS), 32(2), 1986.
Pushdown Module Checking - Bozzelli, Murano, Peron (2005) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Sciences, 32(2):182--221, 1986.
Weak Muller Acceptance Conditions for Tree Automata - Torre, Murano, Napoli (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:182 -- 211, 1986.
Pushdown Module Checking - Bozzelli, Murano, Peron (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32(2):182--221, 1986. Laura Bozzelli, Aniello Murano, and Adriano Peron A Proof of Proposition 2 The PD-NTA
Logical and Computational Properties of the.. - Buongarzoni.. (1995) (2 citations) (Correct)
No context found.
Moshe Vardi and P.Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and Systems Science, 32:183--221, 1986.
Timed Games With Branching-Time Winning Conditions - Aniello Murano Dipartimento (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:182 -- 211, 1986.
Automata-theoretic Decision of Timed Games - Marco Faella Salvatore (2002) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:182 - 211, 1986.
Model Checking Dynamic Allocation and Deallocation - Distefano, Rensink, Katoen (2002) (3 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. J. of Computer and System Sciences, 32:183--221, 1986.
Path Constraints from a Modal Logic Point of View.. - Alechina, Demri, de.. (Correct)
No context found.
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183-221, 1986. 10
An Automata-theoretic Approach to Interprocedural Data-flow.. - Esparza, Knoop (1999) (27 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences, 32:183--221, 1986.
Model-Checking LTL with Regular Valuations for Pushdown.. - Esparza, Kucera, Schwoon (2002) (5 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata Theoretic Techniques for Modal Logics of Prog rams. Journal of Computer and System Sciences, 32:183--221, 1986. 24
LTL Model Checking for Modular Petri Nets - Latvala, Mäkelä (2004) (Correct)
No context found.
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences 32 (1986) 183--221
Automatic Abstraction - Using Generalized Model (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Science, 32(2):183--221, April 1986.
TEMPORAL LOGICS OF COMPUTATIONS - Introductory course - Goranko (2000) (Correct)
No context found.
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):183--221, April 1986.
Automated Verification of State-based specifications against.. - Bontemps (2001) (Correct)
No context found.
Moshe Vardi Y. & Pierre Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Science, vol. 32, no. 2, pages 183--221, April 1986.
Efficient Model Checking of Safety Properties - Latvala (2003) (1 citation) (Correct)
No context found.
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences 32 (1986) 183--221
Efficient Model Checking of Safety Properties - Latvala (2003) (1 citation) (Correct)
No context found.
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences 32 (1986) 183--221
Path Constraints from a Modal Logic Point of View.. - Alechina, Demri, de.. (Correct)
No context found.
M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183-221, 1986. 10
Mary Likes all Cats - Lutz, Sattler (2000) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences, 32:183-221, 1986.
Optimizing Description Logic Subsumption - Horrocks, Patel-Schneider (1999) (18 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32, 183--221, 1986.
Automatic Abstraction - Using Generalized Model (2002) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Science, 32(2):183--221, April 1986.
2ATAs make DLs easy - Calvanese, De Giacomo, Lenzerini (2002) (2 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Sciences, 32:183-221, 1986. A preliminary version appeared in Proc. of the 16th ACM SIGACT Symp. on Theory of Computing (STOC'84).
Basic Description Logics - Baader, Nutt (2003) (14 citations) (Correct)
No context found.
Moshe Y. Vardi and Pierre Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Sciences, 32:183-221, 1986. A preliminary version appeared in Proc. of the 16th ACM SIGACT Symp. on Theory of Computing (STOC'84).
Optimising Description Logic Subsumption - Horrocks, Patel-Schneider (1999) (28 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183--221, 1986.
Satisfiability and Completeness of Converse-PDL Replayed - Lange (2003) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences, 32:183--221, 1986.
Reasoning about Nominals with FaCT and Racer - Hladik (2003) (1 citation) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Science, 32:183--221, 1986.
XPath with conditional axis relations - Marx (2004) (4 citations) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183--221, 1986.
Automata-theoretic Decision of Timed Games - Faella, Torre, Murano (2002) (Correct)
No context found.
M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:182 - 211, 1986.
Model Checking Dynamic Allocation and Deallocation - Dino Distefano Arend (2002) (3 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. J. of Computer and System Sciences, 32:183--221, 1986.
Model Checking Dynamic Allocation and Deallocation - Distefano, Rensin, Katoen (2002) (3 citations) (Correct)
No context found.
M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. J. of Computer and System Sciences, 32:183--221, 1986.
First 50 documents Next 50
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