Skip to main content
Journal Article

LTL with past and two-way very-weak alternating automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2747 439-448
DOI: 10.1007/978-3-540-45138-9_38
29Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a translation procedure of PLTL (LTL with past modalities) formulas to Buchi automata using two-way very-weak alternating automata (2VWAA) as an intermiediary step. Our main result is an efficient translation of 2VWAA to generalized Buchi automata (GBA). © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Gastin, P., & Oddoux, D. (2003). LTL with past and two-way very-weak alternating automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 439–448. https://doi.org/10.1007/978-3-540-45138-9_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free