13 citations · 23 across the 3 of their papers we have counts for
3 papers
cs.LO2018
Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
Marc Dahlem, Anoop Bhagyanath, Klaus Schneider
Conventional processor architectures are restricted in exploiting instruction level parallelism (ILP) due to the relatively low number of programmer-visible registers. Therefore, m…
cs.LO2011★ 10 cited
A LTL Fragment for GR(1)-Synthesis
Andreas Morgenstern, Klaus Schneider
The idea of automatic synthesis of reactive programs starting from temporal logic (LTL) specifications is quite old, but was commonly thought to be infeasible due to the known doub…
cs.LO2010★ 13 cited
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis
Andreas Morgenstern, Klaus Schneider
The classic approaches to synthesize a reactive system from a linear temporal logic (LTL) specification first translate the given LTL formula to an equivalent omega-automaton and t…