Results 11  20
of
45
Local temporal logic is expressively complete for cograph dependence alphabets
 In Proceedings of LPAR’01, number 2250 in LNAI
, 2001
"... Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case. If we focus on a purely local interpretation of formulae at vertices (or events) of a trace, then the satis ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case. If we focus on a purely local interpretation of formulae at vertices (or events) of a trace, then the satisfiability problem of linear temporal logics over traces turns out to be PSPACE–complete. But now the difficult problem is to obtain expressive completeness results with respect to first order logic. The main result of the paper shows such an expressive completeness result, if the underlying dependence alphabet is a cograph, i.e., if all traces are series parallel posets. Moreover, we show that this is the best we can expect in our setting: If the dependence alphabet is not a cograph, then we cannot express all first order properties.
Specifying and verifying partial order properties using template MSCs
 In FOSSACS’04, LNCS 2987
, 2004
"... Abstract. Message sequence charts (MSC) are a graphical language for the description of communication scenarios between asynchronous processes. Our starting point is to model systems using an assumeguarantee formalism, in the style of LSCs and Triggered MSCs. We enrich MSCs with the possibility of ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Message sequence charts (MSC) are a graphical language for the description of communication scenarios between asynchronous processes. Our starting point is to model systems using an assumeguarantee formalism, in the style of LSCs and Triggered MSCs. We enrich MSCs with the possibility of using gaps (template MSC), and show their expressivity. This formalism also allows to express logical formulas. We analyze the modelchecking problem, whose complexity is linear in the size of the system, and ranges from PTIME to EXPSPACE in the size of the template formula. 1
Logics and Automata for Verification: Expressiveness and Decidability Issues
, 2000
"... This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on decision procedures and relative expressive powers, and introduces extensions of these foundations to th ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on decision procedures and relative expressive powers, and introduces extensions of these foundations to the emerging domain of noninterleaving asynchronous computations. System computations are described as occurrences of system actions, and tractable collections of such computations can be naturally represented by finite automata upon which one can do formal analysis. Specifications of system properties are usually described in formal logics, and the question whether the system at hand satisfies its specification is then solved by means of automatatheoretic constructions.
Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to ModelCheck Traces
 of LNCS
, 2006
"... Abstract. It is well known that through code instrumentation, a distributed system’s finite execution can generate a finite trace as a partially ordered set of events. We motivate the need to use LTL modelchecking on sequences and not on traces as defined by Diekert and Gastin, to validate distri ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract. It is well known that through code instrumentation, a distributed system’s finite execution can generate a finite trace as a partially ordered set of events. We motivate the need to use LTL modelchecking on sequences and not on traces as defined by Diekert and Gastin, to validate distributed control systems executions, abstracted by such traces, and present an efficient symbolic algorithm to do the job. It uses the standard method proposed by Vardi and Wolper, which from the LTL formula, builds a monitor that accepts all the bad sequences. We show that, given a monitor and a trace, the problem to check that both the monitor and the trace have a common sequence is NPcomplete in the number of concurrent processes. Our method explores the possible configurations symbolically, since it handles sets of configurations. Moreover, it uses techniques similar to the partial order reduction, to avoid exploring as many execution interleavings as possible. It works very well in practice, compared to the standard exploration method, with or without partial order reduction (which, in practice, does not work well here).
Logics for Mazurkiewicz traces
 PHD THESIS, LEHRSTUHL FUR INFORMATIK II, RWTH AACHEN
, 2002
"... Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behavior of reactive systems with an interleaving semantics and the automatatheoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternat ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behavior of reactive systems with an interleaving semantics and the automatatheoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand decision procedures and directly yield onthefly model checking procedures. While
M.: Modelling, specifying, and verifying message passing systems
 Proceedings of the Symposium on Temporal Representation and Reasoning (TIME’01), IEEE Computer
, 2001
"... ..."
(Show Context)
A Temporal Logic for the Specification and Verification of Distributed Behaviour
, 1999
"... In this work we develop a temporal logic with fixpoints for distributed processes or distributed systems. Standard temporal logics refer to sequential processes (execution sequences) of distributed systems. Expressive temporal operators such as "Until" can be expressed as fixpoints of for ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this work we develop a temporal logic with fixpoints for distributed processes or distributed systems. Standard temporal logics refer to sequential processes (execution sequences) of distributed systems. Expressive temporal operators such as "Until" can be expressed as fixpoints of formulae involving only the simple "Next" modality. Fixpoint logics for sequential processes are known to be expressively equivalent to (Buchi) automata over infinite sequences. Thus, they represent the maximum in expressiveness in the range of "finitestate" methods. Here, we extend this approach to distributed processes, which represent the causal relation of events occurring in a run of a system as partial order. A key problem is the proper generalisation of the "Next" operator. Within a general framework we identify several syntactic subclasses of the logic. Both theoretical and pragmatic aspects of the resulting logics are investigated. The major theoretical result is the expressive equivalence of ...
Deciding Global PartialOrder Properties
, 1998
"... Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between atomic events. Recently, the use of partial order semantics, representing the causal order between events, is becoming popular. This paper considers the mod ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between atomic events. Recently, the use of partial order semantics, representing the causal order between events, is becoming popular. This paper considers the model checking problem for partialorder temporal logics. Solutions to this problem exist for partial order logics over local states. For the more general global logics that are interpreted over global states, only undecidability results have been proved. In this paper, we present a decision procedure for a partial order temporal logic over global states. We also sharpen the undecidability results by showing that a single until operator is sufficient for undecidability.
Deciding LTL over Mazurkiewicz traces
, 2003
"... Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata–theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alter ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata–theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand decision procedures and directly yield further onthefly model checking procedures. In this paper, we exhibit a decision procedure for LTL over Mazurkiewicz traces that generalises the classical automata–theoretic approach to a LTL interpreted no longer over sequences but certain partial orders. Specifically, we construct a (linear) alternating Büchi automaton (ABA) accepting the set of linearisations of traces satisfying the formula at hand. The salient point of our technique is to apply a notion of independencerewriting to formulas of the logic. Furthermore, we show that the class of linear and traceconsistent ABA corresponds exactly to LTL formulas over Mazurkiewicz traces, lifting a similar result from Löding and Thomas formulated in the framework of LTL over words.
On firstorder fragments for words and Mazurkiewicz traces: A survey
 Developments in Language Theory, 11th International Conference, DLT 2007
"... Abstract. We summarize several characterizations, inclusions, and separations on fragments of firstorder logic over words and Mazurkiewicz traces. The results concerning Mazurkiewicz traces can be seen as generalizations of those for words. It turns out that over traces it is crucial, how easy conc ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We summarize several characterizations, inclusions, and separations on fragments of firstorder logic over words and Mazurkiewicz traces. The results concerning Mazurkiewicz traces can be seen as generalizations of those for words. It turns out that over traces it is crucial, how easy concurrency can be expressed. Since there is no concurrency in words, this distinction does not occur there. In general, the possibility of expressing concurrency also increases the complexity of the satisfiability problem. In the last section we prove an algebraic and a language theoretic characterization of the fragment Σ2[E] over traces. Over words the relation E is simply the order of the positions. The algebraic characterization yields decidability of the membership problem for this fragment. For words this result is wellknown, but although our proof works in a more general setting it is quite simple and direct. An essential step in the proof consists of showing that every homomorphism from a free monoid to a finite aperiodic monoid M admits a factorization forest of finite height. We include a simple proof that the height is bounded by 3 M. 1