Abstract
We introduce a framework to study stochastic systems, i.e. systems in which the time of occurrence of activities is a general random variable. We introduce and discuss in depth a stochastic process algebra (named ♤) adequate to specify and analyse those systems. In order to give semantics to ♤, we also introduce a model that is an extension of traditional automata with clocks which are basically random variables: the stochastic automata model. We show that this model and ♤ are equally expressive. Although stochastic automata are adequate to analyse systems since they are finite objects, they are still too coarse to serve as concrete semantic objects. Therefore, we introduce a type of probabilistic transition system that can deal with arbitrary probability spaces. In addition, we give a finite axiomatisation for ♤ that is sound for the several semantic notions we deal with, and complete for the finest of them. Moreover, an expansion law is straightforwardly derived.
Supported by the NWO/SION project 612-33-006.
Chapter PDF
Similar content being viewed by others
Keywords
References
R. Alur, C. Courcoubetis, and D. Dill. Model-checking for probabilistic real-time systems. In J. Leach Albert, B. Monien, and M. Rodriguez, eds., Proceedings 18` h ICALP, Madrid, LNCS 510, pp 113–126. Springer, 1991.
R. Alur and D. Dill. A theory of timed automata. Theor. Comput. Sci., 126: 183–235, 1994.
J.C.M. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. In E. Best, ed., Proceedings CONCUR 93, Hildesheim, Germany, LNCS 715, pp 477–492. Springer, 1993.
M. Bernardo and R. Gorrieri. Extended Markovian process algebra. In U. Montanari and V. Sassone, eds., Proceedings CONCUR 96, Pisa, Italy, LNCS 1119, pp 314–330. Springer, 1996.
M. Bravetti, M. Bernardo, and R. Gorrieri. From EMPA to GSMPA: allowing for general distributions. In E. Brinksma and A. Nymeyer, eds., Proceedings PAPM’97, pp 17–33. University of Twente, June 1997.
E. Brinksma, J.-P. Katoen, R. Langerak, and D. Latella. A stochastic causality-based process algebra. The Computer Journal, 38 (6): 552–565, 1995.
P.R. D’Argenio and E. Brinksma. A calculus for timed automata (Extended abstract). In B. Jonsson and J. Parrow, eds., Proceedings FTRTFT’96, Uppsala, Sweden, LNCS 1135, pp 110–129. Springer, 1996.
P.R. D’Argenio, J.-P. Katoen, and E. Brinksma. An algebraic approach to the specification of stochastic systems. Technical Report CTIT-98–02. University of Twente, 1998.
R.J. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Infor. ê1 Comput., 121: 59–80, 1995.
P.W. Glynn. A GSMP formalism for discrete event simulation. Proceedings of the IEEE, 77 (1): 14–23, 1989.
N. Götz, U. Herzog, and M.Rettelbach. TIPP - Introduction and application to protocol performance analysis. In H. König, ed., Formale Beschreibungstechniken für verteilte Systeme, FOKUS series. Saur Publishers, 1993.
H.A. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proceedings 11th IEEE Real-Time Systems Symposium, pp 278–287, Lake Buena Vista, Florida, December 1990.
P. Harrison and B. Strulo. Stochastic process algebra for discrete event simulation. In F. Bacelli, A. Jean-Marie, and I. Mitrani, eds., Quantitative Methods in Parallel Systems, Esprit Basic Research Series, pp 18–37. Springer, 1995.
T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Infor. Comput., 111: 193–244, 1994.
H. Hermanns and M.Rettelbach. Syntax, semantics, equivalences, and axioms for MTIPP. In Proceedings PAPM’94, pp 71–87. University of Erlangen, July 1994.
J. Hillston. A Compositional Appro. ach to Performance Modelling. Distinguished Dissertation in Computer Science. Cambridge University Press, 1996.
K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Infor. F-Comput., 94: 1–28, 1991.
R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
A. Pnueli and L.D. Zuck. Probabilistic verification. Infor. Comput., 103: 1–29, 1993.
C. Priami. Stochastic ir-calculus with general distributions. In [21], pp 41–57.
M. Ribaudo, ed. Proceedings PAPM’96, Torino, Italy. Università di Torino, 1996.
J.J.M.M. Rutten and E. de Vink. Bisimulation for probabilistic transition systems: a coalgebraic approach (extended abstract). In Proceedings 24`h ICALP, Bologna, LNCS 1256, pp 460–470. Springer, 1997.
R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2 (2): 250–273, 1995.
A.N. Shiryaev. Probability. Springer, second edition, 1996.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite state programs. In Proceedings 26th FOCS, Portland, pp 327–338. IEEE Comp. Soc. Press, 1985.
W. Whitt. Continuity of generalized semi-Markov processes. Math. Oper. Res., 5: 494–501, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
D’Argenio, P.R., Katoen, JP., Brinksma, E. (1998). An Algebraic Approach to the Specification of Stochastic Systems (Extended Abstract). In: Gries, D., de Roever, WP. (eds) Programming Concepts and Methods PROCOMET ’98. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35358-6_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-35358-6_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6299-0
Online ISBN: 978-0-387-35358-6
eBook Packages: Springer Book Archive