COREA: A Synchronous Calculus of Parallel Communicating Reactive Automata
نویسنده
چکیده
Reactive systems often require temporal and logical safety , concurrency and determinism. Several asynchronous or strong synchronous answers have been proposed to this problem. However, \asyn-chronous" languages such as CSP or CCS generally force the user to choose between determinism and concurrency. On the other hand, strong synchronous implementations are mainly sequential. The aim of this paper is to present a new paradigm for concurrent reactive programming, weak synchronism, responding to both concurrency and determinism.
منابع مشابه
Programming Communicating Distributed Reactive Automata: the Weak Synchronous Paradigm
The aim of this paper is to present a new paradigm for reactive and real-time distributed programming: weak synchronism. We deene a small language for communicating reactive automata, and characterize it by an operational semantics. We show that weak synchro-nism provides a deterministic semantics of concurrency and allows physical distributed implementations. This weak synchronous paradigm can...
متن کاملA Process Algebra for Stochastic Music Composition
The Musical Weighted Synchronous Calculus of Communicating Systems (MWSCCS) process algebra is presented. The algebra permits the design of stochastic automata which perform a variety of musically interesting behaviours, including both vertical and horizontal reactive behaviour between processes. A notable feature is the ability to formally model complex stochastic musical systems with a simple...
متن کاملA Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
We consider the calculus of Communicating Sequential Processes (CSP) [8] extended with action-guarded probabilistic choice and provide it with an operational semantics in terms of a suitable extension of Larsen and Skou’s [14] reactive probabilistic transition systems. We show that a testing equivalence which identifies two processes if they pass all tests with the same probability is a congrue...
متن کاملOn the power of parallel communicating Watson-Crick automata systems
Parallel communicating Watson-Crick automata systems were introduced in [2] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [5], that for Watson-Crick finite automata, the complementarity relation plays no active r...
متن کاملA Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patterns among systems, thus extending I/O automata. Furthermore, for some patterns the language recognized by a team automaton can be specified via those languages recognized by its components. We introduce a process calcul...
متن کامل