Shahid Jabbar

Learn More
In this paper we present Parallel External A*, a parallel variant of external memory directed model checking. As a model scales up, its successors generation becomes complex and, in turn, starts to impact the running time of the model checker. Probings of our external memory model checker IO-HSF-SPIN revealed that in some of the cases about 70% of the whole(More)
This paper provides a generic approach for map generation based on Global Positioning System (GPS) traces especially for unknown terrains. The system uses AI algorithms to infer the road geometry. Given a set of GPS traces, this input is refined by filtering and partitioning algorithms. For constructing the graph, clustering algorithms are applied that(More)
This paper provides a novel approach for optimal route planning by making efficient use of the underlying geometrical structure. It combines classical artificial intelligence exploration with computational geometry. Given a set of global positioning system (GPS) trajectories, the input is refined by geometric filtering and rounding algorithms. For(More)
Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems. Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the set of reachable markings. Typical exploration(reachability analysis) approaches are undirected and do not take into(More)
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation , concurrency, mobility and distribution. State spaces of such systems can be represented by graph transition systems, which are basically transition systems whose states and transitions represent graphs and graph morphisms.(More)
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the cost-optimal solution. We contribute a procedure for finding the upper bound on the locality of the search in planning graphs that dictates the number of layers that have to be kept to(More)