You can create instances of a Kripke Structure, set/reset Atoms, add/remove States, add/remove Start States, add/remove Transitions to/from it. Then you can perform Explicit-State Model Checking on the Kripke Structure, checking composite Computation Tree Logic (CTL) formula on it. We support the CTL operators: **EX, EU, EG, EF, AX, AU, AG, AF**, and the Propositional Logic operators: **NOT, AND, OR, IMPLIES, IFF.**
**Full Changelog**: https://github.com/marcusm117/mctk/commits/v0.1.0
What's next?
You'll be able to write a CTL formula in text, and our parser will convert it to a series of function calls to the CTL operator functions.