Skip to content

InSPEqTor (INference of Shortest Paths with EQuivalent abstracT behaviOR) is a prototype implementation to compute parameter valuations in parametric directed weighted graphs such that shortest paths are preserved.

License

Notifications You must be signed in to change notification settings

etienneandre/InSPEQTor

Repository files navigation

InSPEqTor

InSPEqTor (INference of Shortest Paths with EQuivalent abstracT behaviOR) is a prototype implementation to compute parameter valuations in parametric directed weighted graphs such that shortest paths are preserved.

In other words, given a parametric directed weighted graph and a valuation of the parameters, InSPEqTor synthesizes valuations for the parametric weights such that the shortest paths between any two nodes remain preserved.

Inputs and outputs

Inputs

  • a parametric directed weighted graphs
  • a reference valuation for the parameters

Outputs

  • a set of parameter valuations for which the shortest paths remain preserved between any pair of nodes

Keywords

  • parametric directed weighted graph
  • parameter synthesis
  • Floyd-Warshall
  • shortest paths
  • robustness

Contact

Étienne André

(Tool developed in 2008-2010)

Bibliography

About

InSPEqTor (INference of Shortest Paths with EQuivalent abstracT behaviOR) is a prototype implementation to compute parameter valuations in parametric directed weighted graphs such that shortest paths are preserved.

Topics

Resources

License

Stars

Watchers

Forks