Parameterized Verification of Many Identical Probabilistic Timed Processes

Parameterized verification aims at validating a system's model irrespective of the value of a parameter. We introduce a model for networks of identical probabilistic timed processes, where the number of processes is a parameter. Each process is a probabilistic single-clock timed automaton and communicates with the others by broadcasting. The number of processes either is constant (static case), or evolves over time through random disappearances and creations (dynamic case). An example of relevant parameterized verification problem for these systems is whether, independently of the number of processes, a configuration where one process is in a target state is reached almost-surely under all scheduling policies. On the one hand, most parameterized verification problems turn out to be undecidable in the static case (even for untimed processes). On the other hand, we prove their decidability in the dynamic case.

[1]  Somesh Jha,et al.  Veryfying Parameterized Networks using Abstraction and Regular Languages , 1995, CONCUR.

[2]  Christel Baier,et al.  A note on the attractor-property of infinite-state Markov chains , 2006, Inf. Process. Lett..

[3]  Parosh Aziz Abdulla,et al.  On the Verification of Timed Ad Hoc Networks , 2011, FORMATS.

[4]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[5]  Marta Kwiatkowska,et al.  Verification of Real‐Time Probabilistic Systems , 2010 .

[6]  Parosh Aziz Abdulla,et al.  Verification of Probabilistic Systems with Faulty Communication , 2003, FoSSaCS.

[7]  Parosh Aziz Abdulla,et al.  Model checking of systems with many identical timed processes , 2003, Theor. Comput. Sci..

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

[9]  Stephan Merz,et al.  Modeling and Verification of Real-time Systems , 2008 .

[10]  Matthias Fruth,et al.  Probabilistic Model Checking of Contention Resolution in the IEEE 802.15.4 Low-Rate Wireless Personal Area Network Protocol , 2006, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006).

[11]  Nathalie Bertrand,et al.  Computable fixpoints in well-structured symbolic model checking , 2013, Formal Methods Syst. Des..

[12]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[13]  Christel Baier,et al.  Principles of model checking , 2008 .

[14]  Parosh Aziz Abdulla,et al.  Multi-clock timed networks , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[15]  Giorgio Delzanno,et al.  Parameterized Verification of Ad Hoc Networks , 2010, CONCUR.

[16]  Annabelle McIver,et al.  Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language , 2012, 2012 Ninth International Conference on Quantitative Evaluation of Systems.

[17]  Christel Baier,et al.  Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties , 2005, TOCL.

[18]  Conrado Daws Symbolic and Parametric Model Checking of Discrete-Time Markov Chains , 2004, ICTAC.

[19]  Parosh Aziz Abdulla,et al.  Decisive Markov Chains , 2007, Log. Methods Comput. Sci..

[20]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).