Finding Liveness Errors with ACO

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Finding Liveness Errors with ACO"

Transcription

1 Hong Kong, June 1-6, / 24 Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba

2 Motivation Motivation Nowadays software is very complex An error in a software system can imply the loss of lot of money and even human lifes Techniques for proving the correctness of the software are required Model checking fully automatic Hong Kong, June 1-6, / 24

3 Hong Kong, June 1-6, / 24 Explicit State MC State Explosion Heuristic MC Objective: Prove that model M satisfies the property : HSF-SPIN: the property f is an LTL formula Explicit State Model Checking Safety & Liveness Properties Model M LTL formula f Intersection Büchi automaton s5 s4 s3!p q = p!q q s7 s6 s3 s4 s5 s8 s9

4 Hong Kong, June 1-6, / 24 Explicit State MC State Explosion Heuristic MC Objective: Prove that model M satisfies the property : HSF-SPIN: the property f is an LTL formula Explicit State Model Checking Safety & Liveness Properties Model M LTL formula f Intersection Büchi automaton s5 s4 s3!p q = p!q q s7 s6 s3 s4 s5 s8 s9

5 Hong Kong, June 1-6, / 24 Explicit State MC State Explosion Heuristic MC Objective: Prove that model M satisfies the property : HSF-SPIN: the property f is an LTL formula Explicit State Model Checking Safety & Liveness Properties Model M LTL formula f Intersection Büchi automaton s5 s4 s3!p q q p!q = s7 s6 s3 s4 s5 s8 s9 Using Nested-DFS

6 Hong Kong, June 1-6, / 24 State Explosion Problem Number of states very large even for small models Explicit State MC State Explosion Heuristic MC Safety & Liveness Properties s3 s5 Memory s7 s6 s4 s8 s9 Example: Dining philosophers with n philosophers 3 n states 20 philosophers 1039 GB for storing the states Solutions: collapse compression, minimized automaton representation, bitstate hashing, partial order reduction, symmetry reduction Large models cannot be verified but errors can be found

7 Hong Kong, June 1-6, / 24 Explicit State MC State Explosion Heuristic MC Safety & Liveness Properties Heuristic Model Checking The search for errors can be directed by using heuristic information 2 0 s7 3 4 s6 5 2 s3 s4 0 s5 1 Heuristic value 6 s8 s9 7 Different kinds of heuristic functions have been proposed in the past: Formula-based heuristics Deadlock-detection heuristics Structural heuristics State-dependent heuristics

8 Hong Kong, June 1-6, / 24 Explicit State MC State Explosion Heuristic MC Safety & Liveness Properties Safety and Liveness Properties Safety property s3 s5 Counterexample path to accepting state Graph exploration algorithms can be used: DFS and BFS s7 s8 s6 s9 s4 Liveness property s3 s5 Counterexample path to accepting cycle It is not possible to apply DFS or BFS s7 s8 s6 s9 s4

9 Hong Kong, June 1-6, / 24 Metaheuristics ACO ACOhg ACOhg-live Metaheuristic Algorithms Designed to solve optimization problems Maximize or minimize a given function: the fitness function They can find good solutions with a reasonable amount of resources Metaheuristic Algorithms Single solution Population

10 Hong Kong, June 1-6, / 24 Greedy Randomized Adaptive Search Procedure Metaheuristics ACO ACOhg ACOhg-live Single solution Iterated Local Search Metaheuristics Classification Variable Neighborhood Search Tabu Search Simulated Annealing Iterative Improvement Guided Local Search Population Estimation of Distribution Algorithms Evolutionary Computation Scatter Search Ant Colony Optimization Particle Swarm Optimization

11 Hong Kong, June 1-6, / 24 ACO: Metaheuristics ACO ACOhg ACOhg-live Ant Colony Optimization (ACO) metaheuristic is inspired by the foraging behaviour of real ants ACO Pseudo-code

12 Hong Kong, June 1-6, / 24 Metaheuristics ACO ACOhg ACOhg-live ACO: Construction Phase The ant selects its next node stochastically The probability of selecting one node depends on the pheromone trail and the heuristic value (optional) of the edge/node The ant stops when a complete solution is built Trail τ ij Heuristic η ij j k i m N i k l

13 Hong Kong, June 1-6, / 24 Pheromone update Metaheuristics ACO ACOhg ACOhg-live ACO: Pheromone Update During the construction phase with After the construction phase with Trail limits (particular of MMAS) Pheromones are kept in the interval [τ min, τ max ]

14 Metaheuristics ACO ACOhg ACOhg-live ACOhg: Huge Graphs Exploration The length of the ant paths is limited by λ ant What if? λ ant Objective node Initial node Starting nodes for path construction change After σ s steps Second stage Third stage Hong Kong, June 1-6, / 24

