Lectures on Formal Methods and Performance Analysis: First EEF/Euro Summer School on Trends in Computer Science Berg en Dal, The Netherlands, July 3-7, 2000. Revised Lectures, Volume 1
Traditionally, models and methods for the analysis of the functional correctness of reactive systems, and those for the analysis of their performance (and - pendability) aspects, have been studied by di?erent research communities. This has resulted in the development of successful, but distinct and largely unrelated modeling and analysis techniques for both domains. In many modern systems, however, the di?erence between their functional features and their performance properties has become blurred, as relevant functionalities become inextricably linked to performance aspects, e.g. isochronous data transfer for live video tra- mission. During the last decade, this trend has motivated an increased interest in c- bining insights and results from the ?eld of formal methods – traditionally - cused on functionality – with techniques for performance modeling and analysis. Prominent examples of this cross-fertilization are extensions of process algebra and Petri nets that allow for the automatic generation of performance models, the use of formal proof techniques to assess the correctness of randomized - gorithms, and extensions of model checking techniques to analyze performance requirements automatically. We believe that these developments markthe - ginning of a new paradigm for the modeling and analysis of systems in which qualitative and quantitative aspects are studied from an integrated perspective. We are convinced that the further worktowards the realization of this goal will be a growing source of inspiration and progress for both communities.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Formal Methods for Performance Evaluation
Markovian Models for Performance and Dependability Evaluation
Introduction to Stochastic Petri Nets
Process Algebra and Markov Chains
Verification of Randomized Distributed Algorithms
Other editions - View all
action algorithm analysis automaton behaviour bisimulation Büchi automata choice clock coin flipping complete components Computer Science concurrent conflict consider corresponding CTMC defined definition delay denoted discrete DTMC enabled equations equivalence relation event example exponentially distributed finite firing formal function given GSMCs GSPN Haverkort Hillston IEEE immediate transitions initial marking input instantaneous activities interaction iteration labelled transition systems Lecture Notes Markov chains Markov process Markovian matrix methods model checking nodes Notes in Computer obtained operational PEPA Performance Evaluation Performance Models PN model possible priority probabilistic automata probability distribution probability vector Proc product form properties protocol queueing random variables reachable Section semantics sequence server simulation solution space specification stable marking steady-state probability stochastic activity network stochastic automata stochastic Petri nets stochastic process algebras structure subset synchronisation techniques temporal logic tion tokens transition relation vanishing markings vector