Author:
Filiot Emmanuel,Jin Naiyong,Raskin Jean-François
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;M. Abadi,1989
2. Acacia (2009), http://www.antichains.be
3. Lecture Notes in Computer Science;R. Alur,1998
4. Bouajjani, A., Habermehl, P., Holík, L., Touili, T., Vojnar, T.: Antichain-based universality and inclusion testing over nondeterministic finite tree automata. In: CIAA, pp. 57–67 (2008)
5. Lecture Notes in Computer Science;M. Wulf De,2006
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Synthesizing LTL contracts from component libraries using rich counterexamples;Science of Computer Programming;2024-09
2. Closure Certificates;Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control;2024-05-14
3. SynthLearn: A Tool for Guided Reactive Synthesis;Lecture Notes in Computer Science;2024
4. Fully Generalized Reactivity(1) Synthesis;Lecture Notes in Computer Science;2024
5. Fairness, assumptions, and guarantees for extended bounded response LTL+P synthesis;Software and Systems Modeling;2023-08-11