Let's evaluate performance algebraically

We discuss the benefits of using process algebras in the field of performance modeling and evaluation. We briefly present problems that have been tackled, theoretical results, and future developments. Many computing systems consist of a possibly huge number of components that not only work independently but also communicate with each other from time to time. Examples of such systems are communication protocols, operating systems, embedded control systems for automobiles, airplanes, and medical equipment, railway signaling systems, air traffic control systems, distributed systems and algorithms, computer architectures, and integrated circuits. The catastrophic consequences of failures, such as loss of human lives, environmental damages, and financial losses, in many of these critical systems compel computer scientists to develop formal description techniques for ensuring that these systems are implemented correctly despite of their complexity. Formal methods are conceived to allow the correctness of a system design to be formally verified because the design can be described in a mathematically precise fashion, correctness criteria can be specified in a similarly precise way, and the design can be rigorously proved to meet or not the stated criteria. Although a number of description techniques and related software tools have been developed to support the formal modeling and verification of functional properties of systems, only in recent years temporal characteristics have received attention. This has required extending formal description techniques by introducing the concept of time, represented either in a deterministic way or in a stochastic way. In the deterministic case the focus typically is on verifying the satisfaction of real time constraints, i.e. the fact that the execution of specific actions is guaranteed by a fixed deadline after some event has happened. As an example, if a train is approaching a railroad crossing, then bars must be guaranteed to be lowered on due time. In the stochastic case, instead, systems are considered whose behavior cannot be deterministically predicted as it fluctuates according to some probability distribution. Due to economic reasons, such stochastically behaving systems are referred to as shared resource systems because there is a varying number of demands competing for the same resources. The consequences are mutual interference, delays

[1]  Norbert Götz,et al.  Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras , 1993, Performance/SIGMETRICS Tutorials.

[2]  Peter G. Harrison,et al.  Stochastic Process Algebra for Discrete Event Simulation , 1995 .

[3]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[4]  Stephen Gilmore,et al.  The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling , 1994, Computer Performance Evaluation.

[5]  Joost-Pieter Katoen,et al.  An algebraic approach to the specification of stochastic systems , 1998, PROCOMET.

[6]  Marco Bernardo,et al.  An Algebra-Based Method to Associate Rewards with EMPA Terms , 1997, ICALP.

[7]  Ulrich Herzog,et al.  Formal Description, Time and Performance Analysis. A Framework , 1990, Entwurf und Betrieb verteilter Systeme.

[8]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[9]  Roberto Gorrieri,et al.  A Formal Approach to the Integration of Performance Aspects in the Modeling and Analysis of Concurrent Systems , 1998, Inf. Comput..

[10]  Holger Hermanns,et al.  A Construction and Analysis Tool Based on the Stochastic Process Algebra TIPP , 1996, TACAS.

[11]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[12]  Mario Bravetti,et al.  Towards Performance Evaluation with General Distributions in Process Algebras , 1998, CONCUR.

[13]  Rance Cleaveland,et al.  TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems , 1998, FORTE.

[14]  C. A. Petri Communication with automata , 1966 .

[15]  Domenico Ferrari Considerations on the insularity of performance evaluation , 1986, IEEE Transactions on Software Engineering.

[16]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[17]  Yechiam Yemini,et al.  Algebraic Specification-Based Performance Analysis of Communication Protocols , 1984, PSTV.

[18]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[19]  Marco Ajmone Marsan,et al.  Stochastic Petri nets: an elementary introduction , 1988, European Workshop on Applications and Theory in Petri Nets.

[20]  J. Hillston Exploiting Structure in Solution: Decomposing Composed Models , 1998 .