AbstractWe give a denotational framework for composing interactive components into closed or open systems and show how to adapt classical domain-theoretic approaches to open systems and to timed systems. For timed systems, prior approaches are based on temporal logics, automata theory, or metric spaces. In this paper, we base the semantics on a CPO with a prefix order, as has been done previously for untimed systems. We show that existence and uniqueness of behaviors are ensured by continuity with respect to this prefix order. Existence and uniqueness of behaviors, however, do not imply that a composition of components yields a useful behavior. The unique behavior could be empty or smaller than expected. We define liveness and show that app...
Part 8: Session 7: Distribution and ConcurrencyInternational audienceWe present a component algebra ...
The analysis of reactive systems requires models representing the system, its interaction with the e...
AbstractWe introduce yet another event-based formalism, that of event automata, which unifies variou...
AbstractWe give a denotational framework for composing interactive components into closed or open sy...
AbstractWe introduce the notion of Timed I/O Components as Timed Automata “á la” Alur & Dill where a...
The actor message-passing model of concurrent computation has inspired new ideas in the areas of k...
We here present an approach to reasoning about actor programs on the basis of temporal logic. Tempor...
International audienceUniversal Timed Concurrent Constraint Programming (utcc) is a declarative mode...
We consider timed system behaviors seen as functions acting over streams of timed events (timed stre...
Programming embedded and cyber-physical systems requires attention not only to functional behavior a...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
A foundational model of concurrency is developed in this thesis. We examine issues in the design of ...
We present a component algebra and an associated logic for heterogeneous timed systems that can be i...
Programming embedded and cyber-physical systems requires attention not only to functional behavior a...
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for m...
Part 8: Session 7: Distribution and ConcurrencyInternational audienceWe present a component algebra ...
The analysis of reactive systems requires models representing the system, its interaction with the e...
AbstractWe introduce yet another event-based formalism, that of event automata, which unifies variou...
AbstractWe give a denotational framework for composing interactive components into closed or open sy...
AbstractWe introduce the notion of Timed I/O Components as Timed Automata “á la” Alur & Dill where a...
The actor message-passing model of concurrent computation has inspired new ideas in the areas of k...
We here present an approach to reasoning about actor programs on the basis of temporal logic. Tempor...
International audienceUniversal Timed Concurrent Constraint Programming (utcc) is a declarative mode...
We consider timed system behaviors seen as functions acting over streams of timed events (timed stre...
Programming embedded and cyber-physical systems requires attention not only to functional behavior a...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
A foundational model of concurrency is developed in this thesis. We examine issues in the design of ...
We present a component algebra and an associated logic for heterogeneous timed systems that can be i...
Programming embedded and cyber-physical systems requires attention not only to functional behavior a...
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for m...
Part 8: Session 7: Distribution and ConcurrencyInternational audienceWe present a component algebra ...
The analysis of reactive systems requires models representing the system, its interaction with the e...
AbstractWe introduce yet another event-based formalism, that of event automata, which unifies variou...