0

Process algebra provides essential tools for studying distributed and concurrent systems. Stochastic process algebra (i.e., YAWN ) enhances the process algebra with stochastic extensions which is perfect to analyze phenomena of process with executing durations in the real world. What’s more, in system runs, value passing is tightly bounded with their processes. However, stochastic process algeb...

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

This paper proves that labelled flows are expressive enough to contain all process algebras which are a standard model for concurrency. More precisely, we construct the space of execution paths and of higher dimensional homotopies between them for every process name of every process algebra with any synchronization algebra using a notion of labelled flow. This interpretation of process algebra ...

Abstract The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather than weak bisimulation semantics [11, 20]. The version using relative timing is discussed extensively, versions using absolute and parametric timing are presented in brief. A term model and a graph model are pres...

The syntactic nature and compositionality characteristic of stochastic process algebras make models to be easily understood by human beings, but not convenient for machines as well as people to directly carry out mathematical analysis and stochastic simulation. This paper presents a numerical representation schema for the stochastic process algebra PEPA, which can provide a platform to directly...

Over the past fifteen years, there has been intensive study of formal systems that can model concurrency and communication. Two such systems are the Calculus of Communicating Systems, and the Algebra of Communicating Processes. The objective of this paper has two aspects; (1) to study the characteristics and features of these two systems, and (2) to investigate two interesting formal proofs con...

In this paper we present a probabilistic version of the axiom system A CP appropriate for the (algebraic) formal description of pIobabilisti.c processes. The proposed formalism is built in a modular way, first Basic Process Algebra (prBPA) is constructed which afterwards is extended by parallel composition (prACP). Probabilities are introduced by an operator for internal probabilistic choice. I...

ion in absolute timing. where all timing refers to an absolute clock. Here again. we only consider the two-phase version. In section 4. we have discrete time process algebra with parametric timing. where absolute and relative timing are integrated. For parametric timing. we introduce a model based on time spectrum sequences. An underlying viewpoint of the present paper is that for a given time ...