In this paper, we propose computational methods for the synthesis of controllers for discrete event systems modeled by polynomial dynamical systems over finite Galois field. The control objectives are specified as order relations to be checked and as minimization of a given cost function over the states through the trajectories of the system. The control objectives are then synthesized using algebraic tools such as ideals, varieties and morphisms. The applications of these methods to the safety specification of a power transformer station controller is finally presented
We consider the one dimensional planar rotator and classical Heisenberg models with a ferromagnetic ...
We present a behavioral model for discrete event systems based on an intentional formalism, as a pos...
Projet MEVALRandom grammars were introduced in computer science, but the study of their thermodynami...
In this paper we present an extension of Moreau's sweeping process for higher order systems. The dyn...
We study a family of implementations for linked lists using fine-grain synchronisation. This approac...
A lot of research has been done in routing protocols for ad-hoc network especially at the IETF in th...
Opium is a system for analysing and debugging Prolog programs. Its kernel comprises an execution tra...
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs,...
Based on an earlier work, we present an in-depth discussion of the relationsh- ips between synchrony...
Projet MEVALA queueing system is considered, with a large number $N$ of identical infinite-buffer FC...
Developments in Markov Chain Monte Carlo procedures have made it possible to perform fully Bayesian ...
A lot of research has been done in routing protocols for ad-hoc network especially at the IETF in th...
Based on the theory of non-negative supermartingales, convergence results are proven for adaptive (1...
This paper presents an approach to formalize coherence protocols for shared virtual memories as mult...
Opium is a system for analysing and debugging Prolog programs. Its kernel comprises an execution tra...
We consider the one dimensional planar rotator and classical Heisenberg models with a ferromagnetic ...
We present a behavioral model for discrete event systems based on an intentional formalism, as a pos...
Projet MEVALRandom grammars were introduced in computer science, but the study of their thermodynami...
In this paper we present an extension of Moreau's sweeping process for higher order systems. The dyn...
We study a family of implementations for linked lists using fine-grain synchronisation. This approac...
A lot of research has been done in routing protocols for ad-hoc network especially at the IETF in th...
Opium is a system for analysing and debugging Prolog programs. Its kernel comprises an execution tra...
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs,...
Based on an earlier work, we present an in-depth discussion of the relationsh- ips between synchrony...
Projet MEVALA queueing system is considered, with a large number $N$ of identical infinite-buffer FC...
Developments in Markov Chain Monte Carlo procedures have made it possible to perform fully Bayesian ...
A lot of research has been done in routing protocols for ad-hoc network especially at the IETF in th...
Based on the theory of non-negative supermartingales, convergence results are proven for adaptive (1...
This paper presents an approach to formalize coherence protocols for shared virtual memories as mult...
Opium is a system for analysing and debugging Prolog programs. Its kernel comprises an execution tra...
We consider the one dimensional planar rotator and classical Heisenberg models with a ferromagnetic ...
We present a behavioral model for discrete event systems based on an intentional formalism, as a pos...
Projet MEVALRandom grammars were introduced in computer science, but the study of their thermodynami...