Exploiting modal logic to express performance measures

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

Volumn 1786, Issue , 2000, Pages 247-261

  Clark, Graham ^a   Gilmore, Stephen ^a   Hillston, Jane ^a   Ribaudo, Marina ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; HIGH LEVEL LANGUAGES; RANDOM PROCESSES; RECONFIGURABLE HARDWARE; SPECIFICATION LANGUAGES; SPECIFICATIONS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

COMPONENT-BASED CONSTRUCTION; HIGH-LEVEL REASONING; MODAL LOGIC; NUMERICAL SOLUTION; PERFORMANCE MEASURE; PERFORMANCE SPECIFICATIONS; STOCHASTIC PROCESS ALGEBRAS;

COMPUTER CIRCUITS;

EID: 84958758786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46429-8_18     Document Type: Conference Paper

References (22)

1. P. G. Harrison and N. M. Patel. Performance Modelling of Communication Networks and Computer Architectures. International Computer Science Series. Addison-Wesley, 1993.
2. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Mod-elling with Generalized Stochastic Petri Nets. John Wiley, 1995.
3. J. F. Meyer, A. Movaghar, and W. H. Sanders. Stochastic activity networks: Structure, behavior and application. In Proc of Int. Workshop on Timed Petri Nets, pages 106-115, Torino, Italy, 1985. IEEE Computer Society Press.
4. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
5. N. Götz, U. Herzog, and M. Rettelbach. Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis using Stochastic Process Algebras. In Performance'93, 1993.
6. M. Bernardo and R. Gorrieri. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Com-puter Science, 201:1-54, July 1998.
7. R. A. Howard. Dynamic Probabilistic Systems, volume II: Semi-Markov and Decision Processes, chapter 13, pages 851-915. John Wiley & Sons, New York, 1971.
8. J. Bryans, H. Bowman, and J. Derrick. Analysis of a Multimedia Stream using Stochastic Process Algebra. In C. Priami, editor, Proc. of 6th Int. Workshop on Process Algebras and Performance Modelling, pages 51-69, Nice, France, September 1998.
9. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
10. M. Huth and M. Kwiatkowska. Quantitative analysis and model checking. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 111-122, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.
11. V. Hartonas-Garmhausen. Probabilistic Symbolic Model Checking with Engineering Models and Applications. PhD thesis, Carnegie Mellon University, 1998.
12. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In LICS: IEEE Symposium on Logic in Computer Science, 1998.
13. S. Gilmore and J. Hillston. The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling. In G. Haring and G. Kotsis, editors, Proc. of 7th Conf. on Mod. Techniques and Tools for Computer Perf. Eval., volume 794 of LNCS, pages 353-368, 1994.
14. G. Clark. Formalising the Specification of Rewards with PEPA. In Proc. of 4th Process Algebras and Performance Modelling Workshop, pages 139-160, July 1996.
15. G. Clark, S. Gilmore, and J. Hillston. Specifying performance measures for PEPA. In J. P. Katoen, editor, Proc. of 5th Int. AMAST Workshop on Real-Time and Probabilistic Systems, volume 1601 of LNCS, pages 211-227, Bamberg, Germany, 1999. Springer-Verlag.
16. S. Gilmore, J. Hillston, and M. Ribaudo. An efficient algorithm for aggregating PEPA models. To appear in IEEE Transactions on Software Engineering, 2000.
17. G. Clark, S. Gilmore, J. Hillston, and N. Thomas. Experiences with the PEPA Performance Modelling Tools. IEE Proceedings|Software, 146(1):11-19, February 1999. Special issue of papers from 14th UK Performance Engineering Workshop.
18. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
19. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, January 1985.
20. G. Clark. Techniques for the Construction and Analysis of Algebraic Performance Models. PhD thesis, The University of Edinburgh, 2000.
21. M. Bernardo. An Algebra-Based Method to Associate Rewards with EMPA Terms. In P. Degano, R. Gorrieri, and A. Marchetti Spaccamela, editors, 24th Int. Collo-quium on Automata, Languages and Programming, volume 1256 of LNCS, pages 358-368, Bologna, Italy, July 1997. Springer-Verlag.
22. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous time Markov chains. In Proceedings of CONCUR'99, volume 1664 of LNCS, pages 146-162, 1999.