A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata
[article]
2019
arXiv
pre-print
Preserved Fulltext
This paper proposes a new algorithm for the generation of unambiguous B\"uchi automata (UBA) from LTL formulas. ...
Unlike existing tableau-based LTL-to-UBA translations, our algorithm deals with very weak alternating automata (VWAA) as an intermediate representation. ...
To the best of our knowledge, unambiguity for alternating automata has not been considered before. ...
arXiv:1907.02887v1
fatcat:ziqqezuqsnhhhf6rtp7ox2j7be
Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing (Dagstuhl Seminar 14022) Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031) Planning with Epistemic Goals (Dagstuhl Seminar 14032)
2014
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
As established by Harju and Karhumäki, this decision result extends to unambiguous transducers via Malcev-Neumann theorem. ...
Our main result, extending the classical result of Büchi, shows that if the weights are taken from an arbitrary semiring, then weighted automata and a syntactically defined fragment of our weighted logic ...
We plan to reach out to other European NRENs and will also sollicit input from the security and network industry. ...
fatcat:iqk466everfcdhf5guvz5ph2ee
Dagstuhl Reports, Volume 9, Issue 2, February 2019, Complete Issue
[article]
2019
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We plan to write a third document with the key principles of AI for Social Good projects, to serve as a call to action. ...
Kobourov Verification and Synthesis of Human-Robot Interaction We plan to write a Global Challenges manuscript that relates examples of AI for Social Good projects to the Sustainable Developmental Goals ...
Streaming languages provide the foundation to reason about big data streaming platforms. One issue with i.e., LTL to Nondeterministic Büchi Automata translation. ...
doi:10.4230/dagrep.9.2
fatcat:ldqjjo5eqffszji56jhkmocl34
Support for Model Checking Z Specifications
2016
2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Translating inputs of a Z specification into a language that an existing model checker tool accepts is an alternative method. ...
To build a model checker directly for a Z specification would take considerable effort and time due to the abstraction of the language. ...
The second large amount of time taken was used to create monitor or buchi-automata for LTL property used on this theorem of this specification. ...
doi:10.1109/iri.2016.38
dblp:conf/iri/Siregar16
fatcat:zal4usa3lrhppctqal2ga6bx6u