Process algebra for performance evaluation

Theoretical Computer Science

Volumn 274, Issue 1-2, 2002, Pages 43-87

  Hermanns, Holger ^a   Herzog, Ulrich ^b   Katoen, Joost Pieter ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Axiomatisation; Bisimulation; Continuous time Markov chain; Lumpability; Performance evaluation; Process algebra; Resource sharing systems; Semantics

Indexed keywords

ALGEBRA; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SIMULATION; LARGE SCALE SYSTEMS; SEMANTICS;

AXIOMATIZATION; RESOURCE SHARING SYSTEMS;

MARKOV PROCESSES;

EID: 0037028876     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00305-4     Document Type: Conference Paper

References (108)

1. A LOTOS extension for the performance analysis of distributed systems
2. A theory of timed automata
3. Real time process algebra
4. Axiomatizing probabilistic processes: ACP with generative probabilities
5. Weak bisimulation for fully probabilistic processes
6. Approximate symbolic model checking of continuous-time Markov chains
7. An algebra-based method to associate rewards with EMPA terms
8. TwoTowers: A tool integrating functional and performance analysis of concurrent systems
9. Modeling and analyzing concurrent systems with MPA
10. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
11. Formal performance modelling and evaluation of an adaptive mechanism for packetised audio over the Internet
12. Semi-numerical solution of stochastic process algebra models
13. Converging towards a timed LOTOS standard
14. Towards performance evaluation with general distributions in process algebras
15. Performance analysis and true concurrency semantics
16. A stochastic causality-based process algebra
17. Exact and ordinary lumpability in finite Markov chains
18. Markovian process algebra: Composition and equivalence
19. Formalising the specification of rewards with PEPA
20. A use of complex probabilities in the theory of stochastic processes
21. A calculus for timed automata (extended abstract)
22. On generative parallel composition
23. An algebraic approach to the specification of stochastic systems (extended abstract)
24. General purpose discrete-event simulation using (sign)
25. A compositional approach to generalised semi-Markov processes
26. A general conservative extension theorem in process algebras with inequalities
27. How to specify and verify the long-run average behavior of probabilistic systems
28. Considerations on the insularity of performance evaluation
29. Automatic generation of verifiable cache coherence simulation models from high-level specifications
30. The PEPA workbench: A tool to support a process algebra-based approach to performance modelling
31. Specifications in stochastic process algebra for a robot control problem
32. Reactive, generative, and stratified models of probabilistic processes
33. Branching time and abstraction in bisimulation semantics
34. Real-time calculi and expansion theorems
35. Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras
36. Algebraic process verification
37. Markovian analysis of large finite-state machines
38. A calculus for communicating systems with time and probabilities
39. Exploiting quasi-reversible structures in Markovian process algebra models
40. Stochastic process algebra for discrete event simulation
41. Performance engineering as an integral part of system design
42. Compositional performance modelling with the TIPP-TOOL
43. Stochastic process algebras as a tool for performance and dependability modelling
44. Stochastic process algebras: Between LOTOS and Markov chains
45. Automated compositional Markov chain generation for a plain-old telephone system
46. Priority and maximal progress are completely axiomatisable (extended abstract)
47. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains
48. Syntax semantics, equivalences, and axioms for MTIPP
49. Towards a superset of LOTOS for performance prediction
50. Formal characterisation of immediate actions in SPA with non-deterministic branching
51. Bisimulation algorithms for stochastic process algebras and their BDD-based implementation
52. Formal description, time and performance analysis: A framework
53. A concept for graph-based stochastic process algebras, generally distributed activity times, and hierarchical modelling
54. Stochastic process algebras applied to failure modelling
55. PEPA: Performance enhanced process algebra
56. Exploiting symmetry in solution: Decomposing composed models
57. A simple time scale decomposition technique for stochastic process algebras
58. A syntactic analysis of reversible PEPA processes
59. Product-form solutions for a class of PEPA models
60. Formal methods for real-time and probabilistic systems
61. Stochastic simulation of event structures
62. Extensions of stochastic process algebras for performance and dependability modelling
63. Bisimulation through probabilistic testing
64. An introduction to ET-LOTOS for the description of time-sensitive systems
65. Probabilistic and prioritized models of timed CSP
66. Throughput approximation of decision-free processes using decomposition
67. LOTOS extended with probabilistic behaviours
68. A temporal calculus of communicating systems
69. An overview and synthesis on timed process algebras
70. Algebraic specification-based performance analysis of communication protocols
71. Stochastic automata networks for modelling parallel systems
72. Stochastic π-calculus
73. Stochastic π-calculus with general distributions
74. Performance description and analysis for distributed systems using a variant of LOTOS
75. Performance and reliability analysis using directed acyclic graphs
76. An operational semantics for timed CSP
77. Probabilistic simulations for probabilistic processes
78. Towards a product-form solution of stochastic process algebras
79. Processes with probabilities, priorities and time
80. Compositional performance analysis
81. Deriving queuing networks performance models from annotated LOTOS specifications
82. Automatic verification of probabilistic concurrent finite state programs
83. Real-time behaviour of asynchronous agents
84. Composition and behaviors of probabilitistic I/O automata
85. Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time