Sciweavers

4353 search results - page 1 / 871
» Expressiveness of Process Algebras
Sort
View
ENTCS
2008
94views more  ENTCS 2008»
13 years 5 months ago
Expressiveness of Process Algebras
We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.
Joachim Parrow
CALCO
2005
Springer
76views Mathematics» more  CALCO 2005»
13 years 10 months ago
Strong Splitting Bisimulation Equivalence
We present ACPc , a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms fo...
Jan A. Bergstra, C. A. Middelburg
WOSP
2004
ACM
13 years 10 months ago
Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models
This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are ...
Ashok Argent-Katwala, Jeremy T. Bradley, Nicholas ...
ENTCS
2008
91views more  ENTCS 2008»
13 years 5 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
EPEW
2008
Springer
13 years 6 months ago
State-Aware Performance Analysis with eXtended Stochastic Probes
We define a mechanism for specifying performance queries which combine instantaneous observations of model states and finite sequences of observations of model activities. We reali...
Allan Clark, Stephen Gilmore