Open Access
Lecture Notes in Computer Science, pages 263-277
An Antichain Algorithm for LTL Realizability
Publication type: Book Chapter
Publication date: 2009-06-22
Journal:
Lecture Notes in Computer Science
Q2
SJR: 0.606
CiteScore: 2.6
Impact factor: —
ISSN: 03029743, 16113349, 18612075, 18612083
Abstract
In this paper, we study the structure of underlying automata based constructions for solving the LTL realizability and synthesis problem. We show how to reduce the LTL realizability problem to a game with an observer that checks that the game visits a bounded number of times accepting states of a universal co-Büchi word automaton. We show that such an observer can be made deterministic and that this deterministic observer has a nice structure which can be exploited by an incremental algorithm that manipulates antichains of game positions. We have implemented this new algorithm and our first results are very encouraging.
Found
Found
Top-30
Journals
|
5
10
15
20
25
30
35
40
|
|
|
Lecture Notes in Computer Science
39 publications, 53.42%
|
|
|
International Journal on Software Tools for Technology Transfer
6 publications, 8.22%
|
|
|
Electronic Proceedings in Theoretical Computer Science, EPTCS
4 publications, 5.48%
|
|
|
Acta Informatica
3 publications, 4.11%
|
|
|
Formal Methods in System Design
2 publications, 2.74%
|
|
|
Communications in Computer and Information Science
2 publications, 2.74%
|
|
|
Proceedings of the ACM on Programming Languages
1 publication, 1.37%
|
|
|
Real-Time Systems
1 publication, 1.37%
|
|
|
Discrete Event Dynamic Systems: Theory and Applications
1 publication, 1.37%
|
|
|
Communications of the ACM
1 publication, 1.37%
|
|
|
ACM Transactions on Computational Logic
1 publication, 1.37%
|
|
|
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
1 publication, 1.37%
|
|
|
IEICE Transactions on Information and Systems
1 publication, 1.37%
|
|
|
Science of Computer Programming
1 publication, 1.37%
|
|
|
5
10
15
20
25
30
35
40
|
Publishers
|
10
20
30
40
50
60
|
|
|
Springer Nature
54 publications, 73.97%
|
|
|
Association for Computing Machinery (ACM)
8 publications, 10.96%
|
|
|
electronic proceedings in theoretical computer science, eptcs
4 publications, 5.48%
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
3 publications, 4.11%
|
|
|
Institute of Electronics, Information and Communications Engineers (IEICE)
1 publication, 1.37%
|
|
|
Elsevier
1 publication, 1.37%
|
|
|
10
20
30
40
50
60
|
- We do not take into account publications without a DOI.
- Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
Cite this
GOST |
RIS |
BibTex
Cite this
GOST
Copy
Filiot E., Jin N., Raskin J. An Antichain Algorithm for LTL Realizability // Lecture Notes in Computer Science. 2009. pp. 263-277.
GOST all authors (up to 50)
Copy
Filiot E., Jin N., Raskin J. An Antichain Algorithm for LTL Realizability // Lecture Notes in Computer Science. 2009. pp. 263-277.
Cite this
RIS
Copy
TY - GENERIC
DO - 10.1007/978-3-642-02658-4_22
UR - https://doi.org/10.1007/978-3-642-02658-4_22
TI - An Antichain Algorithm for LTL Realizability
T2 - Lecture Notes in Computer Science
AU - Filiot, Emmanuel
AU - Jin, Naiyong
AU - Raskin, Jean-François
PY - 2009
DA - 2009/06/22
PB - Springer Nature
SP - 263-277
SN - 0302-9743
SN - 1611-3349
SN - 1861-2075
SN - 1861-2083
ER -
Cite this
BibTex (up to 50 authors)
Copy
@incollection{2009_Filiot,
author = {Emmanuel Filiot and Naiyong Jin and Jean-François Raskin},
title = {An Antichain Algorithm for LTL Realizability},
publisher = {Springer Nature},
year = {2009},
pages = {263--277},
month = {jun}
}