AbstractWe model distributed processes by the computations of synchronized automata. These machines are collections of finite automata the computations of which are linked through by synchronization states. With these models we give a solution to the distribution problem of a set of sequential processes on several processors
International audienceBulk-Synchronous Parallel (BSP) is a bridging model between abstract execution...
We discuss a new model for the analysis and simulation of stochastic systems which we call stochasti...
Reversible computing is a paradigm of computation that extends the standard forward-only programming...
AbstractWe model distributed processes by the computations of synchronized automata. These machines ...
This paper addresses the problem of distributed program synthesis. In the first part, we formalize t...
With distributed computing beginning to play a major role in modern Computer Science, the theory of ...
AbstractIn this article we discuss (i) a model suitable for describing a distributed real-time syste...
The paper consider a mathematical model of a concurrent system, the special case of which is an asyn...
We present a class of Stochastic Automata Networks (SAN) which exhibit a product form solution if so...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
We discuss a new model for the analysis and simulation of stochastic systems which we call stochasti...
International audienceWe discuss conceptional and foundational aspects of Markov automata [22]. We p...
This work deals with automata systems. We define parallel automata systems and parallel communicatin...
We call network of automata a family of partially synchronised automata, i.e. a family of determinis...
International audienceWe present a new kind of synchronization which allows Continuous Time Stochast...
International audienceBulk-Synchronous Parallel (BSP) is a bridging model between abstract execution...
We discuss a new model for the analysis and simulation of stochastic systems which we call stochasti...
Reversible computing is a paradigm of computation that extends the standard forward-only programming...
AbstractWe model distributed processes by the computations of synchronized automata. These machines ...
This paper addresses the problem of distributed program synthesis. In the first part, we formalize t...
With distributed computing beginning to play a major role in modern Computer Science, the theory of ...
AbstractIn this article we discuss (i) a model suitable for describing a distributed real-time syste...
The paper consider a mathematical model of a concurrent system, the special case of which is an asyn...
We present a class of Stochastic Automata Networks (SAN) which exhibit a product form solution if so...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
We discuss a new model for the analysis and simulation of stochastic systems which we call stochasti...
International audienceWe discuss conceptional and foundational aspects of Markov automata [22]. We p...
This work deals with automata systems. We define parallel automata systems and parallel communicatin...
We call network of automata a family of partially synchronised automata, i.e. a family of determinis...
International audienceWe present a new kind of synchronization which allows Continuous Time Stochast...
International audienceBulk-Synchronous Parallel (BSP) is a bridging model between abstract execution...
We discuss a new model for the analysis and simulation of stochastic systems which we call stochasti...
Reversible computing is a paradigm of computation that extends the standard forward-only programming...
DOI
Add to ORKG