Ashwani Anand

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Verifying Unboundedness via Amalgamation	2024	Ashwani Anand Sylvain Schmitz Lia Schütze Georg Zetzsche
+ PDF Chat	Verifying Unboundedness via Amalgamation	2024	Ashwani Anand Sylvain Schmitz Lia Schütze Georg Zetzsche
+	Computing Adequately Permissive Assumptions for Synthesis	2023	Ashwani Anand Kaushik Mallik Satya Prakash Nayak Anne-Kathrin Schmuck
+ PDF Chat	Computing Adequately Permissive Assumptions for Synthesis	2023	Ashwani Anand Kaushik Mallik Satya Prakash Nayak Anne-Kathrin Schmuck
+	Synthesizing Permissive Winning Strategy Templates for Parity Games	2023	Ashwani Anand Satya Prakash Nayak Anne-Kathrin Schmuck
+	Contract-Based Distributed Synthesis in Two-Objective Parity Games	2023	Ashwani Anand Satya Prakash Nayak Anne-Kathrin Schmuck
+	Priority Downward Closures	2023	Ashwani Anand Georg Zetzsche
+ PDF Chat	New Algorithms for Combinations of Objectives using Separating Automata	2021	Ashwani Anand Nathanaël Fijalkow Aliénor Goubault--Larrecq Jérôme Leroux Pierre Ohlmann

Common Coauthors

