Timeline for What are practically computable properties of Labelled Transition Systems?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2020 at 18:38 | comment | added | wanderingmathematician | @MarkReitblatt I'm a bit confused now. Wikipedia says that model checking linear modal mu calculus is PSPACE-complete, and I was under the impression that linear modal mu calculus is a proper subset of modal mu calculus and thus model checking modal mu calc should also be PSPACE-complete. In which step did I go awry here? | |
| Apr 18, 2011 at 16:12 | history | edited | Dave Clarke | CC BY-SA 3.0 |
Hacked broken latex.
|
| Feb 17, 2011 at 20:27 | comment | added | Mark Reitblatt | The model checking problem is in $NP\cap coNP$. The decision problem is $EXP$-time complete, I believe. | |
| Feb 17, 2011 at 19:45 | history | answered | Aubrey da Cunha | CC BY-SA 2.5 |