Fixed-Delay Events in Generalized Semi-Markov Processes Revisited

We study long run average behavior of generalized semi-Markov processes with both fixed-delay events as well as variable-delay events. We show that allowing two fixed-delay events and one variable-delay event may cause an unstable behavior of a GSMP. In particular, we show that a frequency of a given state may not be defined for almost all runs (or more generally, an invariant measure may not exist). We use this observation to disprove several results from literature. Next we study GSMP with at most one fixed-delay event combined with an arbitrary number of variable-delay events. We prove that such a GSMP always possesses an invariant measure which means that the frequencies of states are always well defined and we provide algorithms for approximation of these frequencies. Additionally, we show that the positive results remain valid even if we allow an arbitrary number of reasonably restricted fixed-delay events.

[1]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[2]  Rajeev Alur,et al.  Model-Checking for Probabilistic Real-Time Systems (Extended Abstract) , 1991, ICALP.

[3]  Andreas Reuys,et al.  The DSPNexpress 2.000 performance and dependability modeling environment , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).

[4]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[5]  Henrik Ejersbo Jensen Model Checking Probabilistic Real Time Systems , 1996 .

[6]  Gianfranco Ciardo,et al.  Logical and Stochastic Modeling with SMART , 2003, Computer Performance Evaluation / TOOLS.

[7]  J. Rosenthal,et al.  General state space Markov chains and MCMC algorithms , 2004, math/0404033.

[8]  Reinhard German,et al.  Analysis of Stochastic Petri Nets by the Method of Supplementary Variables , 1994, Perform. Evaluation.

[9]  Marco Ajmone Marsan,et al.  On Petri nets with deterministic and exponentially distributed firing times , 1986, European Workshop on Applications and Theory of Petri Nets.

[10]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[11]  Peter J. Haas,et al.  Stochastic Petri Nets: Modelling, Stability, Simulation , 2002 .

[12]  Rajeev Alur,et al.  Symbolic Analysis for GSMP Models with One Stateful Clock , 2007, HSCC.

[13]  J. Rosenthal A First Look at Rigorous Probability Theory , 2000 .

[14]  Joost-Pieter Katoen,et al.  Beyond Memoryless Distributions: Model Checking Semi-Markov Chains , 2001, PAPM-PROBMIV.

[15]  Håkan L. S. Younes,et al.  Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling , 2002, CAV.

[16]  Joost-Pieter Katoen,et al.  Efficient CTMC Model Checking of Linear Real-Time Objectives , 2011, TACAS.

[17]  P. Haas,et al.  Regenerative generalized semi-markov processes , 1987 .

[18]  Rajeev Alur,et al.  Verifying Automata Specifications of Probabilistic Real-time Systems , 1991, REX Workshop.

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

[20]  Jan Kretínský,et al.  Measuring performance of continuous-time stochastic processes using timed automata , 2011, HSCC '11.

[21]  Rajeev Alur,et al.  Bounded Model Checking for GSMP Models of Stochastic Real-Time Systems , 2006, HSCC.

[22]  Gerald S. Shedler,et al.  Numerical Analysis of Deterministic and Stochastic Petri Nets with Concurrent Deterministic Transitions , 1996, Perform. Evaluation.

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

[24]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[25]  P. Haas On simulation output analysis for generalized semi-markov processes , 1999 .

[26]  Luca de Alfaro,et al.  How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems , 1998, LICS.