Coauthor	Papers Together
Anne-Kathrin Schmuck	4
Satya Prakash Nayak	4
Georg Zetzsche	3
Lia Schütze	2
Sylvain Schmitz	2
Kaushik Mallik	2
Pierre Ohlmann	1
Aliénor Goubault--Larrecq	1
Nathanaël Fijalkow	1
Jérôme Leroux	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Computing Adequately Permissive Assumptions for Synthesis	2023	Ashwani Anand Kaushik Mallik Satya Prakash Nayak Anne-Kathrin Schmuck	3
+	The Reactive Synthesis Competition (SYNTCOMP): 2018-2021	2022	Swen Jacobs Guillermo A. Pérez Remco Abraham Véronique Bruyère Michaël Cadilhac Maximilien Colange Charly Delfosse Tom van Dijk Alexandre Duret-Lutz Peter Faymonville	2
+ PDF Chat	Partial Solvers for Generalized Parity Games	2019	Véronique Bruyère Guillermo A. Pérez Jean-François Raskin Clément Tamines	2
+	Environment Assumptions for Synthesis	2008	Krishnendu Chatterjee Thomas A. Henzinger Barbara Jobstmann	2
+ PDF Chat	Assume-admissible synthesis	2016	Romain Brenguier Jean-François Raskin Ocan Sankur	2
+ PDF Chat	Semilinearity and Context-Freeness of Languages Accepted by Valence Automata	2013	P. Buckheister Georg Zetzsche	1
+ PDF Chat	Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited	2011	Patricia Bouyer Nicolas Markey Jörg Olschewski Michael Ummels	1
+ PDF Chat	Demystifying Reachability in Vector Addition Systems	2015	Jérôme Leroux Sylvain Schmitz	1
+ PDF Chat	Parity and Streett Games with Costs	2014	Nathanaël Fijalkow Martín Zimmermann	1
+ PDF Chat	The complexity of multi-mean-payoff and multi-energy games	2015	Yaron Velner Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger Alexander Rabinovich Jean-François Raskin	1
+	Down the Borel hierarchy: Solving Muller games via safety games	2014	Daniel Neider Roman Rabinovich Martín Zimmermann	1
+	The theory of well-quasi-ordering: A frequently discovered concept	1972	Joseph B. Kruskal	1
+ PDF Chat	Separating Regular Languages by Piecewise Testable and Unambiguous Languages	2013	Thomas Place Lorijn van Rooijen Marc Zeitoun	1
+ PDF Chat	Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games	2015	Mária Svoreňová Jan Křetínský Martin Chmelík Krishnendu Chatterjee Ivana Černá Călin Belta	1
+ PDF Chat	Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity	2015	Georg Bachmeier Michael Luttenberger Maximilian Schlund	1
+ PDF Chat	On the Density of Context-Free and Counter Languages	2015	Joseph Eremondi Óscar H. Ibarra Ian McQuillan	1
+ PDF Chat	Unboundedness and downward closures of higher-order pushdown automata	2016	Matthew Hague Jonathan Kochems C.-H. Luke Ong	1
+ PDF Chat	Synthesizing a Lego Forklift Controller in GR(1): A Case Study	2016	Shahar Maoz Jan Oliver Ringert	1
+	Forward analysis and model checking for trace bounded WSTS	2016	Pierre Chambart Alain Finkel Sylvain Schmitz	1
+ PDF Chat	The Diagonal Problem for Higher-Order Recursion Schemes is Decidable	2016	Lorenzo Clemente Paweł Parys Sylvain Salvati Igor Walukiewicz	1
+	Parity Games with Weights	2018	Sven Schewe Alexander Weinert Martín Zimmermann	1
+	Nonuniform abstractions, refinement and controller synthesis with novel BDD encodings	2018	Oscar Lindvall Bulancea Petter Nilsson Necmiye Özay	1
+	Parity games and universal graphs	2018	Thomas Colcombet Nathanaël Fijalkow	1
+ PDF Chat	Succinct progress measures for solving parity games	2017	Marcin Jurdziński Ranko Lazić	1
+ PDF Chat	An Optimal Value Iteration Algorithm for Parity Games	2018	Nathanaël Fijalkow	1
+ PDF Chat	Counter-strategy guided refinement of GR(1) temporal logic specifications	2013	Rajeev Alur Salar Moarref Ufuk Topcu	1
+	On the Upward/Downward Closures of Petri Nets∗	2017	Mohamed Faouzi Atig Roland Meyer Sebastian Muskalla Prakash Saivasan	1
+ PDF Chat	Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets	2019	Sylvain Schmitz Georg Zetzsche	1
+	The emptiness problem for valence automata over graph monoids	2020	Georg Zetzsche	1
+	An Approach to Regular Separability in Vector Addition Systems	2020	Wojciech Czerwiński Georg Zetzsche	1
+ PDF Chat	Cost Automata, Safe Schemes, and Downward Closures	2023	David Barozzini Lorenzo Clemente Thomas Colcombet Paweł Parys	1
+ PDF Chat	Supervisory Controller Synthesis for Nonterminating Processes Is an Obliging Game	2022	Rupak Majumdar Anne-Kathrin Schmuck	1
+ PDF Chat	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games	2019	Wojciech Czerwiński Laure Daviaud Nathanaël Fijalkow Marcin Jurdziński Ranko Lazić Paweł Parys	1
+ PDF Chat	A pseudo-quasi-polynomial algorithm for mean-payoff parity games	2018	Laure Daviaud Marcin Jurdziński Ranko Lazić	1
+	Combining Genetic Programming and Model Checking to Generate Environment Assumptions	2021	Khouloud Gaaloul Claudio Menghi Shiva Nejati Lionel Briand Yago Isasi Parache	1
+	Algorithms for Büchi Games	2008	Krishnendu Chatterjee Thomas A. Henzinger Nir Piterman	1
+ PDF Chat	Context-Triggered Abstraction-Based Control Design	2023	Satya Prakash Nayak Lucas N. Egidio Matteo Della Rossa Anne-Kathrin Schmuck Raphaël M. Jungers	1
+ PDF Chat	Verifying Unboundedness via Amalgamation	2024	Ashwani Anand Sylvain Schmitz Lia Schütze Georg Zetzsche	1
+	The Complexity of Bidirected Reachability in Valence Systems	2022	Moses Ganardi Rupak Majumdar Georg Zetzsche	1
+ PDF Chat	On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension	2015	Jérôme Leroux Grégoire Sutre Patrick Totzke	1
+ PDF Chat	Half-Positional Determinacy of Infinite Games	2006	Eryk Kopczyński	1
+	A generalization of the procedure of karp and miller to well structured transition systems	1987	Alain Finkel	1
+ PDF Chat	An Approach to Computing Downward Closures	2015	Georg Zetzsche	1