Solving scheduling problems by untimed model checking: the clinical chemical analyser case study

Authors:
Anton Wijs;Jaco van de Pol;Elena Bortnik
Affiliations:
CWI, Amsterdam, The Netherlands;CWI, Amsterdam, The Netherlands;Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Year:
2005

Citing 8
Cited 3

Specification of abstract data types

Specification of abstract data types
Process Algebra with Timing

Process Algebra with Timing
Efficient on-the-fly model-checking for regular alternation-free mu-calculus

Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Extending Process Languages with Time

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Efficient Guiding Towards Cost-Optimality in UPPAAL

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The syntax and semantics of timed $\mu CRL$

The syntax and semantics of timed $\'mu CRL$
From "t to µCRL: Combining Performance and Functional Analysis

ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
Optimal scheduling using branch and bound with SPIN 4.0

SPIN'03 Proceedings of the 10th international conference on Model checking software

Distributed Extended Beam Search for Quantitative Model Checking

Model Checking and Artificial Intelligence
Distributed analysis with µCRL: a compendium of case studies

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Pruning state spaces with extended beam search

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show how scheduling problems can be modelled in untimed process algebra, by using special tick-actions. As a result, we can use efficient, distributed state space generators to solve scheduling problems. Also, we can use more flexible data specifications than timed model checkers usually provide. We propose a variant on breadth-first search, which visits the states per time slice between ticks. We applied our approach to find optimal schedules for test batches of a realistic clinical chemical analyser, which performs several kinds of tests on patient samples.