A process-algebraic language for probabilistic I/O automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2761, Issue , 2003, Pages 193-207

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

^a USA   (United States)

Author keywords

Continuous time Markov chains; Process equivalences; Stochastic process algebras; Typing systems and algorithms

Indexed keywords

ALGEBRA; AUTOMATA THEORY; BIOINFORMATICS; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; RANDOM PROCESSES; SEMANTICS; STOCHASTIC SYSTEMS;

ALGEBRAIC LANGUAGES; BEHAVIORAL EQUIVALENCE; BISIMULATION EQUIVALENCES; CONTINUOUS TIME MARKOV CHAIN; OPERATIONAL SEMANTICS; PROCESS EQUIVALENCE; STOCHASTIC PROCESS ALGEBRAS; TYPING SYSTEMS;

COMPUTATIONAL LINGUISTICS;

EID: 35248815426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_13     Document Type: Article

References (19)

1. 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(2):83-154, 1998.
2. E. Brinksma and H. Hermanns. Process algebra and Markov chains. In E. Brinksma, H. Hermanns, and J.-P. Katoen, editors, FMPA 2000: Euro-Summerschool on Formal Methods and Performance Analysis, volume 2090 of Lecture Notes in Computer Science, pages 183-231. Springer-Verlag, 2001.
3. P. Buchholz. Exact performance equivalence: An equivalence relation for stochastic automata. Theoretical Computer Science, 215:263-287, 1999.
4. R. Cleaveland, J. Parrow, and B. U. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of concurrent systems. ACM TOPLAS, 15(1), 1993.
5. R. De Nicola and R. Segala. A process algebraic view of Input/Output Automata. Theoretical Computer Science, 138(2), 1995.
6. S.J. Garland and N.A. Lynch. Using I/O automata for developing distributed systems. In Gary T. Leavens and Murali Sitaraman, editors, Foundations of Component-Based Systems, pages 285-312. Cambridge University Press, 2000.
7. J.-P. Katoen H. Hermanns, U. Herzog. Process algebra for performance evaluation. Theoretical Computer Science, 274:43-97, 2002.
8. J. Hillston. The nature of synchronization. In U. Herzog and M. Rettelbach, editors, Proceedings of the 2nd Workshop on Process Algebra and Performance Modeling, pages 51-70, University of Erlangen, July 1994.
9. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
10. B. Jonsson, K. G. Larsen, and W. Yi. Probabilistic extensions of process algebras. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra. Elsevier, 2001.
11. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
12. N.A. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137-151, 1987.
13. B. Plateau and K. Atif. Stochastic automata networks for modeling parallel systems. IEEE Transactions on Software Engineering, 17:1093-1108, 1991.
14. 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.
15. E. Stark. On behavior equivalence for probabilistic I/O automata and its relationship to probabilistic bisimulation. Journal of Automata, Languages, and Combinatorics, 8(2), 2003. to appear.
16. F.W. Vaandrager. On the relationship between process algebra and input/output automata. In Sixth Annual Symposium on Logic in Computer Science (LICS '91), pages 387-398, Amsterdam, July 1991. Computer Society Press.
17. S.-H. Wu, S.A. Smolka, and E.W. Stark. Compositionality and full abstraction for probabilistic I/O automata. In Proceedings of CONCUR '94 - Fifth International Conference on Concurrency Theory, Uppsala, Sweden, August 1994.
18. 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.
19. D. Zhang, R. Cleaveland, and E.W. Stark. The integrated CWB-NC/PIOATool for functional and performance analysis of concurrent systems. In Proceedings of the Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003). Lecture Notes in Computer Science, Springer-Verlag, April 2003.