Results 1  10
of
27
Reachability analysis of communicating pushdown systems
, 2009
"... The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here a model proposed by La Torre, Madhusudan and Parlato [LMP08], based on communicating pushdown systems that can dequeue with empt ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here a model proposed by La Torre, Madhusudan and Parlato [LMP08], based on communicating pushdown systems that can dequeue with empty stack only. Our extension adds the dual modality, which allows to dequeue with nonempty stack, and thus models interrupts for working threads. We study (possibly cyclic) network architectures under a semantic assumption on communication that ensures the decidability of reachability for finite state systems. Subsequently, we determine precisely how pushdowns can be added to this setting while preserving the decidability; in the positive case we obtain exponential time as the exact complexity bound of reachability. A second result is a generalization of the doubly exponential time algorithm of [LMP08] for bounded context analysis to our symmetric queueing policy. We provide here a direct and simpler algorithm.
Propositional Dynamic Logic for MessagePassing Systems
, 2007
"... We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC −. Every formula is translated into an equivalent communicating finitestate machine (CFM) of exponential size. This synthesis problem is solved in full generality, i.e., also for ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
(Show Context)
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC −. Every formula is translated into an equivalent communicating finitestate machine (CFM) of exponential size. This synthesis problem is solved in full generality, i.e., also for MSCs with unbounded channels. The model checking problems for CFMs and for HMSCs against PDL formulas are shown to be in PSPACE for existentially bounded MSCs. It is shown that CFMs are to weak to capture the semantics of PDL with intersection.
Replaying play in and play out: Synthesis of design models from scenarios by learning
 Proceedings of the 13 th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS’07
, 2007
"... Abstract. This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit learning for the synthesis of design models. In particular, we present a procedure that infers a messagepassing ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(Show Context)
Abstract. This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit learning for the synthesis of design models. In particular, we present a procedure that infers a messagepassing automaton (MPA) from a given set of positive and negative scenarios of the system’s behavior provided as message sequence charts (MSCs). The paper investigates which classes of regular MSC languages and corresponding MPA can (not) be learned, and presents a dedicated tool based on the learning library LearnLib that supports our approach. 1
Learning communicating automata from MSCs
 IEEE Transactions on Software Engineering
, 2010
"... ..."
Optimal Zielonkatype construction of deterministic asynchronous automata
 In Proceedings of ICALP
, 2010
"... Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in t ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial in the size of a given DFA and simply exponential in the number of processes. We show that our construction is optimal within the class of automata produced by Zielonkatype constructions. In particular, we provide the first non trivial lower bound on the size of asynchronous automata. 1
Automata and Logics for Timed Message Sequence Charts
, 2007
"... We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finitestate machines, which communicate by exchanging messages through channels and use event clocks to generate collections of timed message sequence chart ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finitestate machines, which communicate by exchanging messages through channels and use event clocks to generate collections of timed message sequence charts (TMSCs). As a specification language, we propose a monadic secondorder logic equipped with timing predicates and interpreted over TMSCs. We establish expressive equivalence of our automata and logic. Moreover, we prove that, for (existentially) bounded channels, emptiness and satisfiability are decidable for our automata and logic.
Analysis of communicating automata
 In LATA 2010
, 2010
"... Abstract. This extended abstract is a survey of some of the recent developments in the area of automated verification dedicated to the analysis of communicating automata. Communicating automata are a fundamental computational model for concurrent systems, where processes cooperate via asynchronous ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This extended abstract is a survey of some of the recent developments in the area of automated verification dedicated to the analysis of communicating automata. Communicating automata are a fundamental computational model for concurrent systems, where processes cooperate via asynchronous message passing using unbounded channels. They are a popular model for representing and reasoning about communication protocols, and they have been used to define the semantics of standardized specification languages such as SDL. However, from the algorithmic point of view communicating automata are more challenging than other true concurrent models such as Petri nets: indeed, this model is Turing equivalent, in particular it subsumes Post tag systems [20]. Therefore, basic questions arising in formal verification, such as the reachability problem, are intractable. Solving the reachability problem is actually the first step in tackling the more general modelchecking problem, that consists in verifying that the model, i.e. the
Muller MessagePassing Automata and Logics
, 2007
"... We study nonterminating messagepassing automata whose behavior is described by infinite message sequence charts. As a first result, we show that Muller, Büchi, and terminationdetecting Muller acceptance are equivalent for these devices. To describe the expressive power of these automata, we give ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
We study nonterminating messagepassing automata whose behavior is described by infinite message sequence charts. As a first result, we show that Muller, Büchi, and terminationdetecting Muller acceptance are equivalent for these devices. To describe the expressive power of these automata, we give a logical characterization. More precisely, we show that they have the same expressive power as the existential fragment of a monadic secondorder logic featuring a firstorder quantifier to express that there are infinitely many elements satisfying some property. Our result is based on a new extension of the classical EhrenfeuchtFraïssé game to cope with infinite structures and the new firstorder quantifier.
Dynamic Communicating Automata and Branching HighLevel MSCs
"... We study dynamic communicating automata (DCA), an extension of classical communicating finitestate machines that allows for dynamic creation of processes. The behavior of a DCA can be described as a set of message sequence charts (MSCs). While DCA serve as a model of an implementation, we propose ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
We study dynamic communicating automata (DCA), an extension of classical communicating finitestate machines that allows for dynamic creation of processes. The behavior of a DCA can be described as a set of message sequence charts (MSCs). While DCA serve as a model of an implementation, we propose branching highlevel MSCs (bHMSCs) on the specification side. Our focus is on the implementability problem: given a bHMSC, can one construct an equivalent DCA? As this problem is undecidable, we introduce the notion of executability, a decidable necessary criterion for implementability. We show that executability of bHMSCs is EXPTIMEcomplete. We then identify a class of bHMSCs for which executability effectively implies implementability.
Realizability of Concurrent Recursive Programs
, 2008
"... We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multistack visibly pushdown automata and Zielonka’s asynchronous automata towards a mod ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multistack visibly pushdown automata and Zielonka’s asynchronous automata towards a model with an undecidable emptiness problem. However, a reasonable restriction allows us to lift Zielonka’s Theorem to this recursive setting and permits a logical characterization in terms of a suitable monadic secondorder logic. Building on results from Mazurkiewicz trace theory and recent work by La Torre, Madhusudan, and Parlato, we thus develop a framework for the specification, synthesis, and verification of concurrent recursive processes.