Symbolic Approaches to Probability Distributions in Process Algebra
Formal Aspects of Computing · 2000-12 · 12 (5) · 392-415
DOI: 10.1007/pl00013291 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formal Aspects of Computing, 2000-12. Verfasst von C. Tofts. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 15 Literaturangaben.
Abstract (Originalsprache)
One of the major problems in modelling with process algebras is that of state explosion. With the addition of information describing duration, models become more exposed to growth in the size of the description of their behaviour. We describe a symbolic approach to the description of duration information within a probabilistic calculus that has two benefits: firstly we can describe behaviour without instantiating distributions; secondly we can control the growth in our system representation as a trade against model accuracy. We can compute upper bounds on performance without the inclusion of additional state information in our systems. A large example, from the discrete event simulation literature, is presented to demonstrate the effectiveness of the approach.
Zitieren
APA
Tofts, C. (2000). Symbolic Approaches to Probability Distributions in Process Algebra. Formal Aspects of Computing, 12(5), 392-415. https://doi.org/10.1007/pl00013291
Vancouver
Tofts C. Symbolic Approaches to Probability Distributions in Process Algebra. Formal Aspects of Computing. 2000;12(5):392-415. doi:10.1007/pl00013291
BibTeX
@article{Tofts2000,
author = {Tofts, C.},
title = {Symbolic Approaches to Probability Distributions in Process Algebra},
journal = {Formal Aspects of Computing},
year = {2000},
volume = {12},
number = {5},
pages = {392--415},
doi = {10.1007/pl00013291}
}
EUVIMED