Colored Automata in Declare

I just finished the implementation of colored automata in Declare.  The formal foundation is described in [bibtex order=asc file=conferences.bib key=colored-automata] The idea is that normally we construct an automaton accepting only all valid executions.  Assume we look at the model: The model says that “if you are bored, you should go to a concert” (the […]

Read More… from Colored Automata in Declare