sogMBT
2023Symbolic Observation Graph-Based Generation of Test Paths
Symbolic Observation Graph-Based Generation of Test Paths
Rewriting Logic Semantics for Parametric Time Petri Nets with Inhibitor Arcs
Formal developments and proofs in Coq of numerical analysis problems. This archive includes several Coq developments: - Lebesgue directory is about the Lebesgue Integration of Nonnegative Functions (see paper, paper, and report); - Lebesgue/bochner_integral directory is about the Bochner integral (see report); - LM directory is about the Lax–Milgram theorem (see paper, paper, and report); - Opam package coq-num-analysis: version 1.0 provides Lebesgue, and LM. - Lebesgue and LM are compiling in Coq 8.12 to 8.16.
Rewriting Logic Semantics for Parametric Timed Automata
The L-Framework uses rewrite-based reasoning for proving crucial properties of sequent systems such as admissibility of structural rules, invertibility of rules and cut-elimination. Such procedures have been fully mechanized in Maude, achieving a great degree of automation when used on several sequent systems including intuitionistic and classical logics, linear logic, and normal modal logics.
An Open Source Extensible Verification Environment
A rewriting logic specification for modeling ADTree and solve the optimal scheduling problem
Formal Verification of Solidity Smart Contracts using Coloured Petri Nets
Tool for Parametric Verification and Robustness Analysis of Real-Time Systems with Parameter
Managing Agents in Attack-Defence Scenarios
Parallel Model Checking using the Symbolic Observation Graph
Complex Systems Verification
Tool presentation at PetriNets'08
Fast Acceleration of Symbolic Transition systems
Tool presentation at ACSD'05