Increasing sizes of present-day distributed software systems call for coordination models which are both \emph{modular} and \emph{scalable}. Precise modelling of real-life applications further requires the notion of \emph{real-time}. In this paper, we present a modular formal development of a compositional model for real-time coordination in dataflow networks. While real-time dataflow networks are typically asynchronous, our approach includes coordination patterns which combine, but are not limited to, synchrony and asynchrony. We define a constraint- and SAT-based encoding, which allows us to benefit from high-end constraint solving techniques when inspecting valid interactions of the system
Abstract. We propose a framework for component-based modeling of distributed systems. It provides se...
textabstractWe introduce a state-based language for programming dynamically changing network...
International audienceProcess Networks are a means to describe streaming embedded applications. They...
Modularity is advocated as a solution for the design of large systems, the mathematical translation ...
International audienceModularity is advocated as a solution for the design of large systems; the mat...
A dataflow network consists of nodes that communicate over perfect unbounded FIFO channels. For dat...
A dataflow network consists of nodes that communicate over perfect FIFO channels. For dataflow netwo...
AbstractModularity is advocated as a solution for the design of large systems; the mathematical tran...
Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis...
Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis)...
AbstractWe give a compositional denotational semantics for a real-time distributed language, based o...
We consider a model of real-time network computation in which synchronous communication events occur...
We introduce Oikos_adtl, a specification language for distributed systems based on asynchronous com...
We develop an algebraic theory of synchronous dataflow networks. First, a basic algebraic theory of ...
We discuss the aspect of synchronisation in the language design of the asynchronous dataflow languag...
Abstract. We propose a framework for component-based modeling of distributed systems. It provides se...
textabstractWe introduce a state-based language for programming dynamically changing network...
International audienceProcess Networks are a means to describe streaming embedded applications. They...
Modularity is advocated as a solution for the design of large systems, the mathematical translation ...
International audienceModularity is advocated as a solution for the design of large systems; the mat...
A dataflow network consists of nodes that communicate over perfect unbounded FIFO channels. For dat...
A dataflow network consists of nodes that communicate over perfect FIFO channels. For dataflow netwo...
AbstractModularity is advocated as a solution for the design of large systems; the mathematical tran...
Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis...
Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis)...
AbstractWe give a compositional denotational semantics for a real-time distributed language, based o...
We consider a model of real-time network computation in which synchronous communication events occur...
We introduce Oikos_adtl, a specification language for distributed systems based on asynchronous com...
We develop an algebraic theory of synchronous dataflow networks. First, a basic algebraic theory of ...
We discuss the aspect of synchronisation in the language design of the asynchronous dataflow languag...
Abstract. We propose a framework for component-based modeling of distributed systems. It provides se...
textabstractWe introduce a state-based language for programming dynamically changing network...
International audienceProcess Networks are a means to describe streaming embedded applications. They...