15 Hong Kong, June 1-6, / 24 ACOhg-live Metaheuristics ACO ACOhg ACOhg-live The search is an alternation of two phases First phase: search for accepting states Second phase: search for cycles from the accepting states ACOhg-live Pseudocode First phase

16 Hong Kong, June 1-6, / 24 ACOhg-live Metaheuristics ACO ACOhg ACOhg-live The search is an alternation of two phases First phase: search for accepting states Second phase: search for cycles from the accepting states ACOhg-live Pseudocode Second phase

17 Hong Kong, June 1-6, / 24 ACOhg-live Metaheuristics ACO ACOhg ACOhg-live The search is an alternation of two phases First phase: search for accepting states Second phase: search for cycles from the accepting states ACOhg-live Pseudocode

18 Hong Kong, June 1-6, / 24 Promela Models We selected 7 Promela models for the experiments Model LoC Scalable Processes LTL formula (liveness) alter 64 no 2 (p q) ^ (r s) giopij 740 yes i+3(j+1) (p q) phij 57 yes j+1 (p q) Parameters for ACOhg-live ACOhg-live implemented in HSF-SPIN 100 independent executions Models & parameters Results Discussion Parameter msteps colsize λ ant σ s ξ a ρ α β 1st phase nd phase

19 Hong Kong, June 1-6, / 24 Promela Models We selected 7 Promela models for the experiments Model LoC i=2,6,10 Scalable Processes LTL formula (liveness) alter 64 j=2 no 2 (p q) ^ (r s) giopij 740 yes i+3(j+1) (p q) phij 57 j=8,14,20yes j+1 (p q) Parameters for ACOhg-live ACOhg-live implemented in HSF-SPIN 100 independent executions Models & parameters Results Discussion Parameter msteps colsize λ ant σ s ξ a ρ α β 1st phase nd phase

20 Hong Kong, June 1-6, / 24 Models & parameters Results Discussion Results I: Comparison of Heuristic Information Comparison of H ham and H fsm

21 Hong Kong, June 1-6, / 24 Models & parameters Results Discussion Results II: Comparison of ACOhg-live and NDFS Comparison of ACOhg-live and NDFS

22 Hong Kong, June 1-6, / 24 Models & parameters Results Discussion How to use ACOhg-live ACOhg-live should be used in the first/middle stages of the software development, when software errors are expected ACOhg-live can also be used in other phases of the software development for testing concurrent software Large model or a short couterexample is needed ACOhg-live Model Small model and any counterexample is needed fast NDFS

23 Hong Kong, June 1-6, / 24 ACOhg-live is the first algorithm based on metaheuristics (to the best of our knowledge) applied to the search for liveness errors in concurrent models The heuristic function based on finite state machines is a better guide in the second phase of ACOhg-live ACOhg-live is able to outperform Nested-DFS in efficacy and efficiency in the search for liveness errors Future Work Use of Strongly Connected Components of the never claim graph for improving the search (in progress) Analysis of parameterization for reducing the parameters Include ACOhg-live into JavaPathFinder for finding liveness errors in Java programs

24 Hong Kong, June 1-6, / 24 Finding Liveness Errors with ACO Thanks for your attention!!!

Finding Liveness Errors with ACO

Finding Liveness Errors with ACO Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic

More information

MuACOsm A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines

MuACOsm A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines MuACOsm A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines Daniil Chivilikhin and Vladimir Ulyantsev National Research University of IT, Mechanics and Optics St.

More information

vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK

vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS LIST OF SYMBOLS LIST OF APPENDICES

More information

How Can Metaheuristics Help Software Engineers

How Can Metaheuristics Help Software Engineers and Software How Can Help Software Engineers Enrique Alba eat@lcc.uma.es http://www.lcc.uma.es/~eat Universidad de Málaga, ESPAÑA Enrique Alba How Can Help Software Engineers of 8 and Software What s a

More information

Informe Ejecutivo. Málaga, 22 de Noviembre de 2008

Informe Ejecutivo. Málaga, 22 de Noviembre de 2008 Diseño Inteligente de Redes Inalámbricas de Comunicación Conserjería de Innovación, Ciencia y Empresa P07-TIC-03044 http://diricom.lcc.uma.es Informe Ejecutivo Málaga, 22 de Noviembre de 2008 Título: Resumen:

More information

An ACO Approach to Solve a Variant of TSP

An ACO Approach to Solve a Variant of TSP An ACO Approach to Solve a Variant of TSP Bharat V. Chawda, Nitesh M. Sureja Abstract This study is an investigation on the application of Ant Colony Optimization to a variant of TSP. This paper presents

More information

Using Ant Colony Optimization for Infrastructure Maintenance Scheduling

Using Ant Colony Optimization for Infrastructure Maintenance Scheduling Using Ant Colony Optimization for Infrastructure Maintenance Scheduling K. Lukas, A. Borrmann & E. Rank Chair for Computation in Engineering, Technische Universität München ABSTRACT: For the optimal planning

