default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Aminof
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c35]Benjamin Aminof, Giuseppe De Giacomo, Gianmarco Parretti, Sasha Rubin:
Effective Approach to LTLf Best-Effort Synthesis in Multi-Tier Environments. IJCAI 2024: 3232-3240- 2023
- [c34]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Reactive Synthesis of Dominant Strategies. AAAI 2023: 6228-6235 - [c33]Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin, Shufang Zhu:
sc ltlf Synthesis Under Environment Specifications for Reachability and Safety Properties. EUMAS 2023: 263-279 - [c32]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger:
Stochastic Best-Effort Strategies for Borel Goals. LICS 2023: 1-13 - [i7]Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin, Shufang Zhu:
LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties. CoRR abs/2308.15184 (2023) - [i6]Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger:
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems. CoRR abs/2310.02466 (2023) - 2022
- [j10]Benjamin Aminof, Aniello Murano
, Sasha Rubin, Florian Zuleger:
Verification of agent navigation in partially-known environments. Artif. Intell. 308: 103724 (2022) - [c31]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger:
Beyond Strong-Cyclic: Doing Your Best in Stochastic Environments. IJCAI 2022: 2525-2531 - 2021
- [c30]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up. IJCAI 2021: 1766-1772 - [c29]Benjamin Aminof, Giuseppe De Giacomo, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Synthesizing Best-effort Strategies under Multiple Environment Specifications. KR 2021: 42-51 - 2020
- [c28]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Stochastic Fairness and Language-Theoretic Fairness in Planning in Nondeterministic Domains. ICAPS 2020: 20-28 - [c27]Benjamin Aminof, Giuseppe De Giacomo, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Synthesizing strategies under expected and exceptional environment behaviors. IJCAI 2020: 1674-1680
2010 – 2019
- 2019
- [c26]Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin:
Planning under LTL Environment Specifications. ICAPS 2019: 31-39 - [c25]Benjamin Aminof, Marta Kwiatkowska, Bastien Maubert, Aniello Murano, Sasha Rubin:
Probabilistic Strategy Logic. IJCAI 2019: 32-38 - [i5]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains. CoRR abs/1912.11203 (2019) - 2018
- [j9]Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized model checking of rendezvous systems. Distributed Comput. 31(3): 187-222 (2018) - [j8]Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Graded modalities in Strategy Logic. Inf. Comput. 261: 634-649 (2018) - [j7]Benjamin Aminof, Aniello Murano, Sasha Rubin:
CTL* with graded path modalities. Inf. Comput. 262: 1-21 (2018) - [c24]Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin:
Synthesis under Assumptions. KR 2018: 615-616 - [c23]Benjamin Aminof, Sasha Rubin, Ilina Stoilkovska, Josef Widder, Florian Zuleger:
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction. VMCAI 2018: 1-24 - [i4]Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin:
Planning and Synthesis Under Assumptions. CoRR abs/1807.06777 (2018) - 2017
- [j6]Benjamin Aminof, Sasha Rubin:
First-cycle games. Inf. Comput. 254: 195-216 (2017) - 2016
- [c22]Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Graded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria. AAMAS 2016: 698-706 - [c21]Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments. AAMAS 2016: 1190-1199 - [c20]Benjamin Aminof, Sasha Rubin:
Model Checking Parameterised Multi-token Systems via the Composition Method. IJCAR 2016: 499-515 - [c19]Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Prompt Alternating-Time Epistemic Logics. KR 2016: 258-267 - [c18]Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Extended Graded Modalities in Strategy Logic. SR 2016: 1-14 - [i3]Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger:
Liveness of Parameterized Timed Networks. CoRR abs/1609.04176 (2016) - 2015
- [c17]Benjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni:
Liveness of Parameterized Timed Networks. ICALP (2) 2015: 375-387 - [c16]Benjamin Aminof, Aniello Murano, Sasha Rubin:
On CTL* with Graded Path Modalities. LPAR 2015: 281-296 - [c15]Benjamin Aminof, Sasha Rubin, Florian Zuleger:
On the Expressive Power of Communication Primitives in Parameterised Systems. LPAR 2015: 313-328 - [c14]Sasha Rubin, Florian Zuleger, Aniello Murano, Benjamin Aminof:
Verification of Asynchronous Mobile-Robots in Partially-Known Environments. PRIMA 2015: 185-200 - 2014
- [j5]Benjamin Aminof, Fabio Mogavero, Aniello Murano:
Synthesis of hierarchical systems. Sci. Comput. Program. 83: 56-79 (2014) - [c13]Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized Model Checking of Rendezvous Systems. CONCUR 2014: 109-124 - [c12]Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin:
Parameterized Model Checking of Token-Passing Systems. VMCAI 2014: 262-281 - [c11]Benjamin Aminof, Sasha Rubin:
First Cycle Games. SR 2014: 83-90 - [i2]Benjamin Aminof, Aniello Murano, Sasha Rubin:
Satisfiability and Model Checking of CTL* with Graded Path Modalities. CoRR abs/1410.7551 (2014) - 2013
- [j4]Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre, Moshe Y. Vardi:
Pushdown module checking with imperfect information. Inf. Comput. 223: 1-17 (2013) - [j3]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Rigorous approximated determinization of weighted automata. Theor. Comput. Sci. 480: 104-117 (2013) - [i1]Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin:
Parameterized Model Checking of Token-Passing Systems. CoRR abs/1311.4425 (2013) - 2012
- [j2]Benjamin Aminof, Orna Kupferman, Aniello Murano:
Improved model checking of hierarchical systems. Inf. Comput. 210: 68-86 (2012) - 2011
- [c10]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Formal Analysis of Online Algorithms. ATVA 2011: 213-227 - [c9]Benjamin Aminof, Fabio Mogavero, Aniello Murano:
Synthesis of Hierarchical Systems. FACS 2011: 42-60 - [c8]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Rigorous Approximated Determinization of Weighted Automata. LICS 2011: 345-354 - 2010
- [j1]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Reasoning about online algorithms with weighted automata. ACM Trans. Algorithms 6(2): 28:1-28:36 (2010) - [c7]Benjamin Aminof, Orna Kupferman, Aniello Murano:
Improved Model Checking of Hierarchical Systems. VMCAI 2010: 61-77
2000 – 2009
- 2009
- [b1]Benjamin Aminof:
Translations among automata on infinite objects and their applications (עם תקציר בעברית ושער נוסף: תרגומים בין סוגים שונים של אוטומטים מעל עצמים אינסופיים ויישומיהם.; תרגומים בין סוגים שונים של אוטומטים מעל עצמים אינסופיים ויישומיהם.). Hebrew University of Jerusalem, Israel, 2009 - [c6]Benjamin Aminof, Orna Kupferman, Robby Lampert:
Reasoning about online algorithms with weighted automata. SODA 2009: 835-844 - 2008
- [c5]Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre:
µ-calculus Pushdown Module Checking with Imperfect State Information. IFIP TCS 2008: 333-348 - [c4]Benjamin Aminof, Orna Kupferman, Omer Lev:
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata. LPAR 2008: 183-197 - 2007
- [c3]Benjamin Aminof, Aniello Murano, Moshe Y. Vardi:
Pushdown Module Checking with Imperfect Information. CONCUR 2007: 460-475 - 2006
- [c2]Benjamin Aminof, Orna Kupferman:
On the Succinctness of Nondeterminism. ATVA 2006: 125-140 - 2004
- [c1]Benjamin Aminof, Thomas Ball, Orna Kupferman:
Reasoning About Systems with Transition Fairness. LPAR 2004: 194-208
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
