Model checking based service delivery planning

Service delivery planning may often involve plan specific ordering or sequencing especially in non-euclidean transit environments. Common approaches for vehicle routing fall short in adequately handling compound ad-hoc plan dependent constraints. We address multi-agent service provisioning by starti...

Full description

Saved in:
Bibliographic Details
Published in2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE) pp. 1 - 4
Main Authors Soeanu, Andrei, Ray, S., Debbabi, M., Berger, J., Boukhtouta, A., Ghanmi, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2012
Subjects
Encoding
Fuels
Intelligent Transportation
Planning
Radiation detectors
Symbolic Model Checking
Tour Planning
Traveling Repairman Problem
Vehicle dynamics
Vehicles
Online AccessGet full text
ISBN1467314315
9781467314312
ISSN0840-7789
DOI10.1109/CCECE.2012.6334956

Cover

More Information
Summary:Service delivery planning may often involve plan specific ordering or sequencing especially in non-euclidean transit environments. Common approaches for vehicle routing fall short in adequately handling compound ad-hoc plan dependent constraints. We address multi-agent service provisioning by starting from different initial nodes of shared irregular transport graphs. We employ concurrent and interleaved dynamics composition to capture agent based service delivery problems as transition systems and related goal state properties that can be the subject of symbolic model checking. Formally verifying the negation of the goal state property allows to generate a counter example such that, if it exists, the route allocation planning problem finds a solution. The state explosion is mitigated by bounded model checking that has the additional advantage of providing counter examples of minimal length which correspond to minimized agent tours under a cost bound.
ISBN:1467314315
9781467314312
ISSN:0840-7789
DOI:10.1109/CCECE.2012.6334956