More information

Journal of Theoretical and Applied Information Technology 20 th July 2015. Vol.77. No.2 2005-2015 JATIT & LLS. All rights reserved.

Journal of Theoretical and Applied Information Technology 20 th July 2015. Vol.77. No.2 2005-2015 JATIT & LLS. All rights reserved. EFFICIENT LOAD BALANCING USING ANT COLONY OPTIMIZATION MOHAMMAD H. NADIMI-SHAHRAKI, ELNAZ SHAFIGH FARD, FARAMARZ SAFI Department of Computer Engineering, Najafabad branch, Islamic Azad University, Najafabad,

More information

Projects - Neural and Evolutionary Computing

Projects - Neural and Evolutionary Computing Projects - Neural and Evolutionary Computing 2014-2015 I. Application oriented topics 1. Task scheduling in distributed systems. The aim is to assign a set of (independent or correlated) tasks to some

More information

STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1

STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 Prajakta Joglekar, 2 Pallavi Jaiswal, 3 Vandana Jagtap Maharashtra Institute of Technology, Pune Email: 1 somanprajakta@gmail.com,

More information

An Improved ACO Algorithm for Multicast Routing

An Improved ACO Algorithm for Multicast Routing An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China wzqagent@xinhuanet.com

More information

ACO FOR OPTIMAL SENSOR LAYOUT

ACO FOR OPTIMAL SENSOR LAYOUT Stefka Fidanova 1, Pencho Marinov 1 and Enrique Alba 2 1 Institute for Parallel Processing, Bulgarian Academy of Science, Acad. G. Bonchev str. bl.25a, 1113 Sofia, Bulgaria 2 E.T.S.I. Informatica, Grupo

More information

Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing

Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing Presentation: TheinLai Wong Authors: T. Shiba,, T. Tsuchiya, T. Kikuno Osaka University Backgrounds Testing is an important

More information

EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks

EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks 2 EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks Dac-Nhuong Le, Hanoi University of Science, Vietnam National University, Vietnam Optimizing location of controllers

More information

An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem

An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem Challenge ROADEF/EURO 2010 Roman Steiner, Sandro Pirkwieser, Matthias Prandtstetter Vienna University of Technology, Austria Institute

More information

Agenda. Project Green@Cloud Done Work In-progress Work Future Work

Agenda. Project Green@Cloud Done Work In-progress Work Future Work Agenda Project Green@Cloud Done Work In-progress Work Future Work Project Green@Cloud Multi-objective meta-heuristics for energy-aware scheduling in cloud computing systems Publications Paper for the special

More information

The Model Checker SPIN

