lp:~tapaal-ltl/verifypn/automata-stubborn-sets
Created by
Nikolaj Jensen Ulrik
and last modified
- Get this branch:
- bzr branch lp:~tapaal-ltl/verifypn/automata-stubborn-sets
Members of
tapaal-ltl
can upload to this branch. Log in for directions.
Branch merges
Propose for merging
No branches
dependent on this one.
Branch information
Recent revisions
- 267. By Simon Virenfeldt
-
If the retarding formula is not satisfied in an accepting state treat it as a progressing formula. Du not run clojure if the retarding formula is not satisfied.
- 266. By Simon Virenfeldt
-
Changed condition when we are in an accepting state. Now we do the closure on the complement of the negated retarding formula. This will add significantly more states to the stubborn set, it is however not inconcieveable that a lot of transitions are interesting wrt. staying in the accepting state.
Branch metadata
- Branch format:
- Branch format 7
- Repository format:
- Bazaar repository format 2a (needs bzr 1.16 or later)
- Stacked on:
- lp:verifypn