×

Found 24 Documents (Results 1–24)

100
MathJax

Uniformisations of regular relations over bi-infinite words. (English) Zbl 07299483

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 384-396 (2020).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

Infinite and bi-infinite words with decidable monadic theories. (English) Zbl 1434.03102

Kreutzer, Stephan (ed.), 24th EACSL annual conference and 29th workshop on computer science logic, CSL’15, Berlin, Germany, September 7–10, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 41, 472-486 (2015).
MSC:  03D05 03B16
PDF BibTeX XML Cite
Full Text: DOI

Benchmarking model- and satisfiability-checking on bi-infinite time. (English) Zbl 1161.68580

Fitzgerald, John S. (ed.) et al., Theoretical aspects of computing – ICTAC 2008. 5th international colloquium, Istanbul, Turkey, September 1–3, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85761-7/pbk). Lecture Notes in Computer Science 5160, 290-304 (2008).
MSC:  68Q60 03B44 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Year of Publication

all top 3

Classification

Software