Skip to Main Content Area
CPS-VO
Contact Support
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Verification Tool Library
Home
README
Search for Tools
Browse Tool Library
Members
Tutorials
Tutorial - SpaceEx
Files
CPS-VO
»
CPS Tools and Design Studios
»
Verification Tool Library
» CONTACT THE AUTHOR
Contact the author
wikipage
CADP
Submitted by hgaravel on Thu, 08/16/2018 - 8:29pm
Validation and Verification
Tool
Contact the author
Free
C++
Own interface
Own language
Linux
Mac OS X
Solaris
Windows
Circuits
Continuous-time Markov chains
Discrete-Time Systems
Nested-Unit Petri nets
Network of timed automata
Process calculus language: FSP
Process calculus language: LNT
Process calculus language: LOTOS
Abstractions
Bisimulation minimization
Boolean Equation Systems
Branching-Time Temporal Logics
Breadth First Search Analysis
Compositional verification
Depth-first Search Algorithms
Description/Modeling Language
Distributed model checking
Labelled Transition Systems
Mu-Calculus
On-the-fly model checking
Parallel Composition
Parameterized Boolean Equation Systems
Probabilities on paths
Value-passing Mu-Calculus
Guaranteed to terminate
Not guaranteed to terminate
Bisimulation generation
Description/modeling language
Model checking
Modeling
Probabilistic model checking
Reachability analysis
Simulation
Statistical model checking
Visual checking
wikipage
HyReach
Submitted by akarns on Mon, 05/08/2017 - 12:30pm
Validation and Verification
Tool
Contact the author
Matlab
Linux
Mac OS X
Windows
Linear Hybrid Systems
Flowpipe overapproximations
Support functions
Guaranteed to terminate
Reachability analysis
wikipage
Open-Kronos
Submitted by akarns on Mon, 05/08/2017 - 12:14pm
Validation and Verification
Tool
Contact the author
Own language
Timed Automata
Depth-first Search Algorithms
On-the-fly model checking
Guaranteed to terminate
Model checking
wikipage
d/dt
Submitted by admin on Tue, 02/21/2017 - 5:14pm
Validation and Verification
Tool
Contact the author
Own language
Linear hybrid systems with nondeterministic input
Under approximations of maximal invariant sets
Polyhedral representations and approximations
Guaranteed to terminate
Reachability analysis
