Results 1  10
of
46
Maxplus algebra and system theory: Where we are and where to go now
 Annu. Rev. Control
, 1999
"... Abstract: More than sixteen years after the beginning of a linear theory for certain discrete event systems in which maxplus algebra and similar algebraic tools play a central role, this paper attempts to summarize some of the main achievements in an informal style based on examples. By comparison ..."
Abstract

Cited by 42 (18 self)
 Add to MetaCart
Abstract: More than sixteen years after the beginning of a linear theory for certain discrete event systems in which maxplus algebra and similar algebraic tools play a central role, this paper attempts to summarize some of the main achievements in an informal style based on examples. By comparison with classical linear system theory, there are areas which are practically untouched, mostly because the corresponding mathematical tools are yet to be fabricated. This is the case of the geometric approach of systems which is known, in the classical theory, to provide another important insight to systemtheoretic and controlsynthesis problems, beside the algebraic machinery. A preliminary discussion of geometric aspects in the maxplus algebra and their use for system theory is proposed in the last part of the paper. Résumé: Plus de seize ans après le début d’une théorie linéaire de certains systèmes à événements discrets dans laquelle l’algèbre maxplus et autres outils algébriques assimilés jouent un rôle central, ce papier cherche àdécrire quelques uns des principaux résultats obtenus de façon informelle, en s’appuyant sur des exemples. Par comparaison avec la théorie classique des systèmes linéaires, il existe des domaines pratiquement vierges, surtout en raison du fait que les outils mathématiques correspondants restent à forger. C’est en particulier le cas de l’approche géométrique des systèmes qui, dans la théorie classique, est connue pour apporter un autre regard important sur les questions de théorie des systèmes et de synthèse de lois de commandes àcôté de la machinerie purement algébrique. Une discussion préliminaire sur les aspects géométriques de l’algèbre maxplus et leur utilité pour la théorie des systèmes est proposée dans la dernière partie du papier.
Verifying Temporal Properties without Temporal Logic
, 1989
"... this paper were first presented at the "IEEE Symposium on Logic in Computer Science," Ithaca, New York, June 1987 ..."
Abstract

Cited by 37 (0 self)
 Add to MetaCart
this paper were first presented at the "IEEE Symposium on Logic in Computer Science," Ithaca, New York, June 1987
Polynomial closure and unambiguous product
 Theory Comput. Systems
, 1997
"... This paper is a contribution to the algebraic theory of recognizable languages. The main topic of this paper is the polynomial closure, an operation that mixes together the operations of union and concatenation. Formally, the polynomial closure of a class of languages L of A ∗ is the set of language ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
This paper is a contribution to the algebraic theory of recognizable languages. The main topic of this paper is the polynomial closure, an operation that mixes together the operations of union and concatenation. Formally, the polynomial closure of a class of languages L of A ∗ is the set of languages
Finite Semigroups and Recognizable Languages An Introduction
, 1995
"... This paper is an attempt to share with a larger audience some modern developments in the theory of finite automata. It is written for the mathematician who has a background in semigroup theory but knows next to nothing on automata and languages. No proofs are given, but the main results are illustra ..."
Abstract

Cited by 30 (9 self)
 Add to MetaCart
This paper is an attempt to share with a larger audience some modern developments in the theory of finite automata. It is written for the mathematician who has a background in semigroup theory but knows next to nothing on automata and languages. No proofs are given, but the main results are illustrated by several examples and counterexamples
Guernic, Dataflow synchronous languages
 In A Decade of Concurrency, reflexions and perspectives, REX School/Symposium
, 1994
"... Abstract. In this paper, we present a theory of synchronous dataflow languages. Our theory is supported by both some heuristic analysis of applications and some theoretical investigation of the dataflow paradigm. Our model covers both behavioural and operational aspects, and allows both synchronou ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
Abstract. In this paper, we present a theory of synchronous dataflow languages. Our theory is supported by both some heuristic analysis of applications and some theoretical investigation of the dataflow paradigm. Our model covers both behavioural and operational aspects, and allows both synchronous and asynchronous styles of implementation for synchronous programs. This model served as a basis to establish the gc common format for synchronous dataflow languages.
Asynchronous cellular automata for pomsets
 Theoretical Computer Science
, 1996
"... This paper extends to pomsets without autoconcurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Cori, Métivier and Zielonka and we show how to const ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
This paper extends to pomsets without autoconcurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Cori, Métivier and Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Then we investigate the relation between the expressiveness of monadic second order logic, nondeterministic ACAs and deterministic ACAs. We can generalize Büchi’s theorem for finite words to a class of pomsets without autoconcurrency which satisfy a natural axiom. This axiom ensures that an asynchronous cellular automaton works on the pomset as a concurrent read and exclusive owner write machine. More precisely, in this class nondeterministic ACAs, deterministic ACAs and monadic second order logic have the same expressive power. Then we consider a class where deterministic ACAs are strictly weaker than nondeterministic ones. But in this class nondeterministic ACAs still capture monadic second order logic. Finally it is shown that even this equivalence does not hold in the class of all pomsets since there the class of recognizable pomset languages is not closed under complementation.
Profinite Methods in Semigroup Theory
 Int. J. Algebra Comput
, 2000
"... this paper. The extended bibliography given below shows other important contributions by Azevedo, Costa, Delgado, Pin, Teixeira, Volkov, Weil and Zeitoun. ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
this paper. The extended bibliography given below shows other important contributions by Azevedo, Costa, Delgado, Pin, Teixeira, Volkov, Weil and Zeitoun.
A geometric characterization of automatic monoids
 The Quarterly Journal of Mathematics
, 2001
"... It is well known that automatic groups can be characterized using geometric properties of their Cayley graphs. Along the same line of thought, we provide a geometric characterization of automatic monoids. This involves working with a slightly strengthened definition of an automatic monoid which is s ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
It is well known that automatic groups can be characterized using geometric properties of their Cayley graphs. Along the same line of thought, we provide a geometric characterization of automatic monoids. This involves working with a slightly strengthened definition of an automatic monoid which is still a proper generalization of the concept of an automatic group. The two definitions coincide in the case of right cancellative monoids for which a particularly simple characterization is obtained. 1.
Polynomial endomorphisms of the Cuntz algebras arising from permutations. II —Branching laws of endomorphisms—, preprint RIMS1433
, 2003
"... —Branching laws and automata— ..."