Design and validation of computer protocols
Design and validation of computer protocols
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Verification and Optimization of a PLC Control Schedule
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Experience with Literate Programming in the Modelling and Validation of Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Scheduling a Steel Plant with Timed Automata
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Solving scheduling problems by untimed model checking: the clinical chemical analyser case study
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Optimal trajectory generation for petri nets
Acta Cybernetica
Proceedings of the 44th annual Design Automation Conference
Distributed Extended Beam Search for Quantitative Model Checking
Model Checking and Artificial Intelligence
Scheduling optimisations for SPIN to minimise buffer requirements in synchronous data flow
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Joint Optimization and Reachability Analysis in Graph Transformation Systems with Time
Electronic Notes in Theoretical Computer Science (ENTCS)
Pruning state spaces with extended beam search
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Machine checked formal proof of a scheduling protocol for smartcard personalization
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Hi-index | 0.00 |
The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct. Subsequently, the same model can be used to find an optimal solution for the problem. This paper describes how to apply the new Promela primitives of SPIN 4.0t o search effectively for the optimal solution. We show how Branch-and-Bound techniques can be added to the LTL property that is used to find the solution. The LTL property is dynamically changed during the verification. We also show how the syntactical reordering of statements and/or processes in the Promela model can improve the search even further. The techniques are illustrated using two running examples: the Travelling Salesman Problem and a job-shop scheduling problem.