7 research outputs found
Embedding real-time in stochastic process algebras
We present a stochastic process algebra including immediate
actions, deadlock and termination, and explicit stochastic delays, in the
setting of weak choice between immediate actions and passage of time.
The operational semantics is a spent time semantics, avoiding explicit
clocks. We discuss the embedding of weak-choice real-time process theories
and analyze the behavior of parallel composition in the weak choice
framework
Reconciling real and stochastic time: The need for probabilistic refinement
We conservatively extend anACP-style discrete-time process theorywith discrete stochastic delays. The semantics of the timed delays relies on time additivity and time determinism, which are properties that enable us to merge subsequent timed delays and to impose their synchronous expiration. Stochastic delays, however, interact with respect to a so-called race condition that determines the set of delays that expire first, which is guided by an (implicit) probabilistic choice. The race condition precludes the property of time additivity as the merger of stochastic delays alters this probabilistic behavior. To this end, we resolve the race condition using conditionally- distributed unit delays. We give a sound and ground-complete axiomatization of the process theory comprising the standard set of ACP-style operators. In this generalized setting, the alternative composition is no longer associative, so we have to resort to special normal forms that explicitly resolve the underlying race condition. Our treatment succeeds in the initial challenge to conservatively extend standard time with stochastic time. However, the 'dissection' of the stochastic delays to conditionally-distributed unit delays comes at a price, as we can no longer relate the resolved race condition to the original stochastic delays. We seek a solution in the field of probabilistic refinements that enable the interchange of probabilistic and non deterministic choices.Fil: Markovski, J.. Technische Universiteit Eindhoven; PaĂses BajosFil: D'argenio, Pedro Ruben. Universidad Nacional de CĂłrdoba. Facultad de Matemática, AstronomĂa y FĂsica; Argentina. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas; ArgentinaFil: Baeten, J. C. M.. Technische Universiteit Eindhoven; PaĂses Bajos. Centrum Wiskunde & Informatica; PaĂses BajosFil: De Vink, E. P.. Technische Universiteit Eindhoven; PaĂses Bajos. Centrum Wiskunde & Informatica; PaĂses Bajo
Embedding real time in stochastic process algebras
We present a stochastic process algebra including immediate actions, deadlock and termination, and explicit stochastic delays, in the setting of weak choice between immediate actions and passage of time. The operational semantics is a spent time semantics, avoiding explicit clocks. We discuss the embedding of weak-choice real-time process theories and analyze the behavior of parallel composition in the weak choice framework
Embedding real time in stochastic process algebras
We present a stochastic process algebra including immediate
actions, deadlock and termination, and explicit stochastic delays, in the
setting of weak choice between immediate actions and passage of time.
The operational semantics is a spent time semantics, avoiding explicit
clocks. We discuss the embedding of weak-choice real-time process theories
and analyze the behavior of parallel composition in the weak choice
framework
Embedding Real Time in Stochastic Process Algebras
Abstract. We present a stochastic process algebra including immediate actions, deadlock and termination, and explicit stochastic delays, in the setting of weak choice between immediate actions and passage of time. The operational semantics is a spent time semantics, avoiding explicit clocks. We discuss the embedding of weak-choice real-time process theories and analyze the behavior of parallel composition in the weak choice framework. Keywords. Stochastic delay, weak choice, race condition, real-time and stochastic process algebra. 1 Introduction Traditionally, process algebras (PAs) like ACP, CCS and CSP are used for quali-tative description and verification of processes. In this setting, process behaviou