Compositional analysis of expected delays in networks of probabilistic I/O automata

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 466-477

  Stark, Eugene W ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATION THEORY; RATIONAL FUNCTIONS;

COMPLETION PROBABILITY; COMPLETION TIME; COMPOSITIONAL ANALYSIS; CONCURRENT SYSTEMS; FORMAL POWER SERIES; LINEAR REPRESENTATION; PROBABILISTIC CHOICES; SYMBOLIC CALCULATION;

COMPUTER CIRCUITS;

EID: 85010330309     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705680     Document Type: Conference Paper

References (17)

1. [BDG98] 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, 1998. To appear.
2. [BR84] J. Berstel and C. Reutenauer. Rational Series and Their Languages, volume 12 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1984.
3. [CCM97] S. Campos, E. M. Clarke, and M. Minea. Symbolic techniques for formally verifying industrial systems. Science of Computer Programming, 29:79-88, 1997.
4. [CP71] J. W. Carlyle and A. Paz. Realizations by stochastic finite automata. J. Comput. System Set., 5:26-40, 1971.
5. [Dij93] Nico M. van Dijk. Queuemg Networks and Product Forms: A Systems Approach. Series in Systems and Optimization. John Wiley & Sons, 1993.
6. [GHR93] N. Gotz, U. Herzog, and M. Rettelbach. Multiprocessor and distributed system de-sign: The integration of functional specification and performance analysis using stochastic process algebras. In Proceedings of PERFORMANCE '93, pages LNCS 729:121-146. Springer-Verlag, 1993.
7. [Hi196] J. Hillston. A Compositional Approach to Performance Modelling. Cambridge Univer-sity Press, 1996.
8. [How71] Ronald A. Howard. Dynamic Probabilistic Systems, Volume II: Semi-Markov and De-cision Processes, volume 2 of Series in Decision and Control. John Wiley & Sons, 1971.
9. [LSS94] N. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed al-gorithms. In Proceedings of the 13th ACM PODC, Los Angeles, CA, August 1994.
10. [MBC84] M. Ajmone Marsan, G. Balbo, and G. Conte. A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Trans, on Computer Systems, 2:143-172, 1984.
11. [Pri96] C. Priami. Stochastic π-calculus with general distributions. In M. Ribaudo, editor, Proceedings of the Fourth Workshop on Process Algebras and Performance Modelling, Torino, Italy, 1996.
12. [PS95] A. Pogosyants and R. Segala. Formal verification of time properties for randomized distributed algorithms. In Proceedings of the 14th ACM PODC, Ottawa, Ontario, Canada, August 1995.
13. [Sch61a] M. P. Schiitzenberger. On a special class of recurrent events. Annals Math. Stat., 32:1201-1213, 1961.
14. [Sch61b] M. P. Schutzenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
15. [SS97] E. W. Stark and S. A. Smolka. Compositional analysis of expected delays in networks of probabilistic I/O automata (full version). Technical report, SUNY at Stony Brook Department of Computer Science, 1997. http://www.cs.sunysb.edu/stark/REPORTS/delays.ps.Z.
16. [WSS97] 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.
17. [Wu96] S.-H. Wu. Composition and Behaviors of Probabilistic Input/Output Automata. PhD thesis, SUNY at Stony Brook, 1996.