Efficient On-the-Fly Model Checking for LTL and CTL★.
-
Updated
Dec 21, 2019 - Haskell
Efficient On-the-Fly Model Checking for LTL and CTL★.
A Java library that allows you to check whether a given transition system (described as a Kripke structure) satisfies a given computation tree logic (CTL) formula.
Computer Scientist Master Degree - Thesis Work
High-Performance Model Checker developed for multicore, multiprocessors machines (NUMA).
MiniCheck is a CLI for CTL and bounded LTL model checking on transition systems.
Petri Game Strategy Synthesis
Python utilities for studying logic including Finite Automata, Oracles, Kripke Structures, Process Algebra, LTL, CTL, Petri Nets, Propositional Logic, BCP, DPLL, Resolution, Blocked Clauses, Equational Reasoning, Term Matching, Term Reduction, Critical Pairs, Knuth-Bendix Completion, etc.
Formal Modeling project M2
Add a description, image, and links to the ctl-formulas topic page so that developers can more easily learn about it.
To associate your repository with the ctl-formulas topic, visit your repo's landing page and select "manage topics."