Results 1  10
of
31
The Complexity of Propositional Linear Temporal Logics in Simple Cases
 Information and Computation
, 1998
"... this paper we investigate this issue and consider model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) the temporal height. Key Words: logic in computer science, computational comple ..."
Abstract

Cited by 60 (1 self)
 Add to MetaCart
this paper we investigate this issue and consider model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) the temporal height. Key Words: logic in computer science, computational complexity, verification, temporal logic, model checking 1.
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 proof of a result of [BC02] when the constraint system D satisfies the completion property. Our decision procedures extend easily to handle extensions of the logic with past operators and constants, as well as an extension of the temporal language itself to monadic second order logic. Finally, we show that the logic...
On the freeze quantifier in constraint LTL: decidability and complexity
 I & C
, 2005
"... Constraint LTL, a generalization of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some realtime logics, but this variablebinding mechanism is quite general ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
Constraint LTL, a generalization of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some realtime logics, but this variablebinding mechanism is quite general and ubiquitous in many logical languages (firstorder temporal logics, hybrid logics, logics for sequence diagrams, navigation logics, etc.). We show that Constraint LTL over the simple domain =# augmented with the freeze operator is undecidable which is a surprising result regarding the poor language for constraints (only equality tests). Many versions of freezefree Constraint LTL are decidable over domains with qualitative predicates and our undecidability result actually establishes # 1 completeness. On the positive side, we provide complexity results when the domain is finite (EXPSPACEcompleteness) or when the formulae are flat in a sense introduced in the paper. Our undecidability results are quite sharp (i.e. with restrictions on the number of variables) and all our complexity characterizations insure completeness with respect to some complexity class (mainly PSPACE and EXPSPACE).
Pushdown Timed Automata: a Binary Reachability Characterization and Safety Verification
 Theoretical Computer Science
, 2003
"... We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a state, dense clock values and a stack word. By using the pattern technique, we give a decidable characterization of the binary reachability ( ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
(Show Context)
We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a state, dense clock values and a stack word. By using the pattern technique, we give a decidable characterization of the binary reachability (i.e., the set of all pairs of configurations such that one can reach the other) of a PTA. Since a timed automaton can be treated as a PTA without the pushdown stack, we can show that the binary reachability of a timed automaton is definable in the additive theory of reals and integers. The results can be used to verify a class of properties containing linear relations over both dense variables and unbounded discrete variables. The properties previously could not be verified using the classic region technique nor expressed by timed temporal logics for timed automata and CTL for pushdown systems. The results are also extended to other generalizations of timed automata.
Towards a modelchecker for counter systems
 In ATVA 2006, 4 th International Symposium on Automated Technology for Verification and Analysis, Beijing, Rep. of China, volume 4218 of Lecture Notes in Computer Science
, 2006
"... Abstract. This paper deals with modelchecking of fragments and extensions of CTL * on infinitestate Presburger counter systems, where the states are vectors of integers and the transitions are determined by means of relations definable within Presburger arithmetic. We have identified a natural cla ..."
Abstract

Cited by 18 (10 self)
 Add to MetaCart
Abstract. This paper deals with modelchecking of fragments and extensions of CTL * on infinitestate Presburger counter systems, where the states are vectors of integers and the transitions are determined by means of relations definable within Presburger arithmetic. We have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL * can be simulated by quantification over tuples of natural numbers, eventually allowing translation of the whole PresburgerCTL * into Presburger arithmetic, thereby enabling effective model checking. We have provided evidence that our results are close to optimal with respect to the class of counter systems described above. Finally, we design a complete semialgorithm to verify firstorder LTL properties over traceflattable counter systems, extending the previous underlying FAST semialgorithm to verify reachability questions over flattable counter systems. 1
WellAbstracted Transition Systems: Application to FIFO Automata
, 2000
"... this paper on symbolic representations for the computation of the reachability set of FIFO automata  a finite control with multiple unbounded FIFO channels. To the best of our knowledge, Pachl uses for the first time regular expressions to represent infinite sets of channel contents [31]. In [17] ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
this paper on symbolic representations for the computation of the reachability set of FIFO automata  a finite control with multiple unbounded FIFO channels. To the best of our knowledge, Pachl uses for the first time regular expressions to represent infinite sets of channel contents [31]. In [17], linear regular expressions have been defined and used. Boigelot et al. chosed a deterministic finite automata based representation, namely Queuecontent Decision Diagrams [4] and afterwards Bouajjani et al. added Pressburger formulas, namely Constrained QDDs [5]. Simple regular expressions have been introduced for lossy FIFO automata [1]
On Presburger Liveness of Discrete Timed Automata
 STACS'01, LNCS 2010
