Promptness and Bounded Fairness in Concurrent and Parameterized Systems

We investigate the satisfaction of specifications in Prompt Linear Temporal Logic (Prompt-LTL) by concurrent systems. Prompt-LTL is an extension of LTL that allows to specify parametric bounds on the satisfaction of eventualities, thus adding a quantitative aspect to the specification language. We establish a connection between bounded fairness, bounded stutter equivalence, and the satisfaction of Prompt-LTL\X formulas. Based on this connection, we prove the first cutoff results for different classes of systems with a parametric number of components and quantitative specifications, thereby identifying previously unknown decidable fragments of the parameterized model checking problem.

[1]  Vineet Kahlon,et al.  Reducing Model Checking of the Many to the Few , 2000, CADE.

[2]  E. A. Emerson,et al.  On Reasoning About Rings , 2003, Int. J. Found. Comput. Sci..

[3]  Orna Kupferman,et al.  From liveness to promptness , 2009, Formal Methods Syst. Des..

[4]  Helmut Veith,et al.  Parameterized model checking of rendezvous systems , 2014, Distributed Computing.

[5]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

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

[7]  Swen Jacobs,et al.  Distributed Synthesis for Parameterized Temporal Logics , 2018, Inf. Comput..

[8]  Helmut Veith,et al.  Decidability of Parameterized Verification , 2015, Synthesis Lectures on Distributed Computing Theory.

[9]  Kousha Etessami,et al.  Computer Aided Verification , 2008 .

[10]  Martin Zimmermann,et al.  Parametric Linear Dynamic Logic , 2014, GandALF.

[11]  Helmut Veith,et al.  Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems , 2008, TACAS.

[12]  Javier Esparza.  Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version) , 2014, ArXiv.

[13]  Rajeev Alur,et al.  Parametric temporal logic for “model measuring” , 2001, TOCL.

[14]  Vineet Kahlon,et al.  Model checking guarded protocols , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[15]  Roderick Bloem,et al.  Parameterized Synthesis Case Study: AMBA AHB , 2014, SYNT.

[16]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[17]  Ichiro Suzuki,et al.  Proving Properties of a Ring of Finite-State Machines , 1988, Inf. Process. Lett..

[18]  RoderickBloem,et al.  Decidability of Parameterized Verification , 2015 .

[19]  Roderick Bloem,et al.  Towards Efficient Parameterized Synthesis , 2013, VMCAI.

[20]  Daniel Kroening,et al.  Dynamic Cutoff Detection in Parameterized Concurrent Programs , 2010, CAV.

[21]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[22]  Roderick Bloem,et al.  PARTY Parameterized Synthesis of Token Rings , 2013, CAV.

[23]  Helmut Veith,et al.  Verification by Network Decomposition , 2004, CONCUR.

[24]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[25]  Swen Jacobs,et al.  Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity , 2017, VMCAI.

[26]  Kedar S. Namjoshi,et al.  Symmetry and Completeness in the Analysis of Parameterized Systems , 2007, VMCAI.

[27]  Swen Jacobs,et al.  Tight Cutoffs for Guarded Protocols with Fairness , 2015, VMCAI.

[28]  Kousha Etessami,et al.  Stutter-Invariant Languages, omega-Automata, and Temporal Logic , 1999, CAV.

[29]  Rupak Majumdar,et al.  Parameterized Verification of Asynchronous Shared-Memory Systems , 2013, CAV.

[30]  Benjamin Aminof,et al.  Parameterized Model Checking of Token-Passing Systems , 2013, VMCAI.

[31]  Cosimo Laneve,et al.  Decidability Problems for Actor Systems , 2012, CONCUR.

[32]  Roderick Bloem,et al.  Parameterized Synthesis , 2012, TACAS.

[33]  Luca Spalazzi,et al.  Parameterized Model-Checking of Timed Systems with Conjunctive Guards , 2014, VSTTE.

[34]  Javier Esparza.  Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk) , 2014, STACS.

[35]  Luca Spalazzi,et al.  On the Existence of Cutoffs for Model Checking Disjunctive Timed Networks , 2017, ICTCS/CILC.

[36]  Amir Pnueli,et al.  Automatic Deductive Verification with Invisible Invariants , 2001, TACAS.

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