Extended Markovian Process Algebra (EMPA) is a process algebra suitable for expressing functional and performance aspects of concurrent systems. It is equipped with an operational interleaving semantics, a functional semantics, a Markovian semantics and an operational net semantics. In this paper we apply an integrated approach based on EMPA for mod-eling and analyzing concurrent systems to the...

In previous work we described how the process algebra based language PSF can be used in software engineering, using the ToolBus, a coordination architecture also based on process algebra, as implementation model. In this article we summarize that work and describe the software development process more formally by presenting the tools we use in this process in a CASE setting, leading to the PSF-...

We develop an elementary theory of process structure, a mathematical object which is intended to capture a basic aspect of concurrent processes in a simple way. It has two kinds of presentations: one underlies many extant process theories and another has a more geometric avour. We prove these are essentially equivalent. The theory forms a basis of P-algebra, a general semantic structure for con...

The paper describes a Petri net as well as a structural operational semantics for an algebra of process expressions. It speciically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The main result is that it is possible to obtain a framework where process expressions can be given two, entirely consistent, kind...

In this paper, we present a number of closely related models of process algebra [2, 3, 4], called finite-graph models. In a finite-graph model of process algebra, each process is a bisimulafion class of a particular kind of process graphs, called recursive process graphs. Just as in the standard graph model [I], each guarded recursive specification has exactly one solution in a finite-graph mod...

Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In this paper, we propose a strategy which allows us the analysis and the choice of the best optimisation, by focusing on the hot part of an assembly code. In our approach, for each optimisation applied, the code of the ho...

The formalism of modal transition systems (MTS) is a well established framework for systems specification as well as abstract interpretation. Nevertheless, due to incapability to capture some useful features, various extensions have been studied, such as e.g. mixed transition systems or disjunctive MTS. Thus a need to compare them has emerged. Therefore, we introduce transition system with obli...

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...

We propose a probabilistic process algebra built on top of a fully parallel calculus. Being strongly inspired by LOTOS, our model allows for multi-party synchronization in process parallel composition. Anyway, departing from LOTOS, it has a non-interleaving, multiset, semantics: Independent actions are performed simultaneously, whereas synchronization is achieved by means of the minimal, implic...

Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process a...