Results 1  10
of
919
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 369 (11 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
LUSTRE: A declarative language for programming synchronous systems
 In 14th Symposium on Principles of Programming Languages (POPL’87). ACM
, 1987
"... LUSTRE is a synchronous dataflow language for programming syetema which interact. with their environments in realtime. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we ehow how to use this semantics in order to generate ..."
Abstract

Cited by 287 (20 self)
 Add to MetaCart
LUSTRE is a synchronous dataflow language for programming syetema which interact. with their environments in realtime. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we ehow how to use this semantics in order to generate efficient, sequential code, namely, a finite state automaton which represents the control of the program. Formal rules for program transformation are also presented.
Stochastic automata network for modeling parallel systems
 IEEE Trans. Software Eng
, 1991
"... AbstractThis paper is motivated by the study of the performance of parallel systems. The performance models of such systems are often complex to describe and hard to solve. The method presented here uses a modular representation of the system as a network of statetransition graphs. The state spac ..."
Abstract

Cited by 124 (10 self)
 Add to MetaCart
AbstractThis paper is motivated by the study of the performance of parallel systems. The performance models of such systems are often complex to describe and hard to solve. The method presented here uses a modular representation of the system as a network of statetransition graphs. The state
Systolic Tree omegaLanguages
"... . The class of !languages recognized by systolic tree automata is introduced. That class extends the class of Buchi !languages and is closed under boolean operations. The emptiness problem for systolic tree automata on infinite sequences is decidable. A characterization of systolic tree !language ..."
Abstract
 Add to MetaCart
. The class of !languages recognized by systolic tree automata is introduced. That class extends the class of Buchi !languages and is closed under boolean operations. The emptiness problem for systolic tree automata on infinite sequences is decidable. A characterization of systolic tree
Reliable computation with cellular automata
 J. Computer and System Sciences
, 1986
"... We construct a onedimensional array of cellular automata on which arbitrarily large computations can be implemented reliably, even though each automaton at each step makes an error with some constant probability. In statistical physics, this construction leads to the refutation of the “positive pro ..."
Abstract

Cited by 57 (3 self)
 Add to MetaCart
We construct a onedimensional array of cellular automata on which arbitrarily large computations can be implemented reliably, even though each automaton at each step makes an error with some constant probability. In statistical physics, this construction leads to the refutation of the “positive
Limits to Parallel Computation: PCompleteness Theory
, 1995
"... D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of ..."
Abstract

Cited by 167 (5 self)
 Add to MetaCart
D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings
Advanced Systolic Design
, 1999
"... Systolic arrays are locally connected parallel architectures, whose structure is wellsuited to the implementation of many algorithms, in scientific computation, signal and image processing, biological data analysis, etc. The nature of systolic algorithms makes it possible to synthesize architecture ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Systolic arrays are locally connected parallel architectures, whose structure is wellsuited to the implementation of many algorithms, in scientific computation, signal and image processing, biological data analysis, etc. The nature of systolic algorithms makes it possible to synthesize
A Logical Characterization of Systolic Languages
, 1998
"... . In this paper we study, in the framework of mathematical logic, L(SBTA) i.e. the class of languages accepted by Systolic Binary Tree Automata. We set a correspondence (in the style of Buchi Theorem for regular languages) between L(SBTA) and MSO[Sig], i.e. a decidable Monadic Second Order logic ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. In this paper we study, in the framework of mathematical logic, L(SBTA) i.e. the class of languages accepted by Systolic Binary Tree Automata. We set a correspondence (in the style of Buchi Theorem for regular languages) between L(SBTA) and MSO[Sig], i.e. a decidable Monadic Second Order
Results 1  10
of
919