- Get one or all possible solutions for a formula
- Simplify a formula (limited functionality)
- (De-) parenthesise a formula
- Evaluate a CTL formula on a given model
- Generate a boolean formula
- Generate a CTL formula
- Generate a Kripke Structure
- Generate a Finite Automaton
- Encode a Kripke Structure into a boolean formula
- Get a trace from a start state to a goal state
- Get the shortest trace
- Select an algorithm to apply on a Finite Automata
- Code your own implementation and test it
- Got rid of Args, ShadowJar (replaced by bootJar) among other things
- Restructured project so gradle finds it automatically
- This enables us to use native compilation!
- Groups states from which you can reach all other states in group
- Expanded validator and report classes to take an arbitrary type with custom equals
- Added solution information to algorithms
- Checks if one automaton can be simulated by another one
- It encodes end states at all steps
- Checks if all 'isEncodingEnd' states are reachable
- Classes are grouped by concept and not by function
- Adapted CTL Lexer, Parser, and Interpreter to other concepts
- Added CTL formula generator
- Contains static methods that log to
System.out
even when called inResult
- Added video on how to create and test your own algorithm to frontend
- Report is saved in
/resources
- Clicking the button inverts the graph colors for all graphs
- Also uploaded corresponding video tutorials to youtube.com/@LogiVis
- Made
.jar
buildable with one single command - Replaced application entry points with a single one
- What is run is now defined by program arguments
- Slightly adapted READMEs
- Get one or all possible solutions for a formula
- Simplify a formula (limited functionality)
- (De-) parenthesise a formula
- Evaluate a CTL formula on a given model
- Generate a boolean formula
- Generate a Kripke Structure
- Generate a Finite Automaton
- Encode a Kripke Structure into a boolean formula
- Get a trace from a start state to a goal state
- Get the shortest trace
- Select an algorithm to apply on a Finite Automata
- Code your own implementation and test it