Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Leander Tentrup, Alexander Weinert, Martin Zimmermann

Journal title: Electronic Proceedings in Theoretical Computer Science

Journal number: 226

Journal publisher: EPTCS

Published year: 2016

Published pages: 302-315

DOI identifier: 10.4204/EPTCS.226.21

ISSN: 2075-2180