Zobrazeno 1 - 10
of 201
pro vyhledávání: '"Orna Kupferman"'
Autor:
Orna Kupferman
Publikováno v:
Frontiers in Computer Science, Vol 4 (2023)
Nondeterminism models an ability to see the future: An automaton with an infinite look ahead can successfully resolve its nondeterministic choices. An automaton is history deterministic (HD) if it can successfully resolve its nondeterministic choices
Externí odkaz:
https://doaj.org/article/f2a345f121924ecdb69aa8802d11a2f1
Autor:
Bader Abu Radi, Orna Kupferman
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata. The latter are nondeterministic automata that can resolve their n
Externí odkaz:
https://doaj.org/article/fc1e8b3f68ba4ae3a1b1f992edaea872
Autor:
Orna Kupferman, Gal Vardi
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 4 (2019)
Flow networks have attracted a lot of research in computer science. Indeed, many questions in numerous application areas can be reduced to questions about flow networks. Many of these applications would benefit from a framework in which one can forma
Externí odkaz:
https://doaj.org/article/c695ebd49eed48a6b8646a89d9eacd60
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 119, Iss Proc. GandALF 2013, Pp 107-121 (2013)
The determinization of Buchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been a steady progress of constructions: by McNaughton, Safra, Piterman, Sc
Externí odkaz:
https://doaj.org/article/f310b798006d4984b5fc1b01a9b33197
Publikováno v:
Games, Vol 9, Iss 3, p 39 (2018)
Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks mode
Externí odkaz:
https://doaj.org/article/ad201db95f7e4bf6936f13303f4ef4ba
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 1 (2013)
Complementation of B\"uchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation. The first is the rank-based approach of Kupf
Externí odkaz:
https://doaj.org/article/0a8535e88c344db7a609ffc39845a5fc
Autor:
Orna Kupferman, Pawel Sobocinski
This open access book constitutes the proceedings of the 26th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2023, which was held during April 22-27, 2023, in Paris, France, as part of the European J
Autor:
Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli
Publikováno v:
ACM Transactions on Computational Logic. 24:1-38
Temporal logics are extensively used for the specification of on-going behaviors of computer systems. Two significant developments in this area are the extension of traditional temporal logics with modalities that enable the specification of on-going
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a58b84d100a212bf8dfa00f77b42ef5
https://doi.org/10.1145/3582498
https://doi.org/10.1145/3582498
Autor:
Orna Kupferman
Publikováno v:
Foundations and Trends® in Theoretical Computer Science. 15:126-228
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db81e7c461f0fd8057ae9122d17f133f
https://doi.org/10.1561/0400000083
https://doi.org/10.1561/0400000083