An Algebra-Based Method to Associate Rewards with EMPA Terms

@inproceedings{Bernardo1997AnAM,
  title={An Algebra-Based Method to Associate Rewards with EMPA Terms},
  author={Marco Bernardo},
  booktitle={ICALP},
  year={1997}
}
  • M. Bernardo
  • Published in ICALP 7 July 1997
  • Computer Science
We present a simple method to associate rewards with terms of the stochastic process algebra EMPA in order to make the specification and the computation of performance measures easier. The basic idea behind this method is to specify rewards within actions of EMPA terms, so it substantially differs from methods based on modal logic. The main motivations of this method are its ease of use as well as the possibility of defining a notion of equivalence which relates terms having the same reward… 

Exploiting Modal Logic to Express Performance Measures

TLDR
This paper presents a stochastic modal logic which can aid the construction of a reward structure over the model of PEPA and presents a performance specification language which supports high level reasoning about PEPA models, and allows queries about their equilibrium behaviour.

Performance measure sensitive congruences for Markovian process algebras

Performance evaluation with temporal rewards

  • J. Voeten
  • Computer Science
    Perform. Evaluation
  • 2002

Compositional solution of stochastic process algebra models

TLDR
This dissertation is about the solution of Markovian stochastic process algebra (SPA) models and the avoidance of the state-space explosion problem, and considers a true-concurrency semantics for SPA models and investigates its use for an efficient solution of Spa models.

Process algebra for performance evaluation

GSMPA : A Core Calculus With Generally Distributed Durations 1

TLDR
A process algebra for the performance modeling and evaluation of concurrent systems whose activity durations are expressed through general probability distributions and it is argued that in this context the right semantics for algebraic terms is a variant of the ST semantics which accounts for both functional and performance aspects.

Specifying Performance Measures for PEPA

TLDR
A performance specification language which supports high level reasoning about PEPA models, allowing the description of equilibrium (steady-state) measures and the meaning of the specification language can be made formal by examining its foundations in a stochastic modal logic.

Enriching EMPA with Value Passing : A Symbolic Approach based on LookaheadMarco BernardoUniversit

TLDR
The proposal of Hennessy and Lin relying on symbolic labeled transition systems and symbolic bisimulations is adapted to EMPA by providing suitable semantic rules based on lookahead in order to beneet as much as possible from the inherent parametricity of value passing.

Explorer Specifying Performance Measures for PEPA

TLDR
A performance specification language which supports high level reasoning about PEPA models, allowing the description of equilibrium (steady-state) measures and the meaning of the specification language can be made formal by examining its foundations in a stochastic modal logic.

References

SHOWING 1-10 OF 17 REFERENCES

Extended Markovian Process Algebra

TLDR
This work derives a functional semantic model (a transition system labeled on action types only and a performance semantic model) and a Markov chain to analyze an EMPA term and shows that an integrated analysis is not only convenient but also necessary to achieve compositionality.

Specification Styles in Distributed Systems Design and Verification

Queueing Systems

▶ Publishes research on theoretical problems in resource sharing dynamics (in a broad sense), with particular interests in probability and statistics ▶ Publishes rigorous applied probability

Dynamic Probabilistic Systems

A compositional approach to performance modelling

TLDR
Modelling study: multi-server multi-queue systems shows strong equivalence between strong and weak isomorphism and strong bisimilarity.

Algebraic laws for nondeterminism and concurrency

TLDR
The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.

Formalising the Speci cation of Rewards with PEPA", in Proc. of the 4th Workshop on Process Algebras and Performance Modelling (PAPM '96), CLUT

  • Torino (Italy),
  • 1996

\Formalising the Speciication of Rewards with PEPA

  • Proc. of the 4th Workshop on Process Algebras and Performance Modelling (PAPM '96), CLUT
  • 1996