21 lines
763 B
Markdown
21 lines
763 B
Markdown
+++
|
|
date = 2025-06-07
|
|
draft = false
|
|
title = 'SM(P/)T'
|
|
subtitle = 'Satisfiability Modulo Petri Net'
|
|
links = [
|
|
# { title = "Homepage", url = "https://www.imitator.fr/", icon = 'fa-solid fa-home' },
|
|
{ title = "Source Code", url = "https://github.com/nicolasAmat/SMPT", icon = 'fa-solid fa-code' },
|
|
# { title = "Playground", url = "https://cvc5.github.io/app/", icon = 'fa-solid fa-gamepad' }
|
|
]
|
|
applications = ['Model Checker']
|
|
developers = ['LAAS-CNRS']
|
|
licenses = ['GPLv3']
|
|
# inputs = ['Sally']
|
|
# interfaces = ['CLI']
|
|
maintenance = ['Actively Maintained']
|
|
# techniques = ['CDCL']
|
|
# publications = ['']
|
|
+++
|
|
|
|
SMPT is a SMT-based model checker for Petri nets focused on reachability problems that takes advantage of net reductions (polyhedral reductions). |