Finite-trace and generalized-reactivity specifications in temporal synthesis
Linear Temporal Logic (LTL) synthesis aims at automatically synthesizing a program that complies with desired properties expressed in LTL. Unfortunately it has been proved to be too difficult computationally to perform full LTL synthesis. There have been two success stories with LTL synthesis, both...
主要な著者: | De Giacomo, G, Di Stasio, A, Tabajara, LM, Vardi, MY, Zhu, S |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Springer
2023
|
類似資料
-
Reactive synthesis for finite tasks under resource constraints
著者:: He, K, 等
出版事項: (2017) -
LTLf synthesis under environment specifications for reachability and safety properties
著者:: Aminof, B, 等
出版事項: (2023) -
Reactive Planner Synthesis Under Temporal Logic Specifications
著者:: Hyeonkyu Seong, 等
出版事項: (2024-01-01) -
Reactive synthesis of dominant strategies
著者:: Aminof, B, 等
出版事項: (2023) -
Solving parity games using an automata-based algorithm
著者:: Di Stasio, A, 等
出版事項: (2016)