Results 1  10
of
391
An AutomataTheoretic Approach to Minimalism
"... VijayShanker et al. (1987) note that many interesting linguistic formalisms can be thought of as having essentially contextfree structure, but operating over objects richer than simple strings (sequences of strings, trees, or graphs). They introduce linear contextfree rewriting systems (LCFRS’s, ..."
Abstract
 Add to MetaCart
VijayShanker et al. (1987) note that many interesting linguistic formalisms can be thought of as having essentially contextfree structure, but operating over objects richer than simple strings (sequences of strings, trees, or graphs). They introduce linear contextfree rewriting systems (LCFRS’s, see also Weir (1988)) as a unifying framework for superficially different such formalisms (like (multi component) tree adjoining grammars, head grammars, and categorial grammars). Later work (Michaelis, 1998) has added minimalist grammars (MGs, see (Stabler, 1997)) to this list. Recently, Fülöp et al. (2004) have introduced multiple bottomup tree transducers (mbutt), which can be thought of as offering a transductive perspective on LCFRSs. The transductive perspective allows us to view a grammar in one
An automatatheoretic approach to linear temporal logic
 Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science
, 1996
"... Abstract. The automatatheoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over s ..."
Abstract

Cited by 295 (26 self)
 Add to MetaCart
Abstract. The automatatheoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over
An AutomataTheoretic Approach to Fair Realizability and Synthesis
, 1995
"... . Over the last few years, the automatatheoretic approach to realizability checking and synthesis of reactive modules, developed by Pnueli and Rosner, by Abadi, Lamport, and Wolper, and by Dill and WongToi, has been quite successful, handling both the synchronous and the asynchronous cases. In thi ..."
Abstract

Cited by 39 (6 self)
 Add to MetaCart
. Over the last few years, the automatatheoretic approach to realizability checking and synthesis of reactive modules, developed by Pnueli and Rosner, by Abadi, Lamport, and Wolper, and by Dill and WongToi, has been quite successful, handling both the synchronous and the asynchronous cases
An AutomataTheoretic Approach to Constraint LTL
, 2003
"... We consider an extension of lineartime temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automatatheoretic technique to show pspace decidability of the logic for the constraint systems (Z, <, =) and (N, <, =). Along the way, we give an automatatheoretic ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
We consider an extension of lineartime temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automatatheoretic technique to show pspace decidability of the logic for the constraint systems (Z, <, =) and (N, <, =). Along the way, we give an automatatheoretic
An automata theoretic approach to minimalism
 PROCEEDINGS OF THE WORKSHOP MODELTHEORETIC SYNTAX AT 10; ESSLLI 2007
, 2007
"... VijayShanker et al. (1987) note that many interesting linguistic formalisms can be thought of as having essentially contextfree structure, but operating over objects richer than simple strings (sequences of strings, trees, or graphs). They introduce linear contextfree rewriting systems (LCFRS’s ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
VijayShanker et al. (1987) note that many interesting linguistic formalisms can be thought of as having essentially contextfree structure, but operating over objects richer than simple strings (sequences of strings, trees, or graphs). They introduce linear contextfree rewriting systems (LCFRS’s, see also Weir (1988)) as a unifying framework for superficially different such formalisms (like (multi component) tree adjoining grammars, head grammars, and categorial grammars). Later work (Michaelis, 1998) has added minimalist grammars (MGs, see (Stabler, 1997)) to this list. Recently, Fülöp et al. (2004) have introduced multiple bottomup tree transducers (mbutt), which can be thought of as offering a transductive perspective on LCFRSs. The transductive
An AutomataTheoretic Approach to Regular XPath
"... In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: lineartime query evaluation and exponentialtime reasoning. To establish these results, we devise a unifying automatatheor ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: lineartime query evaluation and exponentialtime reasoning. To establish these results, we devise a unifying automatatheoretic
An AutomataTheoretic Approach to BranchingTime Model Checking
 JOURNAL OF THE ACM
, 1998
"... Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automatatheoretic techniques ..."
Abstract

Cited by 354 (66 self)
 Add to MetaCart
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automatatheoretic
Automatatheoretic approach to planning for temporally extended goals
 IN ECP
, 2000
"... We study an automatatheoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Büchi automata on infinite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal ..."
Abstract

Cited by 53 (10 self)
 Add to MetaCart
We study an automatatheoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Büchi automata on infinite words, to synthesize sequential and conditional plans in a generalized setting in which we have that: goals are general temporal
The AutomataTheoretic Approach Works for Global Trace Logics
"... TrL is nonelementary [1] and thus no efficient automatatheoretic approach can exist. In [1], also the unary fragment of LTrL, denoted LTrL, is considered. There a doubleexponential time decision procedure is given for LTrL by a technically involved approach. This procedure is essentially optimal ..."
Abstract
 Add to MetaCart
TrL is nonelementary [1] and thus no efficient automatatheoretic approach can exist. In [1], also the unary fragment of LTrL, denoted LTrL, is considered. There a doubleexponential time decision procedure is given for LTrL by a technically involved approach. This procedure is essentially optimal
An Automata Theoretic Approach to Temporal Logic
 PROCEEDINGS OF 3 RD WORKSHOP ON COMPUTER AIDED VERIFICATION (CAV91), VOLUME 575 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1991
"... A syntax directed mapping is presented from Propositional Temporal Logic (PTL) formulae to Müller type finite automata. This is a direct and much more elegant and easier to implement approach than previously described methods. Most of these methods are based on tableau methods for satisfiability che ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A syntax directed mapping is presented from Propositional Temporal Logic (PTL) formulae to Müller type finite automata. This is a direct and much more elegant and easier to implement approach than previously described methods. Most of these methods are based on tableau methods for satisfiability
Results 1  10
of
391