Results 1  10
of
44
Automatic synthesis of multiagent motion tasks based on ltl specifications
 IN PROCEEDINGS OF THE 43RD IEEE CONFERENCE ON DECISION AND CONTROL
, 2004
"... In this paper we propose a methodology for automatically synthesizing motion task controllers based on Linear Temporal Logic (LTL) specifications. The proposed design of the underlying multiagent controllers possess a special structure that allows for implicit satisfaction of basic liveness and s ..."
Abstract

Cited by 51 (4 self)
 Add to MetaCart
(Show Context)
In this paper we propose a methodology for automatically synthesizing motion task controllers based on Linear Temporal Logic (LTL) specifications. The proposed design of the underlying multiagent controllers possess a special structure that allows for implicit satisfaction of basic liveness and safety specifications. The resulting closed loop system is of hybrid nature combining the continuous dynamics of the underlying system with the automatically synthesized switching logic that enforces the LTL specification. The effectiveness of the proposed scheme is verified through nontrivial computer simulations.
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
 In Proc. FORTE’02., volume 2529 of LNCS
, 2002
"... Abstract. Model checking is an automated technique for checking that a system satisfies a set of required properties. With explicitstate model checkers, properties are typically defined in lineartime temporal logic (LTL), and are translated into Büchi automata in order to be checked. This paper de ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Model checking is an automated technique for checking that a system satisfies a set of required properties. With explicitstate model checkers, properties are typically defined in lineartime temporal logic (LTL), and are translated into Büchi automata in order to be checked. This paper describes how, by labeling automata transitions rather than states, we significantly reduce the size of automata generated by existing tableaubased translation algorithms. Our optimizations apply to the core of the translation process, where generalized Büchi automata are constructed. These automata are subsequently transformed in a single efficient step into Büchi automata as used by model checkers. The tool that implements the work described here is released as part of the Java PathFinder software (JPF), an explicit state model checker of Java programs under development at the NASA Ames Research Center. 1
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
 In LPAR’01, volume 2250 of LNCS
, 2001
"... We present new algorithms to translate linear time temporal logic (LTL) formulas with past operators to equivalent #automata. The resulting automata are given in a symbolic representation that directly supports symbolic model checking. Furthermore, this has the advantage that the translations run i ..."
Abstract

Cited by 20 (11 self)
 Add to MetaCart
(Show Context)
We present new algorithms to translate linear time temporal logic (LTL) formulas with past operators to equivalent #automata. The resulting automata are given in a symbolic representation that directly supports symbolic model checking. Furthermore, this has the advantage that the translations run in linear time wrt. the length of the input formula. To increase the efficiency of the model checking, our translations avoid as far as possible the introduction of computationally expensive fairness constraints, or at least replace them by simpler reachability constraints. Using the wellknown automaton hierarchy, we show that our improvements are complete. Finally, we show how large parts of the formulas can be translated to the simpler logic CTL, which accelerates the LTL model checking by orders of magnitude which is shown by experimental results. 1
Onthefly Automata Construction for Dynamic Linear Time Temporal Logic
 ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
, 2004
"... We present a tableaubased algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLT L), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction f ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
We present a tableaubased algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLT L), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction for LT L, but a different technique must be used to verify the fulfillment of until formulas. The resulting automaton is a Büchi automaton rather than a generalized one. The construction can be done onthefly, while checking for the emptiness of the automaton.
Efficient Monitoring of ωlanguages
, 2005
"... We present a technique for generating efficient monitors for ωregularlanguages. We show how Büchi automata can be reduced in size and transformed into special, statistically optimal nondeterministic finite state machines, called binary transition tree finite state machines (BTTFSMs), which recogn ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We present a technique for generating efficient monitors for ωregularlanguages. We show how Büchi automata can be reduced in size and transformed into special, statistically optimal nondeterministic finite state machines, called binary transition tree finite state machines (BTTFSMs), which recognize precisely the minimal bad prefixes of the original ωregularlanguage. The presented technique is implemented as part of a larger monitoring framework and is available for download.
On Expressiveness and Complexity in Realtime Model Checking
"... Abstract. Metric Interval Temporal Logic (MITL) is a popular formalism for expressing realtime specifications. This logic achieves decidability by restricting the precision of timing constraints, in particular, by banning socalled punctual specifications. In this paper we introduce a significantly ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Metric Interval Temporal Logic (MITL) is a popular formalism for expressing realtime specifications. This logic achieves decidability by restricting the precision of timing constraints, in particular, by banning socalled punctual specifications. In this paper we introduce a significantly more expressive logic that can express a wide variety of punctual specifications, but whose modelchecking problem has the same complexity as that of MITL. We conclude that for model checking the most commonly occurring specifications, such as invariance and bounded response, punctuality can be accommodated at no cost. 1
Temporal Logics for Hyperproperties
"... Abstract. Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL ∗ can refer only to a single path at a time, hence cann ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL ∗ can refer only to a single path at a time, hence cannot express many hyperproperties of interest. The logics proposed here, HyperLTL and HyperCTL∗, add explicit and simultaneous quantification over multiple paths to LTL and to CTL∗. This kind of quantification enables expression of hyperproperties. A model checking algorithm for a fragment of HyperLTL is given. The algorithm has been implemented in a prototype model checker. 1
Decentralized multiagent control from local LTL specifications
 51ST IEEE CONFERENCE ON DECISION AND CONTROL
, 2012
"... Abstract—We propose a methodology for decentralized multiagent control from Linear Temporal Logic (LTL) specifications. Each agent receives an independent specification to formally synthesize its own hybrid controller. Mutual satisfiability is not a priori guaranteed. Due to limited communication ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract—We propose a methodology for decentralized multiagent control from Linear Temporal Logic (LTL) specifications. Each agent receives an independent specification to formally synthesize its own hybrid controller. Mutual satisfiability is not a priori guaranteed. Due to limited communication, the agents utilize meeting events to exchange their controller automata and verify satisfiability through model checking. Local interaction only when common atomic propositions exist reduces the overall computational cost, facilitating scalability. Provably correct collision avoidance and convergence is ensured by Decentralized MultiAgent Navigation Functions. I.
Computational universality in symbolic dynamical systems
 Fundamenta Informaticae
"... Abstract. Many different definitions of computational universality for various types of systems have flourished since Turing’s work. In this paper, we propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. For Turing machines and tag systems, ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Many different definitions of computational universality for various types of systems have flourished since Turing’s work. In this paper, we propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. For Turing machines and tag systems, our definition coincides with the usual notion of universality. It however yields a new definition for cellular automata and subshifts. Our definition is robust with respect to noise on the initial condition, which is a desirable feature for physical realizability. We derive necessary conditions for universality. For instance, a universal system must have a sensitive point and a proper subsystem. We conjecture that universal systems have an infinite number of subsystems. We also discuss the thesis that computation should occur at the ‘edge of chaos ’ and we exhibit a universal chaotic system. 1
Model checking Quantitative Linear Time Logic
"... This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains. Keywords: Linear temporal logic, Quantitative verification, Automata. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains. Keywords: Linear temporal logic, Quantitative verification, Automata.