![]() | ![]() |
| 2012 | ||
|---|---|---|
| 8 | Andreas Morgenstern, Manuel Gesell, Klaus Schneider: An Asymptotically Correct Finite Path Semantics for LTL. LPAR 2012: 304-319 | |
| 2011 | ||
| 7 | Andreas Morgenstern, Klaus Schneider: Program Sketching via CTL* Model Checking. SPIN 2011: 126-143 | |
| 6 | Andreas Morgenstern, Klaus Schneider: A LTL Fragment for GR(1)-Synthesis iWIGP 2011: 33-45 | |
| 2010 | ||
| 5 | Andreas Morgenstern, Klaus Schneider: Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis GANDALF 2010: 89-102 | |
| 4 | Andreas Morgenstern: Symbolic controller synthesis for LTL specifications. University of Kaiserslautern 2010: 1-151 | |
| 2008 | ||
| 3 | Andreas Morgenstern, Klaus Schneider: From LTL to Symbolically Represented Deterministic Automata. VMCAI 2008: 279-293 | |
| 2005 | ||
| 2 | Andreas Morgenstern, Klaus Schneider: A unified model checking framework for the supervisor synthesis problem. GALOP 2005: 140-156 | |
| 1 | Andreas Morgenstern, Klaus Schneider: Synthesizing deterministic controllers in supervisory control. ICINCO 2005: 24-31 | |
| 1 | Manuel Gesell | [8] |
| 2 | Klaus Schneider | [1] [2] [3] [5] [6] [7] [8] |
Data released under the ODC-BY 1.0 license — See also our legal information page