etienneandre / 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.

Home Page:https://lipn.univ-paris13.fr/~andre/software/InSPEQTor/

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

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.

https://lipn.univ-paris13.fr/~andre/software/InSPEQTor/

License:GNU General Public License v3.0


Languages

Language:OCaml 95.3%Language:TeX 2.4%Language:Makefile 1.4%Language:Python 1.0%