Results 1  10
of
38
Synthesis of Distributed Algorithms Using Asynchronous Automata
 CONCUR’03, volume 2761 of LNCS
, 2003
"... We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework. ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework.
General Morphisms of Petri Nets
 Institute of Computer Science, Polish Acad. of Sci
, 1999
"... A new notion of a general morphism of Petri nets is introduced. The new morphisms are shown to properly include the morphisms considered so far. The resulting category of general Petri nets is shown to admit products. Here, it is shown that the new notion turns out to be indispensable to facilitate ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
A new notion of a general morphism of Petri nets is introduced. The new morphisms are shown to properly include the morphisms considered so far. The resulting category of general Petri nets is shown to admit products. Here, it is shown that the new notion turns out to be indispensable to facilitate functoriality of synthesis of transition systems by means of (labelled) state machines. In the companion paper this result is used to synthesize concrete asynchronous systems studied by Morin as a mixed products of state machines. Uoglnione Morfizmy Sieci Petriego Streszczenie W pracy zaproponowane nowe, uoglnione poj#cie morfizmu dla sieci Petriego. Pokazano, #e klasa tych morfizmw jest istotnie bogatsza od dotychczas rozwa#anych klas morfizmw. Otrzymana w ten sposb kategoria sieci Petriego posiada produkty. W niniejszej pracy pokazano, i# uoglnione morfizmy s# niezb#dne do zapewnienia funktorialno#ci procesu syntezy systemw tranzycji za pomoc# (etykietowanych) maszyn stanowych. W innej p...
Safe Implementability of Regular Message Sequence Charts Specifications
 PROC. OF THE ACIS 4TH INT. CONF. SNDP
, 2003
"... Message Sequence Charts (MSCs) are drawn by software designers in order to model the typical behaviors of some communication protocol at an early stage of its design. The important question of whether some given set of scenarios is realizable by some message passing system has already been investiga ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Message Sequence Charts (MSCs) are drawn by software designers in order to model the typical behaviors of some communication protocol at an early stage of its design. The important question of whether some given set of scenarios is realizable by some message passing system has already been investigated in different ways. We consider here deadlockfree implementations up to additional message contents. We present an algorithm to check safe implementability of MSC specifications in the framework of nonFIFO channels. Our criterion turns out to have the same complexity bounds as the restrictive approach of Alur et al. [1] where no additional message content is allowed.
Generalised Regular MSC Languages
 PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS’02), LECTURE NOTES IN COMPUTER SCIENCE 2303, SPRINGERVERLAG
, 2002
"... In this paper, we establish the concept of regularity for languages consisting of Message Sequence Charts (MSCs). To this aim, we formalise their behaviour by string languages and give a natural definition of regularity in terms of an appropriate Nerode right congruence. Moreover, we present a class ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
In this paper, we establish the concept of regularity for languages consisting of Message Sequence Charts (MSCs). To this aim, we formalise their behaviour by string languages and give a natural definition of regularity in terms of an appropriate Nerode right congruence. Moreover, we present a class of accepting automata and, using this characterisation, establish several decidability and closure properties of MSC languages. We also provide a logical characterisation by a monadic secondorder logic interpreted over MSCs. In contrast to existing work on regular MSC languages, our approach is neither restricted to a certain class of MSCs nor tailored to a fixed communication medium (such as a FIFO channel). It explicitly allows MSCs with message overtaking and is thus applicable to a broad range of channel types like mixtures of stacks and FIFOs.
Regular Trace Event Structures
, 1996
"... We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting.
Distributed timeasynchronous automata
 In Proceedings of the 4th international conference on Theoretical aspects of computing, ICTAC’07
, 2007
"... Abstract. We show that the class of distributed timeasynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distrib ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We show that the class of distributed timeasynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed timeasynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stopwatch automata. 1
Local LTL with past constants is expressively complete for Mazurkiewicz traces
 In Proc. of MFCS’03, number 2747 in LNCS
, 2003
"... Abstract. To obtain an expressively complete lineartime temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather than globally, at configurations. Such local logics necessarily require past modalit ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. To obtain an expressively complete lineartime temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather than globally, at configurations. Such local logics necessarily require past modalities, in contrast to the classical setting of LTL over sequences. Earlier attempts at defining expressively complete local logics have used very general past modalities as well as filters (sideconditions) that “look sideways ” and talk of concurrent events. In this paper, we show that it is possible to use unfiltered future modalities in conjunction with past constants and still obtain a logic that is expressively complete over traces.
General Morphisms of Petri Nets (Extended Abstract)
 Proc. Automata, Languages and Programming, 26th Intn'l Coll., Prague
, 1999
"... ) ? Marek A. Bednarczyk and Andrzej M. Borzyszkowski Institute of Computer Science, Gdansk Branch, Polish Acad. of Sc. Abrahama 18, 81825 Sopot, Poland, http://www.ipipan.gda.pl Abstract. A new notion of a general morphism of Petri nets is introduced. The new morphisms are shown to properly i ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
) ? Marek A. Bednarczyk and Andrzej M. Borzyszkowski Institute of Computer Science, Gdansk Branch, Polish Acad. of Sc. Abrahama 18, 81825 Sopot, Poland, http://www.ipipan.gda.pl Abstract. A new notion of a general morphism of Petri nets is introduced. The new morphisms are shown to properly include the morphisms considered so far. The resulting category of Petri nets is shown to admit products. Potential applications of general morphisms are indicated. 1 Introduction For mathematically oriented people Petri nets are quite complex objects. The following observation should put the above statement into a proper perspective: it took a quarter of a century from the inception of Petri nets, cf. [12], to the definition of their morphisms, cf. [14, 15]. Winskel's solution to the problem of defining a suitable notion of Petri net morphism was algebraic. He noticed that Petri nets can be viewed as certain 2sorted algebras. Consequently, Petri net morphisms defined in [14] are homomo...
Constructing Exponentialsize Deterministic Zielonka Automata
 IN "ICALP", VOL. LNCS 4052
, 2006
"... The wellknown algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the wellk ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The wellknown algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the wellknown construction in that the size of the asynchronous automaton is simply exponential in both the size of the sequential automaton and the number of processes. In contrast, Zielonka’s algorithm gives an asynchronous automaton that is doubly exponential in the number of processes (and simply exponential in the size of the automaton).