Quantifying the dynamic behavior of process algebras

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

Volumn 2165, Issue , 2001, Pages 184-199

  Buchholz, Peter ^a   Kemper, Peter ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Bisimulation; Congruence; Process algebras; Semiring

Indexed keywords

RANDOM PROCESSES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

BISIMULATION EQUIVALENCES; BISIMULATIONS; CONGRUENCE; DYNAMIC BEHAVIORS; NEW APPROACHES; PROCESS ALGEBRAS; SEMI-RING; STOCHASTIC PROCESS ALGEBRAS;

ALGEBRA;

EID: 84957796394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44804-7_12     Document Type: Conference Paper

References (25)

1. R. Agrawal, F. Baccelli, and R. Rajan. An algebra for queueing networks with time varying service. ResearchRep ort 3435, INRIA, 1998.
2. F. Baccelli, G. Cohen, G. Olsder, and J. Quadrat. Synchronization and Linearity. John Wiley and Sons, 1992.
3. F. Baccelli, B. Gaujal, and D. Simon. Analysis of preemptive periodic real time systems using the (max,plus) algebra. Research Report 3778, INRIA, 1999.
4. F. Baccelli and D. Hong. TCP is (max/+) linear. In Proc. SIGCOM 2000. ACM, 2000.
5. M. Bernado and R. Gorrieri. A tuturial of EMPA: A theory of concurrent processes withnondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1–54, 1998.
6. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and distributed computation. Prentice Hall, 1989.
7. P. Buchholz. Die strukturierte Analyse Markovscher Modelle (in German). IFB 282. Springer, 1991.
8. P. Buchholz. Markovian process algebra: composition and equivalence. In [17].
9. P. Buchholz. Bisimulation for automata with transition costs. submitted, 2000.
10. C. S. Chang. Performance guarantess in communication networks. Springer, 1999.
11. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: a semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36–72, 1993.
12. P. R. D’Argenio, H. Hermanns, and J. P. Katoen. On generative parallel composition. In Proc. ProbMiv 98, Electronic Notes on Theor. Computer Sc., 21, 1999.
13. D. Gross and D. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operations Research, 32(2):926–944, 1984.
14. H. Hansson. Time and probability for the formal design of distributed systems. Phd thesis, University of Uppsala, 1991.
15. H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic process algebras – between LOTOS and Markov chains. Computer Networks and ISDN Systems, 30(9/10):901–924, 1998.
16. H. Hermanns and M. Rettelbach. Syntax, semantics, equivalences, and axioms for MTIPP. In [17]
17. U. Herzog and M. Rettelbach, eds. Proc. 2nd Work. Process Algebras and Performance Modelling Arbeitsberichte IMMD, Univ. Erlangen, Germany, no. 27, 1994.
18. J. Hillston. The nature of synchronisation. In [17].
19. J. Hillston. A compositional approach for performance modelling. Phd thesis, University of Edinburgh, Dep. of Comp. Sc., 1994
20. J. Hillston. Compositional Markovian modelling using a process algebra. In W. J. Stewart, editor, Computations with Markov Chains, pages 177–196. Kluwer, 1995.
21. C. Hoare. Communicating sequential processes. Prentice Hall, 1985.
22. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1–28, 1991.
23. R. Milner. Communication and concurrency. Prentice Hall, 1989.
24. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference on Theoretical Computer Science, pages 167–183. Springer LNCS 104, 1981.
25. R. van Glabbek, S. Smolka, B. Steffen, and C. Tofts. Reactive, generative and stratified models for probabilistic processes. In Proc. LICS’90, 1990.