, 2001
"... Using an automatatheoretic approach, we investigate the decidabilityof liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on configurations are allowed. While the general problem of checking a temporal logic such as TPTL augmented with Presburg ..."
Abstract

Cited by 13 (12 self)
 Add to MetaCart
(Show Context)
Using an automatatheoretic approach, we investigate the decidabilityof liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on configurations are allowed. While the general problem of checking a temporal logic such as TPTL augmented with Presburger clock constraints is undecidable, we show that there are various classes of Presburgerliveness properties which are decidable for discrete timed automata. For instance, it is decidable, given a discrete timed automaton A and a Presburger property P,whether there exists an!path of A where P holds infinitely often. We also showthat other classes of Presburger liveness properties are indeed undecidable for discrete timed automata, e.g., whether P holds infinitely often for each!path of A. These results might give insights into the corresponding problems for timedautomata over dense domains, and help in the definition of a fragment of linear temporal logic, augmented with Presburger conditions on configurations, whichis decidable for model checking timed automata.
SMTbased Verification of LTL Specifications with Integer Constraints and its Applications to Runtime Checking of Service Substitutability
, 2010
"... Abstract—An important problem that arises during the execution of servicebased applications concerns the ability to determine whether a running service can be substituted with one with a different interface, for example if the former is no longer available. Standard Bounded Model Checking technique ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Abstract—An important problem that arises during the execution of servicebased applications concerns the ability to determine whether a running service can be substituted with one with a different interface, for example if the former is no longer available. Standard Bounded Model Checking techniques can be used to perform this check, but they must be able to provide answers very quickly, lest the check hampers the operativeness of the application, instead of aiding it. The problem becomes even more complex when conversational services are considered, i.e., services that expose operations that have Input/Output data dependencies among them. In this paper we introduce a formal verification technique for an extension of Linear Temporal Logic that allows users to include in formulae constraints on integer variables. This technique applied to the substitutability problem for conversational services is shown to be considerably faster and with smaller memory footprint than existing ones.
LTL over integer periodicity constraints
 Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), volume 2987 of LNCS
, 2004
"... Abstract. Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL mod, an extension of LinearTime Temporal Logic LTL with pasttime operators ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL mod, an extension of LinearTime Temporal Logic LTL with pasttime operators whose atomic formulae are defined from a firstorder constraint language dealing with periodicity. Although the underlying constraint language is a fragment of Presburger arithmetic shown to admit a pspacecomplete satisfiability problem, we establish that PLTL mod modelchecking and satisfiability problems remain in pspace as plain LTL (full Presburger LTL is known to be highly undecidable). This is particularly interesting for dealing with periodicity constraints since the language of PLTL mod has a language more concise than existing languages and the temporalization of our firstorder language of periodicity constraints has the same worst case complexity as the underlying constraint language. Finally, we show examples of introduction the quantification in the logical language that provide to PLTL mod, expspacecomplete problems. As another application, we establish that the equivalence problem for extended singlestring automata, known to express the equality of time granularities, is pspacecomplete by designing a reduction from QBF and by using our results for PLTL mod. Keywords: Presburger LTL, periodicity constraints, computational complexity, Büchi automaton, QBF.
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