Results 1  10
of
22
Compositional message sequence charts
 IN PROC. 7 TH INTL. CONFERENCE ON TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS’01), VOLUME 2031 OF LECT. NOTES IN COMP. SCI
, 2001
"... Message sequence charts (MSCs) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High level MSCs (HMSCs) allow specifying in nite scenarios and di ..."
Abstract

Cited by 48 (6 self)
 Add to MetaCart
Message sequence charts (MSCs) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High level MSCs (HMSCs) allow specifying in nite scenarios and di erent choices. Speci cally, anHMSC consists of a graph, where each node is a nite MSC with matched send and receive events, and vice versa. In this paper we demonstrate a weakness of HMSCs, which disallows one to model certain interactions. We will show, by means of an example, that some simple nite state and simple communication protocol cannot be represented using HMSCs. We then propose an extension to the MSC standard, which allows HMSC nodes to include unmatched messages. The corresponding graph notation will be called HCMSC, which stands for High level Compositional Message Sequence Charts. With the extended framework, we provide an algorithm for automatically constructing an MSC representation for nite state asynchronous message passing protocols.
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
, 1997
"... A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. ..."
Abstract

Cited by 47 (5 self)
 Add to MetaCart
(Show Context)
A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the conceptual basis for many of the partial order reduction methods that have been developed in connection with LTLspecifications. We show that LTrL, our linear time temporal logic, is equal in expressive power to the first order theory of traces when interpreted over (finite and) infinite traces. This result fills a prominent gap in the existing logical theory of infinite traces. LTrL also constitutes a characterisation of the so called trace consistent (robust) LTLspecifications. These are specifications expressed as LTL formulas that do not distinguish between different linearisations of the same trace and hence are amenable to partial order reduction methods.
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
 In Proc. of MFCS'99, LNCS 1672
, 1999
"... Message sequence charts (MSC) are a graphical specification language widely used for designing communication protocols. Our starting point are two decision problems concerning the correctness and the consistency of a design based by MSC graphs. Both problems are shown to be undecidable, in gener ..."
Abstract

Cited by 45 (8 self)
 Add to MetaCart
(Show Context)
Message sequence charts (MSC) are a graphical specification language widely used for designing communication protocols. Our starting point are two decision problems concerning the correctness and the consistency of a design based by MSC graphs. Both problems are shown to be undecidable, in general. Using a natural connectivity assumption from Mazurkiewicz trace theory we show both problems to be EXPSPACEcomplete for locally synchronized graphs. The results are based on new complexity results for starconnected rational trace languages.
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
 Conference version in LATIN 2004, LNCS 2976
"... Mazurkiewicz traces ⋆ ..."
(Show Context)
The complexity of games on higher order pushdown automata
 CoRR
, 2007
"... Abstract. We prove an nexptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the µcalculus model checking over graphs given by nHPDA ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We prove an nexptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the µcalculus model checking over graphs given by nHPDA is nexptime complete. 1
Local Logics for Traces
 Journal of Automata, Languages and Combinatorics
, 2000
"... A mucalculus over dependence graph representation of traces is considered. It is shown that the mucalculus cannot express all monadic second order (MSO) properties of dependence graphs. ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
A mucalculus over dependence graph representation of traces is considered. It is shown that the mucalculus cannot express all monadic second order (MSO) properties of dependence graphs.
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 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
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 ...