Results 11  20
of
38
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
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.
Unfolding Synthesis of Asynchronous Automata
 International Computer Science Symposium in Russia, CSR 2006. Available at http://www.cmi.univmrs.fr/˜morin/papers/CSR.pdf
"... Abstract. Zielonka’s theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a nondeterministic asynch ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Zielonka’s theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a nondeterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our approach is based on an unfolding procedure that improves the complexity of Zielonka’s and Pighizzini’s techniques: Our construction is polynomial in terms of the number of states but still doubleexponential in the size of the alphabet. As opposed to Métivier’s work, our algorithm does not restrict to acyclic dependence alphabets.
Temporal logics for concurrent recursive programs: Satisfiability and model checking
 In MFCS’11, volume 6907 of LNCS
, 2011
"... Abstract. We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations. To specify properties of executions, we consider any temporal logic whose modalities aredefinable in monadi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations. To specify properties of executions, we consider any temporal logic whose modalities aredefinable in monadic secondorder logic and that, in addition, allows PDLlike path expressions. This captures, in a unifying framework, a wide range of logics defined for ranked and unranked trees, nested words, and Mazurkiewicz traces that have been studied separately. We show that satisfiability and model checking are decidable in EXPTIME and 2EXPTIME, depending on the precise path modalities. 1
Decidability Questions for Graph kCoverings
, 1997
"... . The notion of kcoverings of graphs, used previously in order to demonstrate some impossibility results for local graph computations, is investigated systematically. It turns out that, unlike the classical graph coverings where a simple method exists to construct them effectively for a given graph ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. The notion of kcoverings of graphs, used previously in order to demonstrate some impossibility results for local graph computations, is investigated systematically. It turns out that, unlike the classical graph coverings where a simple method exists to construct them effectively for a given graph, kcoverings do not admit any such algorithm  the problem if a graph admits a nontrivial kcovering appears to be undecidable. 1 Introduction Our aim is to examine a special family of graph maps introduced in [12] and called kcoverings. By a graph we shall always mean an undirected simple graph G with a set V (G) of vertices and a set E(G) of edges, each edge e 2 E(G) being a pair e = fv; wg of two distinct vertices. Then a graph map f : H ! G from a graph H to a graph G is a mapping from V (H) [E(H) into V (G) [ E(G) such that  f maps vertices (edges) of H to vertices (respectively edges) of G and,  f preserves the adjacency between vertices and edges: if v 2 V (H) is adjacent...
Modular System Development With Pullbacks
, 2003
"... Two, seemingly different modular techniques for concurrent system development are investigated from a categorical perspective. A novel approach is presented in which they turn out to be merely special instances of pullback, a general categorical limit construction. Interestingly, the approach is ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Two, seemingly different modular techniques for concurrent system development are investigated from a categorical perspective. A novel approach is presented in which they turn out to be merely special instances of pullback, a general categorical limit construction. Interestingly, the approach is based on truly concurrent semantics of systems.
Title: Studies in Comtrace Monoids
"... Mazurkiewicz traces were introduced by A. Mazurkiewicz in 1977 as a language representation of partial orders to model “true concurrency”. The theory of Mazurkiewicz traces has been utilised to tackle not only various aspects of concurrency theory but also problems from other areas, including combin ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Mazurkiewicz traces were introduced by A. Mazurkiewicz in 1977 as a language representation of partial orders to model “true concurrency”. The theory of Mazurkiewicz traces has been utilised to tackle not only various aspects of concurrency theory but also problems from other areas, including combinatorics, graph theory, algebra, and logic. However, neither Mazurkiewicz traces nor partial orders can model the “not later than ” relationship. In 1995, comtraces (combined traces) were introduced by Janicki and Koutny as a formal language counterpart to finite stratified order structures. They show that each comtrace uniquely determines a finite stratified order structure, yet their work contains very little theory of comtraces. This thesis aims at enriching the tools and techniques for studying the theory of comtraces. Our first contribution is to introduce the notions of absorbing monoids, generalised comtrace monoids, partially commutative absorbing monoids, and absorbing monoids with compound generators, all of which are the generalisations of Mazurkiewicz trace
Weighted asynchronous cellular automata
 In Proceedings of STACS 2006
, 2006
"... Abstract. We study weighted distributed systems whose behavior can be described as a formal power series over a free partially commutative or trace monoid. We characterize the behavior of such systems both, in the deterministic and in the nondeterministic case. As a consequence, we obtain a particu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We study weighted distributed systems whose behavior can be described as a formal power series over a free partially commutative or trace monoid. We characterize the behavior of such systems both, in the deterministic and in the nondeterministic case. As a consequence, we obtain a particularly simple class of sequential weighted automata that have already the full expressive power. 1
Morin R.: The Synthesis Problem of Netcharts
, 2006
"... Abstract. A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two papers showed recently that any globallycooperative highlevel MSC corresponds to the behaviours of some communicating finitestate machine ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two papers showed recently that any globallycooperative highlevel MSC corresponds to the behaviours of some communicating finitestate machine — or equivalently a netchart. These difficult results rely either on Thomas ’ graph acceptors or Zielonka’s construction of asynchronous automata. In this paper we give a direct and selfcontained synthesis of netcharts from globallycooperative highlevel MSCs by means of a simpler unfolding procedure.
On the complementation of asynchronous cellular Büchi automata
 Theoretical Computer Science
, 1996
"... We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of finite traces. We use the subset automaton construction and apply Kla ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of finite traces. We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement nondeterministic asynchronous cellular Buchi automata for infinite traces.
Complexity Results for Checking Distributed Implementability
, 2004
"... We consider the distributed implementability problem: Given a labeled transition system TS together with a distribution # of its actions over a set of processes, does there exist a distributed system over # such that its global transition system is `equivalent' to TS? We work with the distributed s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the distributed implementability problem: Given a labeled transition system TS together with a distribution # of its actions over a set of processes, does there exist a distributed system over # such that its global transition system is `equivalent' to TS? We work with the distributed system models of synchronous products of transition systems [1] and asynchronous automata [18]. In this paper we provide complexity bounds for the above problem with three interpretations of `equivalent': as transition system isomorphism, as language equivalence, and as bisimilarity. In particular, we solve problems left open in [4, 10]. 1.