Abstract
In this talk, I give an overview of some recent work, by my colleagues and me at Stony Brook, concerning compositional specification and performance analysis techniques for finite-state reactive systems in which probability and timing play a significant role.
Research supported in part by AFOSR Grant F49620-96-1-0087.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Bernardo, L. Donatiello, and R. Gorrieri. A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems. Information and Computation, 144:83–154, August 1998.
J. Berstel and C. Reutenauer. Rational Series and Their Languages, volume 12 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1984.
J. Hillston. Compositional Markovian modelling using a process algebra. In W. Stewart, editor, Proceedings of the Second International Workshop on Numerical Solution of Markov Chains: Computations with Markov Chains, Raleigh, North Carolina, January 1995. Kluwer Academic Press.
J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
R. A. Howard. Dynamic Probabilistic Systems, Volume II: Semi-Markov and Decision Processes, volume 2 of Series in Decision and Control. John Wiley & Sons, 1971.
H. Hermanns and M. Rettelbach. Syntax, semantics, equivalences, and axioms for MTIPP. In U. Herzog and M. Rettlebach, editors, Proc. of 2nd Workshop on Process Algebras and Performance Modelling, Erlangen-Regensberg, Germany, July 1994. Universität Erlangen.
N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
E. Stark and G. Pemmasani. Implementation of a compositional performance analysis algorithm for probabilistic I/O automata. In Proceedings of 1999 Workshop on Process Algebra and Performance Modeling (PAPM99). Prensas Universitarias de Zaragoza, September 1999.
E. W. Stark and S. Smolka. Compositional analysis of expected delays in networks of probabilistic I/O automata. In Proc. 13th Annual Symposium on Logic in Computer Science, pages 466–477, Indianapolis, IN, June 1998. IEEE Computer Society Press.
W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
S.-H. Wu, S. A. Smolka, and E. W. Stark. Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science, 176(1–2):1–38, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stark, E.W. (2000). Compositional Performance Analysis Using Probabilistic I/O Automata. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-44618-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67897-7
Online ISBN: 978-3-540-44618-7
eBook Packages: Springer Book Archive