The Model Checker SPIN The Model Checker SPIN Author: Gerard J. Holzmann Presented By: Maulik Patel Outline Introduction Structure Foundation Algorithms Memory management Example/Demo SPIN-Introduction Introduction SPIN (Simple(

More information

Ant Colony Optimization (ACO)

Ant Colony Optimization (ACO) Ant Colony Optimization (ACO) Exploits foraging behavior of ants Path optimization Problems mapping onto foraging are ACO-like TSP, ATSP QAP Travelling Salesman Problem (TSP) Why? Hard, shortest path problem

More information

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational

More information

An ACO Model for a Non-stationary Formulation of the Single Elevator Problem

An ACO Model for a Non-stationary Formulation of the Single Elevator Problem An ACO Model for a Non-stationary Formulation of the Single Elevator Problem S. Molina, G. Leguizamón Universidad Nacional de San Luis, Ejército de los Andes 950, (5700) San Luis, Argentina {smolina,legui}@unsl.edu.ar

More information

Power Plant Maintenance Scheduling Using Ant Colony Optimization

Power Plant Maintenance Scheduling Using Ant Colony Optimization 16 Power Plant Maintenance Scheduling Using Ant Colony Optimization Wai Kuan Foong, Holger Robert Maier and Angus Ross Simpson School of Civil & Environmental Engineering, University of Adelaide Australia

More information

by strong pheromone concentrations. The pheromone trail allows the ants to find their

by strong pheromone concentrations. The pheromone trail allows the ants to find their Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Université Libre de Bruxelles Brussels, Belgium {mdorigo,gdicaro}@ulb.ac.be Luca M. Gambardella IDSIA, Lugano, Switzerland

More information

Binary Ant Colony Evolutionary Algorithm

Binary Ant Colony Evolutionary Algorithm Weiqing Xiong Liuyi Wang Chenyang Yan School of Information Science and Engineering Ningbo University, Ningbo 35 China Weiqing,xwqdds@tom.com, Liuyi,jameswang@hotmail.com School Information and Electrical

More information

Swarm Intelligence Algorithms Parameter Tuning

Swarm Intelligence Algorithms Parameter Tuning Swarm Intelligence Algorithms Parameter Tuning Milan TUBA Faculty of Computer Science Megatrend University of Belgrade Bulevar umetnosti 29, N. Belgrade SERBIA tuba@ieee.org Abstract: - Nature inspired

More information

An Ant Colony Optimization Approach to the Software Release Planning Problem

An Ant Colony Optimization Approach to the Software Release Planning Problem SBSE for Early Lifecyle Software Engineering 23 rd February 2011 London, UK An Ant Colony Optimization Approach to the Software Release Planning Problem with Dependent Requirements Jerffeson Teixeira de

More information

14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)

14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,

More information

Applications of Model Reuse When Using Estimation of Distribution Algorithms to Test Concurrent Software

Applications of Model Reuse When Using Estimation of Distribution Algorithms to Test Concurrent Software Applications of Model Reuse When Using Estimation of Distribution Algorithms to Test Concurrent Software Jan Staunton and John A. Clark Department of Computer Science, University of York, UK {jps,jac}@cs.york.ac.uk

More information

Solving the Travelling Salesman Problem Using the Ant Colony Optimization

Solving the Travelling Salesman Problem Using the Ant Colony Optimization Ivan Brezina Jr. Zuzana Čičková Solving the Travelling Salesman Problem Using the Ant Colony Optimization Article Info:, Vol. 6 (2011), No. 4, pp. 010-014 Received 12 July 2010 Accepted 23 September 2011

More information

D A T A M I N I N G C L A S S I F I C A T I O N

D A T A M I N I N G C L A S S I F I C A T I O N D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.

More information

Obtaining Optimal Software Effort Estimation Data Using Feature Subset Selection

Obtaining Optimal Software Effort Estimation Data Using Feature Subset Selection Obtaining Optimal Software Effort Estimation Data Using Feature Subset Selection Abirami.R 1, Sujithra.S 2, Sathishkumar.P 3, Geethanjali.N 4 1, 2, 3 Student, Department of Computer Science and Engineering,

More information

A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION

A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION Eng. Sorin Ilie 1 Ph. D Student University of Craiova Software Engineering Department Craiova, Romania Prof. Costin Bădică Ph. D University of Craiova

More information

CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM

CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,

More information

Ant Colony Optimization and Constraint Programming

Ant Colony Optimization and Constraint Programming Ant Colony Optimization and Constraint Programming Christine Solnon Series Editor Narendra Jussien WILEY Table of Contents Foreword Acknowledgements xi xiii Chapter 1. Introduction 1 1.1. Overview of the

More information

An ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups

An ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 19 An ant colony optimization for single-machine weighted tardiness

More information

. 1/ CHAPTER- 4 SIMULATION RESULTS & DISCUSSION CHAPTER 4 SIMULATION RESULTS & DISCUSSION 4.1: ANT COLONY OPTIMIZATION BASED ON ESTIMATION OF DISTRIBUTION ACS possesses

More information

Méta-heuristiques pour l optimisation

Méta-heuristiques pour l optimisation Méta-heuristiques pour l optimisation Differential Evolution (DE) Particle Swarm Optimization (PSO) Alain Dutech Equipe MAIA - LORIA - INRIA Nancy, France Web : http://maia.loria.fr Mail : Alain.Dutech@loria.fr

More information

HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS

HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS R. Angel Preethima 1, Margret Johnson 2 1 Student, Computer Science and Engineering, Karunya

More information

ACO Hypercube Framework for Solving a University Course Timetabling Problem

ACO Hypercube Framework for Solving a University Course Timetabling Problem ACO Hypercube Framework for Solving a University Course Timetabling Problem José Miguel Rubio, Franklin Johnson and Broderick Crawford Abstract We present a resolution technique of the University course

More information

Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm

Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm www.ijcsi.org 54 Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm Linan Zhu 1, Qingshui Li 2, and Lingna He 3 1 College of Mechanical Engineering, Zhejiang

More information

Computational Intelligence Algorithms for Optimized Vehicle Routing Applications in Geographic Information Systems

Computational Intelligence Algorithms for Optimized Vehicle Routing Applications in Geographic Information Systems 1 Computational Intelligence Algorithms for Optimized Vehicle Routing Applications in Geographic Information Systems Michael Rice Thesis Proposal Abstract This project seeks to explore the application

More information

An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling

An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling Avinash Mahadik Department Of Computer Engineering Alard College Of Engineering And Management,Marunje, Pune Email-avinash.mahadik5@gmail.com

More information

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET)

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), ISSN 0976 6367(Print) ISSN 0976 6375(Online)

More information

Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents

Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Matthias Prandtstetter Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria www.ads.tuwien.ac.at

More information

An ACO-LB Algorithm for Task Scheduling in the Cloud Environment

