Distributed Extended Beam Search for Quantitative Model Checking

In this paper, we mainly focus on solving scheduling problems with model checking, where a finite number of entities needs to be processed as efficiently as possible, for instance by a machine. To solve these problems, we model them in untimed process algebra, where time is modelled using a special tickaction. We propose a set of distributed state space explorations to find schedules for the modelled problems, building on the traditional notion of beam search. The basic approach is called distributed (detailed) beam search, which prunes parts of the state space while searching using an evaluation function in order to find near-optimal schedules in very large state spaces. Variations on this approach are presented, such as distributed flexible, distributed g-synchronised, and distributed prioritybeam search, which can also practically be used in combinations.

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

[2]  Natalia Sidorova,et al.  Timed Verification with µCRL , 2003, Ershov Memorial Conference.

[3]  David L. Dill,et al.  The Murphi Verification System , 1996, CAV.

[4]  Theo C. Ruys,et al.  Optimal Scheduling Using Branch and Bound with SPIN 4.0 , 2003, SPIN.

[5]  Henry Ernest Dudeney.  Amusements in Mathematics , 1917, Nature.

[6]  Stuart C. Shapiro,et al.  Encyclopedia of artificial intelligence, vols. 1 and 2 (2nd ed.) , 1992 .

[7]  Simona Orzan,et al.  A distributed algorithm for strong bisimulation reduction of state spaces , 2002, PDMC@CONCUR.

[8]  Gerard J. Holzmann,et al.  Partial Order Methods in Verification , 1997 .

[9]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[10]  Manfred Broy,et al.  Perspectives of System Informatics , 2001, Lecture Notes in Computer Science.

[11]  Anton Wijs,et al.  From Chi-t to mCRL: Combining Performance and Functional Analysis , 2005 .

[12]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[13]  Anton Wijs,et al.  Solving scheduling problems by untimed model checking , 2009, FMICS '05.

[14]  Anton Wijs,et al.  From χt to µCRL: Combining Performance and Functional Analysis , 2005, 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'05).

[15]  Gunter Bolch,et al.  Queueing Networks and Markov Chains - Modeling and Performance Evaluation with Computer Science Applications, Second Edition , 1998 .

[16]  Mieke Massink,et al.  Theoretical and Practical Aspects of SPIN Model Checking , 1999, Lecture Notes in Computer Science.

[17]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[18]  Stefan Edelkamp,et al.  Parallel External Directed Model Checking with Linear I/O , 2006, VMCAI.

[19]  Muhammad Torabi Dashti,et al.  Pruning State Spaces with Extended Beam Search , 2006, ATVA.

[20]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[21]  David M. Nicol,et al.  Distributed State Space Generation of Discrete-State Stochastic Models , 1995, INFORMS J. Comput..

[22]  Gunter Bolch,et al.  Queueing Networks and Markov Chains , 2005 .

[23]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[24]  Frits W. Vaandrager,et al.  Distributing Timed Model Checking - How the Search Order Matters , 2000, CAV.

[25]  Anton Wijs,et al.  Solving scheduling problems by untimed model checking: the clinical chemical analyser case study , 2005, FMICS.

[26]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[27]  Federico Della Croce,et al.  A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem , 2002, J. Oper. Res. Soc..

[28]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[29]  Andrew William Roscoe,et al.  Model-checking CSP , 1994 .

[30]  Stephen F. Smith,et al.  Viewing scheduling as an opportunistic problem-solving process , 1988 .

[31]  Radu Mateescu,et al.  Parallel state space construction for model-checking , 2001, SPIN '01.

[32]  Sarit Kraus,et al.  KBFS: K-Best-First Search , 2003, Annals of Mathematics and Artificial Intelligence.

[33]  Jan Friso Groote,et al.  Algebraic Process Verification , 2001, Handbook of Process Algebra.

[34]  R. Zann.  The Zebra Finch: A Synthesis of Field and Laboratory Studies , 1996 .

[35]  Jan Friso Groote,et al.  µCRL: A Toolset for Analysing Algebraic Specifications , 2001, CAV.

[36]  Eric A. Hansen,et al.  Beam-Stack Search: Integrating Backtracking with Beam Search , 2005, ICAPS.

[37]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[38]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[39]  Simon Oechsner,et al.  Scheduling cluster tools using filtered beam search and recipe comparison , 2005, Proceedings of the Winter Simulation Conference, 2005..

[40]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[41]  Steven Michael Rubin,et al.  The argos image understanding system. , 1978 .

[42]  Cristian S. Calude,et al.  Discrete Mathematics and Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[43]  Alex Groce,et al.  Heuristics for model checking Java programs , 2004, International Journal on Software Tools for Technology Transfer.

[44]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[45]  Gerd Behrmann,et al.  Efficient Guiding Towards Cost-Optimality in UPPAAL , 2001, TACAS.

[46]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[47]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[48]  Andreas Podelski,et al.  ACSAR: Software Model Checking with Transfinite Refinement , 2007, SPIN.

[49]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[50]  Sarfraz Khurshid,et al.  Exploring very large state spaces using genetic algorithms , 2004, International Journal on Software Tools for Technology Transfer.

[51]  Flavio Lerda,et al.  Distributed-Memory Model Checking with SPIN , 1999, SPIN.

[52]  Stefan Edelkamp,et al.  Directed explicit-state model checking in the validation of communication protocols , 2004, International Journal on Software Tools for Technology Transfer.

[53]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[54]  Michael Huth,et al.  Quantitative analysis and model checking , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.