Explore projects
-
un outil qui regroupe les deux approaches. Il prend en entrée un fichier .dot modelisant le graphe ou un nombre n pour construire un graphe aleatoire avec n noeuds puis calcule la solution optimale .
Updated -
Fault-Tolerant Communication-Avoiding and Tall-and-Skinny matrix factorizations (LU, QR, Cholesky)
Updated -
PMC-SOG / Distributed-SOG
GNU General Public License v3.0 onlyUpdated -
SolidityCPN / SolidityCPN
GNU General Public License v3.0 or laterUpdated -
Updated
-
PMC-SOG / Hybrid-SOG
GNU General Public License v3.0 onlyUpdated -
PMC-SOG / PN-Parser
GNU General Public License v3.0 onlyUpdated -
Updated
-
Updated
-
Updated
-
SolidityCPN / Unfolding
GNU General Public License v3.0 or laterUpdated -
PMC-SOG / sogMBT
GNU General Public License v3.0 or laterSymbolic Observation Graph-Based Generation of Test Paths
Updated -
Ikram GARFATTA / sol2cpn
GNU General Public License v3.0 or laterUpdated -
PMC-SOG / Buddy
OtherUpdated