An ACO-LB Algorithm for Task Scheduling in the Cloud Environment 466 JOURNAL OF SOFTWARE, VOL. 9, NO. 2, FEBRUARY 2014 An ACO-LB Algorithm for Task Scheduling in the Cloud Environment Shengjun Xue, Mengying Li, Xiaolong Xu, and Jingyi Chen Nanjing University of Information

More information

Static Program Transformations for Efficient Software Model Checking

Static Program Transformations for Efficient Software Model Checking Static Program Transformations for Efficient Software Model Checking Shobha Vasudevan Jacob Abraham The University of Texas at Austin Dependable Systems Large and complex systems Software faults are major

More information

An ACO-based Approach for Scheduling Task Graphs with Communication Costs

An ACO-based Approach for Scheduling Task Graphs with Communication Costs An ACO-based Approach for Scheduling Task Graphs with Communication Costs Markus Bank Udo Hönig Wolfram Schiffmann FernUniversität Hagen Lehrgebiet Rechnerarchitektur 58084 Hagen, Germany {Markus.Bank,

More information

A Proposed Scheme for Software Project Scheduling and Allocation with Event Based Scheduler using Ant Colony Optimization

A Proposed Scheme for Software Project Scheduling and Allocation with Event Based Scheduler using Ant Colony Optimization A Proposed Scheme for Software Project Scheduling and Allocation with Event Based Scheduler using Ant Colony Optimization Arjita sharma 1, Niyati R Bhele 2, Snehal S Dhamale 3, Bharati Parkhe 4 NMIET,

More information

ANT COLONY OPTIMIZATION ALGORITHM FOR RESOURCE LEVELING PROBLEM OF CONSTRUCTION PROJECT

ANT COLONY OPTIMIZATION ALGORITHM FOR RESOURCE LEVELING PROBLEM OF CONSTRUCTION PROJECT ANT COLONY OPTIMIZATION ALGORITHM FOR RESOURCE LEVELING PROBLEM OF CONSTRUCTION PROJECT Ying XIONG 1, Ya Ping KUANG 2 1. School of Economics and Management, Being Jiaotong Univ., Being, China. 2. College

More information

SACOC: A spectral-based ACO clustering algorithm

SACOC: A spectral-based ACO clustering algorithm SACOC: A spectral-based ACO clustering algorithm Héctor D. Menéndez, Fernando E. B. Otero, and David Camacho Abstract The application of ACO-based algorithms in data mining is growing over the last few

More information

Formal Verification by Model Checking

Formal Verification by Model Checking Formal Verification by Model Checking Natasha Sharygina Carnegie Mellon University Guest Lectures at the Analysis of Software Artifacts Class, Spring 2005 1 Outline Lecture 1: Overview of Model Checking

More information

Multi-objective Software Assignment for Active Cyber Defense

Multi-objective Software Assignment for Active Cyber Defense Multi-objective Software Assignment for Active Cyber Defense Chu Huang School of Information Science and Technology Pennsylvania State University cuh171@psu.edu Sencun Zhu Department of Computer Science

More information

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem Journal of mathematics and computer Science 12 (214) 27 38 An Efficient Algorithm for Solving a Stochastic LocationRouting Problem H.A. HassanPour a, M. MosadeghKhah a, M. Zareei 1 a Department of Industrial

More information

Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling

Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling Available online at www.sciencedirect.com Computers & Operations Research ( ) www.elsevier.com/locate/dsw Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling

More information

AN APPROACH FOR SOFTWARE TEST CASE SELECTION USING HYBRID PSO

AN APPROACH FOR SOFTWARE TEST CASE SELECTION USING HYBRID PSO INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 AN APPROACH FOR SOFTWARE TEST CASE SELECTION USING HYBRID PSO 1 Preeti Bala Thakur, 2 Prof. Toran Verma 1 Dept. of

More information

A RANDOMIZED LOAD BALANCING ALGORITHM IN GRID USING MAX MIN PSO ALGORITHM

A RANDOMIZED LOAD BALANCING ALGORITHM IN GRID USING MAX MIN PSO ALGORITHM International Journal of Research in Computer Science eissn 2249-8265 Volume 2 Issue 3 (212) pp. 17-23 White Globe Publications A RANDOMIZED LOAD BALANCING ALGORITHM IN GRID USING MAX MIN ALGORITHM C.Kalpana

More information

School Timetabling in Theory and Practice

School Timetabling in Theory and Practice School Timetabling in Theory and Practice Irving van Heuven van Staereling VU University, Amsterdam Faculty of Sciences December 24, 2012 Preface At almost every secondary school and university, some

More information

Student at Computer science, Mathematics Department, Faculty of Science, Helwan University, Egypt 2

Student at Computer science, Mathematics Department, Faculty of Science, Helwan University, Egypt 2 Volume 5, Issue 10, October-2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Study on Job

More information

Scheduling Technicians and Tasks in a Telecommunications Company

Scheduling Technicians and Tasks in a Telecommunications Company Scheduling Technicians and Tasks in a Telecommunications Company Jean-François Cordeau Canada Research Chair in Logistics and Transportation, HEC Montréal 3000, chemin de la Côte-Sainte-Catherine, Montréal,

More information

IAJIT First Online Publication

IAJIT First Online Publication Using the Ant Colony Algorithm for Real-Time Automatic Route of School Buses Tuncay Yigit and Ozkan Unsal Department of Computer Engineering, Süleyman Demirel University, Turkey Abstract: Transportation

More information

Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: a Case Study

Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: a Case Study Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: a Case Study Paola Pellegrini, Daniela Favaretto, Elena Moretti Department of Applied Mathematics University Ca Foscari of Venice Dorsoduro

More information

Computer based Scheduling Tool for Multi-product Scheduling Problems

Computer based Scheduling Tool for Multi-product Scheduling Problems Computer based Scheduling Tool for Multi-product Scheduling Problems Computer based Scheduling Tool for Multi-product Scheduling Problems Adirake Chainual, Tawatchai Lutuksin and Pupong Pongcharoen Department

More information

Integer Programming: Algorithms - 3

Integer Programming: Algorithms - 3 Week 9 Integer Programming: Algorithms - 3 OPR 992 Applied Mathematical Programming OPR 992 - Applied Mathematical Programming - p. 1/12 Dantzig-Wolfe Reformulation Example Strength of the Linear Programming

More information

Effective Load Balancing for Cloud Computing using Hybrid AB Algorithm

Effective Load Balancing for Cloud Computing using Hybrid AB Algorithm Effective Load Balancing for Cloud Computing using Hybrid AB Algorithm 1 N. Sasikala and 2 Dr. D. Ramesh PG Scholar, Department of CSE, University College of Engineering (BIT Campus), Tiruchirappalli,

More information

Constraint Satisfaction Problems. Constraint Satisfaction Problems. Greedy Local Search. Example. 1 Greedy algorithm. 2 Stochastic Greedy Local Search

Constraint Satisfaction Problems. Constraint Satisfaction Problems. Greedy Local Search. Example. 1 Greedy algorithm. 2 Stochastic Greedy Local Search Constraint Satisfaction Problems June 19, 2007 Greedy Local Search Constraint Satisfaction Problems Greedy Local Search Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg

More information

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

Representing Reversible Cellular Automata with Reversible Block Cellular Automata Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 145 154 Representing Reversible Cellular Automata with Reversible Block Cellular Automata Jérôme Durand-Lose Laboratoire

More information

CHAPTER Motivation

CHAPTER Motivation CHAPTER 2 PROBLEM STATEMENT AND OBJECTIVES 2.1 Motivation There is an ever-growing need for data transfer on move.this drives an urgent need to resolve heavy overhead consumption in routing issues. The

More information

Parallel Ant Systems for the Capacitated Vehicle Routing Problem

Parallel Ant Systems for the Capacitated Vehicle Routing Problem Parallel Ant Systems for the Capacitated Vehicle Routing Problem Karl F. Doerner 1, Richard F. Hartl 1, Guenter Kiechle 1, Maria Lucka 2, and Marc Reimann 1,3 1 Department of Management Science, University

More information

Performance Study of Parallel Programming Paradigms on a Multicore Clusters using Ant Colony Optimization for Job-flow scheduling problems

Performance Study of Parallel Programming Paradigms on a Multicore Clusters using Ant Colony Optimization for Job-flow scheduling problems Performance Study of Parallel Programming Paradigms on a Multicore Clusters using Ant Colony Optimization for Job-flow scheduling problems Nagaveni V # Dr. G T Raju * # Department of Computer Science and

More information

Testing LTL Formula Translation into Büchi Automata

Testing LTL Formula Translation into Büchi Automata Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland

More information

QoS Guaranteed Intelligent Routing Using Hybrid PSO-GA in Wireless Mesh Networks

QoS Guaranteed Intelligent Routing Using Hybrid PSO-GA in Wireless Mesh Networks BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 1 Sofia 2015 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2015-0007 QoS Guaranteed Intelligent Routing

More information

Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani. EPEW 2014, Florence

Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani. EPEW 2014, Florence Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani EPEW 2014, Florence Scenario How many cloud instances should be hired? Requests Host hiring servers The number of active servers is controlled

More information

UAV ROUTE PLANNING FOR MAXIMUM TARGET COVERAGES

UAV ROUTE PLANNING FOR MAXIMUM TARGET COVERAGES UAV ROUTE PLANNING FOR MAXIMUM TARGET COVERAGES MURAT KARAKAYA 1 1 Department of Computer Engineering, Atilim University, Ankara, Turkey ABSTRACT Utilization of Unmanned Aerial Vehicles (UAVs) in military

More information

T-79.186 Reactive Systems: Introduction and Finite State Automata

T-79.186 Reactive Systems: Introduction and Finite State Automata T-79.186 Reactive Systems: Introduction and Finite State Automata Timo Latvala 14.1.2004 Reactive Systems: Introduction and Finite State Automata 1-1 Reactive Systems Reactive systems are a class of software

More information

Cloud Task Scheduling Based on Ant Colony Optimization

Cloud Task Scheduling Based on Ant Colony Optimization The International Arab Journal of Information Technology, Vol 2, No 2, March 25 29 Cloud Tas Scheduling Based on Ant Colony Optimization Medhat Tawfee, Ashraf El-Sisi, Arabi Kesh and Fawzy Torey Faculty

More information

Algorithmic Software Verification

Algorithmic Software Verification Algorithmic Software Verification (LTL Model Checking) Azadeh Farzan What is Verification Anyway? Proving (in a formal way) that program satisfies a specification written in a logical language. Formal

More information

Operation Scheduling: Algorithms and Applications

Operation Scheduling: Algorithms and Applications Chapter 13 Operation Scheduling: Algorithms and Applications Gang Wang, Wenrui Gong, and Ryan Kastner Abstract Operation scheduling (OS) is an important task in the high-level synthesis process. An inappropriate

More information

The ACO Encoding. Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson

The ACO Encoding. Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson The ACO Encoding Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson School of Computing and Centre for Reasoning, University of Kent, Canterbury, UK {A.Moraglio, F.E.B.Otero, C.G.Johnson}@kent.ac.uk

More information

Biogeography Based Optimization (BBO) Approach for Sensor Selection in Aircraft Engine

Biogeography Based Optimization (BBO) Approach for Sensor Selection in Aircraft Engine Biogeography Based Optimization (BBO) Approach for Sensor Selection in Aircraft Engine V.Hymavathi, B.Abdul Rahim, Fahimuddin.Shaik P.G Scholar, (M.Tech), Department of Electronics and Communication Engineering,

More information

A novel ACO technique for Fast and Near Optimal Solutions for the Multi-dimensional Multi-choice Knapsack Problem

A novel ACO technique for Fast and Near Optimal Solutions for the Multi-dimensional Multi-choice Knapsack Problem A novel ACO technique for Fast and Near Optimal Solutions for the Multi-dimensional Multi-choice Knapsack Problem Shahrear Iqbal, Md. Faizul Bari, Dr. M. Sohel Rahman AlEDA Group Department of Computer

More information

Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling

Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling R.G. Babukartik 1, P. Dhavachelvan 1 1 Department of Computer Science, Pondicherry University, Pondicherry, India {r.g.babukarthik,

More information

Quick Start Guide. June 3, 2012

Quick Start Guide. June 3, 2012 The ERIGONE Model Checker Quick Start Guide Mordechai (Moti) Ben-Ari Department of Science Teaching Weizmann Institute of Science Rehovot 76100 Israel http://stwww.weizmann.ac.il/g-cs/benari/ June 3, 2012

More information

Integrating Evolutionary Computation Components in Ant Colony Optimization

Integrating Evolutionary Computation Components in Ant Colony Optimization Integrating Evolutionary Computation Components in Ant Colony Optimization S. Alonso, O. Cordón, I. Fernández de Viana, F. Herrera Sergio Alonso Department of Computer Science and Artificial Intelligence

More information

A Survey on Load Balancing Techniques Using ACO Algorithm

A Survey on Load Balancing Techniques Using ACO Algorithm A Survey on Load Balancing Techniques Using ACO Algorithm Preeti Kushwah Department of Computer Science & Engineering, Acropolis Institute of Technology and Research Indore bypass road Mangliya square

More information

ACO Based Dynamic Resource Scheduling for Improving Cloud Performance

ACO Based Dynamic Resource Scheduling for Improving Cloud Performance ACO Based Dynamic Resource Scheduling for Improving Cloud Performance Priyanka Mod 1, Prof. Mayank Bhatt 2 Computer Science Engineering Rishiraj Institute of Technology 1 Computer Science Engineering Rishiraj

More information

A Novel ACO Algorithm for Dynamic Binary Chains based on Changes in the System s Stability

A Novel ACO Algorithm for Dynamic Binary Chains based on Changes in the System s Stability A Novel ACO Algorithm for Dynamic Binary Chains based on Changes in the System s Stability Claudio Iacopino and Phil Palmer Surrey Space Centre, University of Surrey Guildford, GU2 7XH, United Kingdom

More information

A Comparative Study of Scheduling Algorithms for Real Time Task

A Comparative Study of Scheduling Algorithms for Real Time Task , Vol. 1, No. 4, 2010 A Comparative Study of Scheduling Algorithms for Real Time Task M.Kaladevi, M.C.A.,M.Phil., 1 and Dr.S.Sathiyabama, M.Sc.,M.Phil.,Ph.D, 2 1 Assistant Professor, Department of M.C.A,

More information

Optimizing Resource Consumption in Computational Cloud Using Enhanced ACO Algorithm

Optimizing Resource Consumption in Computational Cloud Using Enhanced ACO Algorithm Optimizing Resource Consumption in Computational Cloud Using Enhanced ACO Algorithm Preeti Kushwah, Dr. Abhay Kothari Department of Computer Science & Engineering, Acropolis Institute of Technology and

More information

Model Checking of Software

Model Checking of Software Model Checking of Software Patrice Godefroid Bell Laboratories, Lucent Technologies SpecNCheck Page 1 August 2001 A Brief History of Model Checking Prehistory: transformational programs and theorem proving

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Towards believable resource gathering behaviours in real -time strategy games with a memetic ant colony

More information

International Journal of Scientific Research Engineering & Technology (IJSRET)

International Journal of Scientific Research Engineering & Technology (IJSRET) CHROME: IMPROVING THE TRANSMISSION RELIABILITY BY BANDWIDTH OPTIMIZATION USING HYBRID ALGORITHM 1 Ajeeth Kumar J, 2 C.P Maheswaran, Noorul Islam University Abstract - An approach to improve the transmission

More information

An ACO-Based Scheduling Strategy on Load Balancing in Cloud Computing Environment

An ACO-Based Scheduling Strategy on Load Balancing in Cloud Computing Environment An ACO-Based Scheduling Strategy on Load Balancing in Cloud Computing Environment Wei-Tao Wen, Chang-Dong Wang, De-Shen Wu and Ying-Yan Xie School of Mobile Information Engineering, Sun Yat-sen University,

More information

The Application Research of Ant Colony Algorithm in Search Engine Jian Lan Liu1, a, Li Zhu2,b

The Application Research of Ant Colony Algorithm in Search Engine Jian Lan Liu1, a, Li Zhu2,b 3rd International Conference on Materials Engineering, Manufacturing Technology and Control (ICMEMTC 2016) The Application Research of Ant Colony Algorithm in Search Engine Jian Lan Liu1, a, Li Zhu2,b

More information

THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:

THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties: THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces

More information

Comparative Study of Ant Colony Optimization and Particle Swarm Optimization for Grid Scheduling

Comparative Study of Ant Colony Optimization and Particle Swarm Optimization for Grid Scheduling R. Shakerian, S. H. Kamali, M. Hedayati, M. Alipour/ TJMCS Vol.2 No.3 (2011) 469-474 The Journal of Mathematics and Computer Science Available online at http://www.tjmcs.com The Journal of Mathematics

More information

Proposed Software Testing Using Intelligent techniques (Intelligent Water Drop (IWD) and Ant Colony Optimization Algorithm (ACO))

Proposed Software Testing Using Intelligent techniques (Intelligent Water Drop (IWD) and Ant Colony Optimization Algorithm (ACO)) www.ijcsi.org 91 Proposed Software Testing Using Intelligent techniques (Intelligent Water Drop (IWD) and Ant Colony Optimization Algorithm (ACO)) Laheeb M. Alzubaidy 1, Baraa S. Alhafid 2 1 Software Engineering,

More information

Manjeet Kaur Bhullar, Kiranbir Kaur Department of CSE, GNDU, Amritsar, Punjab, India

Manjeet Kaur Bhullar, Kiranbir Kaur Department of CSE, GNDU, Amritsar, Punjab, India Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Multiple Pheromone

More information

Integration of ACO in a Constraint Programming Language

Integration of ACO in a Constraint Programming Language Integration of ACO in a Constraint Programming Language Madjid Khichane 12, Patrick Albert 1, and Christine Solnon 2 1 ILOG 2 LIRIS, UMR 5205 CNRS / University of Lyon ANTS 08 Motivations Ant Colony Optimization

More information

A SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION

A SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 2, February 2014,

More information

Development of Model-Ant Colony Optimization (ACO) in Route Selection Based on Behavioral User was Transport in Semarang, Indonesia

Development of Model-Ant Colony Optimization (ACO) in Route Selection Based on Behavioral User was Transport in Semarang, Indonesia International Refereed Journal of Engineering and Science (IRJES) ISSN (Online) 2319-183X, (Print) 2319-1821 Volume 3, Issue 6 (June 2014), PP.09-18 Development of Model-Ant Colony Optimization (ACO) in

More information

Extended Finite-State Machine Inference with Parallel Ant Colony Based Algorithms

Extended Finite-State Machine Inference with Parallel Ant Colony Based Algorithms Extended Finite-State Machine Inference with Parallel Ant Colony Based Algorithms Daniil Chivilikhin PhD student ITMO University Vladimir Ulyantsev PhD student ITMO University Anatoly Shalyto Dr.Sci.,

More information