Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems

We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the parallel composition and the maximal progress operator. The approach is illustrated by a specification of the concurrent alternating bit protocol with generally-distributed unreliable channels in the language chi. We compare performance analysis using timed probabilistic reward graphs and discrete-event simulation.

[1]  Howard Bowman,et al.  Model checking stochastic automata , 2003, TOCL.

[2]  Mario Bravetti,et al.  Tutte le Algebre Insieme: Concepts, Discussions and Relations of Stochastic Process Algebras with General Distributions , 2004, Validation of Stochastic Systems.

[3]  Nwa Norbert Arends,et al.  A systems engineering specification formalism , 1996 .

[4]  Jasen Markovski,et al.  Real-time in stochastic process algebra: keeping track of winners and losers , 2007 .

[5]  Jeremy Sproston,et al.  Model Checking for Probabilistic Timed Systems , 2004, Validation of Stochastic Systems.

[6]  P. Glynn.  A GSMP formalism for discrete event systems , 1989, Proc. IEEE.

[7]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[8]  Erik P. de Vink,et al.  Real-Time Process Algebra with Stochastic Delays , 2007, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007).

[9]  V Victor Bos,et al.  Formal specification and analysis of industrial systems , 2002 .

[10]  Manuel Núñez,et al.  Weak Stochastic Bisimulation for Non-markovian Processes , 2005, ICTAC.

[11]  Jos C. M. Baeten,et al.  Process Algebra: Equational Theories of Communicating Processes , 2009 .

[12]  Erik P. de Vink,et al.  Embedding Real Time in Stochastic Process Algebras , 2006, EPEW.

[13]  Holger Hermanns,et al.  MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems , 2006, IEEE Transactions on Software Engineering.

[14]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

[15]  Ronald A. Howard,et al.  Dynamic Probabilistic Systems , 1971 .

[16]  Manuel Núñez,et al.  NMSPA: A Non-Markovian Model for Stochastic Processes , 2000, ICDCS Workshop on Distributed System Validation and Verification.

[17]  Dale Miller,et al.  A proof theory for generic judgments , 2005, TOCL.

[18]  Joost-Pieter Katoen,et al.  General Distributions in Process Algebra , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[19]  Christel Baier,et al.  Validation of Stochastic Systems , 2004, Lecture Notes in Computer Science.

[20]  Marco Pistore,et al.  History-Dependent Automata: An Introduction , 2005, SFM.

[21]  M. Bravetti,et al.  From EMPA to GSMPA : Allowing for General DistributionsMario Bravetti , 2007 .

[22]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[23]  Joost-Pieter Katoen,et al.  A theory of stochastic systems part I: Stochastic automata , 2005, Inf. Comput..

[24]  S. Andova,et al.  Performance analysis of χ models using discrete-time probabilistic reward graphs , 2008, 2008 9th International Workshop on Discrete Event Systems.

[25]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[26]  Joost-Pieter Katoen,et al.  A theory of Stochastic systems. Part II: Process algebra , 2005, Inf. Comput..

[27]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.