In the 1980s process algebras became widely accepted formalisms for describing and
analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems …

This paper describes symbolic techniques for the construction, representation and analysis
of large, probabilistic systems. Symbolic approaches derive their efficiency by exploiting …

Two types of techniques are usually adopted in language differentiation: token matching and
statistical analysis. In this paper we present a method which uses a combined analysis of …

This paper gives a summary of some of the work of the Performance Evaluation Process
Algebra (PEPA) project, which was awarded the 2004 Roger Needham Award from the …

We present a new methodology based on the stochastic ordering, algorithmic derivation of
simpler Markov chains and numerical analysis of these chains. The performance indices …

Abstract We consider Stochastic Automata Networks (SAN) in continuous time and we prove
a sufficient condition for the steady-state distribution to have product form. We consider SAN …

We define a mechanism for specifying performance queries which combine instantaneous
observations of model states and finite sequences of observations of model activities. We …

Many Markovian stochastic structured modeling formalisms like Petri nets, automata
networks and process algebra represent the infinitesimal generator of the underlying Markov …

Web service instances are often replicated to allow service provision to scale to support
larger population sizes of users. However, such systems are difficult to analyse because the …

We consider Stochastic Automata Networks (SANs) in continuous time and we prove a
sufficient condition for the steady-state distribution to have product form. We consider …