Search results for "RP"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Alain Finkel, Serge Haddad, Lina Ye	Introducing Divergence for Infinite Probabilistic Models.	RP	2023	DBLP DOI BibTeX RDF
1	Honglu Sun, Maxime Folschette, Morgan Magnin	Reachability Analysis of a Class of Hybrid Gene Regulatory Networks.	RP	2023	DBLP DOI BibTeX RDF
1	Angelo Ferrando 0001, Giorgio Delzanno	HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification.	RP	2023	DBLP DOI BibTeX RDF
1	Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin	On the Identity and Group Problems for Complex Heisenberg Matrices.	RP	2023	DBLP DOI BibTeX RDF
1	Thomas Brihaye, Aline Goeminne	Multi-weighted Reachability Games.	RP	2023	DBLP DOI BibTeX RDF
1	Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft	Matching Patterns with Variables Under Simon's Congruence.	RP	2023	DBLP DOI BibTeX RDF
1	Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse	Weakly Synchronous Systems with Three Machines Are Turing Powerful.	RP	2023	DBLP DOI BibTeX RDF
1	Adrian Wurm	Complexity of Reachability Problems in Neural Networks.	RP	2023	DBLP DOI BibTeX RDF
1	Olivier Bournez, Enrico Formenti, Igor Potapov (eds.)	Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings	RP	2023	DBLP DOI BibTeX RDF
1	Alberto Casagrande, Carla Piazza	Adaptive Directions for Bernstein-Based Polynomial Set Evolution.	RP	2023	DBLP DOI BibTeX RDF
1	Thomas Brihaye, Véronique Bruyère, Gaspard Reghem	Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete.	RP	2023	DBLP DOI BibTeX RDF
1	David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse	Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs.	RP	2023	DBLP DOI BibTeX RDF
1	Eike Neumann	On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions.	RP	2023	DBLP DOI BibTeX RDF
1	Bruno Martin	Randomness Quality and Trade-Offs for CA Random String Generators.	RP	2023	DBLP DOI BibTeX RDF
1	Stijn Bellis, Joachim Denil, Ramesh Krishnamurthy, Tim Leys, Guillermo A. Pérez 0001, Ritam Raha	A Framework for the Competitive Analysis of Model Predictive Controllers.	RP	2023	DBLP DOI BibTeX RDF
1	Tomoyuki Yamakami	Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata.	RP	2022	DBLP DOI BibTeX RDF
1	Michael Benedikt	The Past and Future of Embedded Finite Model Theory.	RP	2022	DBLP DOI BibTeX RDF
1	Laura Ciobanu	Post's Correspondence Problem: From Computer Science to Algebra.	RP	2022	DBLP DOI BibTeX RDF
1	Lorenzo Capra	Canonization of Reconfigurable PT Nets in Maude.	RP	2022	DBLP DOI BibTeX RDF
1	Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke	History-Deterministic Timed Automata Are Not Determinizable.	RP	2022	DBLP DOI BibTeX RDF
1	Michele Boreale, Luisa Collodi	Linearization, Model Reduction and Reachability in Nonlinear odes.	RP	2022	DBLP DOI BibTeX RDF
1	Thomas Webster	The Stochastic Arrival Problem.	RP	2022	DBLP DOI BibTeX RDF
1	Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi 0001	On Higher-Order Reachability Games Vs May Reachability.	RP	2022	DBLP DOI BibTeX RDF
1	A. R. Balasubramanian	Coefficient Synthesis for Threshold Automata.	RP	2022	DBLP DOI BibTeX RDF
1	Yotam M. Y. Feldman, Sharon Shoham	SAT-Based Invariant Inference and Its Relation to Concept Learning.	RP	2022	DBLP DOI BibTeX RDF
1	Anthony W. Lin, Georg Zetzsche, Igor Potapov (eds.)	Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings	RP	2022	DBLP DOI BibTeX RDF
1	Maria Kosche, Tore Koß, Florin Manea, Viktoriya Pak	Subsequences in Bounded Ranges: Matching and Analysis Problems.	RP	2022	DBLP DOI BibTeX RDF
1	Udi Boker	Quantitative vs. Weighted Automata.	RP	2021	DBLP DOI BibTeX RDF
1	Marcelo Forets, Christian Schilling 0001	Reachability of Weakly Nonlinear Systems Using Carleman Linearization.	RP	2021	DBLP DOI BibTeX RDF
1	Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer	Absent Subsequences in Words.	RP	2021	DBLP DOI BibTeX RDF
1	Oleg Karpenkov	Continued Fraction Approach to Gauss Reduction Theory.	RP	2021	DBLP DOI BibTeX RDF
1	Paul C. Bell, Patrick Totzke, Igor Potapov (eds.)	Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings	RP	2021	DBLP DOI BibTeX RDF
1	Clare Dixon	Theorem Proving Using Clausal Resolution: From Past to Present.	RP	2021	DBLP DOI BibTeX RDF
1	Javier Esparza	Population Protocols: Beyond Runtime Analysis.	RP	2021	DBLP DOI BibTeX RDF
1	Georg Zetzsche	Recent Advances on Reachability Problems for Valence Systems (Invited Talk).	RP	2021	DBLP DOI BibTeX RDF
1	Marco Sälzer, Martin Lange	Reachability is NP-Complete Even for the Simplest Neural Networks.	RP	2021	DBLP DOI BibTeX RDF
1	Alexander Bilgram, Peter Gjøl Jensen, Thomas Pedersen, Jirí Srba, Jakob Haahr Taankvist	Improvements in Unfolding of Colored Petri Nets.	RP	2021	DBLP DOI BibTeX RDF
1	Joseph Livesey, Dominik Wojtczak	Minimal Number of Calls in Propositional Protocols.	RP	2021	DBLP DOI BibTeX RDF
1	Valérie Berthé	On Decision Problems for Substitutions in Symbolic Dynamics.	RP	2020	DBLP DOI BibTeX RDF
1	Ronny Tredup	The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets.	RP	2020	DBLP DOI BibTeX RDF
1	Sergiy Bogomolov, Marcelo Forets, Kostiantyn Potomkin	Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model.	RP	2020	DBLP DOI BibTeX RDF
1	Tristan Stérin	Binary Expression of Ancestors in the Collatz Graph.	RP	2020	DBLP DOI BibTeX RDF
1	Sylvain Schmitz, Igor Potapov (eds.)	Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings	RP	2020	DBLP DOI BibTeX RDF
1	Kousha Etessami, Emanuel Martinov	Qualitative Multi-objective Reachability for Ordered Branching MDPs.	RP	2020	DBLP DOI BibTeX RDF
1	Michael Raskin, Chana Weil-Kennedy	Efficient Restrictions of Immediate Observation Petri Nets.	RP	2020	DBLP DOI BibTeX RDF
1	Dmitry Kravchenko, Kamil Khadiev, Danil Serov, Ruslan Kapralov	Quantum-over-Classical Advantage in Solving Multiplayer Games.	RP	2020	DBLP DOI BibTeX RDF
1	Orna Kupferman	Games with Full, Longitudinal, and Transverse Observability.	RP	2020	DBLP DOI BibTeX RDF
1	Tristan Stérin, Damien Woods	The Collatz Process Embeds a Base Conversion Algorithm.	RP	2020	DBLP DOI BibTeX RDF
1	Shruti Biswal, Andrew S. Miner	Reachability Set Generation Using Hybrid Relation Compatible Saturation.	RP	2020	DBLP DOI BibTeX RDF
1	Ronny Tredup	Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results.	RP	2019	DBLP DOI BibTeX RDF
1	Nazim Fatès, Irène Marcovici, Siamak Taati	Cellular Automata for the Self-stabilisation of Colourings and Tilings.	RP	2019	DBLP DOI BibTeX RDF
1	Emmanuel Filiot, Raphaël M. Jungers, Igor Potapov (eds.)	Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings	RP	2019	DBLP DOI BibTeX RDF
1	Ventsislav Chonev	Reachability in Augmented Interval Markov Chains.	RP	2019	DBLP DOI BibTeX RDF
1	Sylvain Schmitz, Georg Zetzsche	Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets.	RP	2019	DBLP DOI BibTeX RDF
1	Christopher Hampson	On the Termination Problem for Counter Machines with Incrementing Errors.	RP	2019	DBLP DOI BibTeX RDF
1	Andrei Sandler, Olga Tveretina	Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds.	RP	2019	DBLP DOI BibTeX RDF
1	Pierre-Alain Reynier, Frédéric Servais	On the Computation of the Minimal Coverability Set of Petri Nets.	RP	2019	DBLP DOI BibTeX RDF
1	Sriram Sankaranarayanan 0001, Souradeep Dutta, Sergio Mover	Reaching Out Towards Fully Verified Autonomous Systems.	RP	2019	DBLP DOI BibTeX RDF
1	Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný 0001	Bidding Games on Markov Decision Processes.	RP	2019	DBLP DOI BibTeX RDF
1	Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen	On Solving Word Equations Using SAT.	RP	2019	DBLP DOI BibTeX RDF
1	Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer	Reachability of Five Gossip Protocols.	RP	2019	DBLP DOI BibTeX RDF
1	Václav Blazej, Jan Matyás Kristan, Tomás Valla	On the m-eternal Domination Number of Cactus Graphs.	RP	2019	DBLP DOI BibTeX RDF
1	Véronique Bruyère, Guillermo A. Pérez 0001, Jean-François Raskin, Clément Tamines	Partial Solvers for Generalized Parity Games.	RP	2019	DBLP DOI BibTeX RDF
1	Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset	On Relevant Equilibria in Reachability Games.	RP	2019	DBLP DOI BibTeX RDF
1	Chris Köcher	Reachability Problems on Partially Lossy Queue Automata.	RP	2019	DBLP DOI BibTeX RDF
1	Vladimir Yu. Protasov	Primitivity and Synchronizing Automata: A Functional Analytic Approach.	RP	2019	DBLP DOI BibTeX RDF
1	Giorgio Delzanno	Parameterised Verification of Publish/Subscribe Networks with Exception Handling.	RP	2019	DBLP DOI BibTeX RDF
1	Markus Lohrey	Knapsack in Hyperbolic Groups.	RP	2018	DBLP DOI BibTeX RDF
1	Iovka Boneva, Joachim Niehren, Momar Sakho	Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams.	RP	2018	DBLP DOI BibTeX RDF
1	Petr Jancar, Petr Osicka, Zdenek Sawa	EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets.	RP	2018	DBLP DOI BibTeX RDF
1	Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka	The Satisfiability of Word Equations: Decidable and Undecidable Theories.	RP	2018	DBLP DOI BibTeX RDF
1	Julien Alexandre Dit Sandretto, Jian Wan 0002	Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta.	RP	2018	DBLP DOI BibTeX RDF
1	Michal Skrzypczak	Büchi VASS Recognise ∑11-complete ω-languages.	RP	2018	DBLP DOI BibTeX RDF
1	Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem	Left-Eigenvectors Are Certificates of the Orbit Problem.	RP	2018	DBLP DOI BibTeX RDF
1	Jeremy Sproston	Qualitative Reachability for Open Interval Markov Chains.	RP	2018	DBLP DOI BibTeX RDF
1	Turlough Neary, Matthew Cook 0001	Generalized Tag Systems.	RP	2018	DBLP DOI BibTeX RDF
1	Alexei Lisitsa 0001	Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification.	RP	2018	DBLP DOI BibTeX RDF
1	Igor Potapov, Pierre-Alain Reynier (eds.)	Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings	RP	2018	DBLP DOI BibTeX RDF
1	Matthew Hague, Vincent Penelle	Constrained Dynamic Tree Networks.	RP	2018	DBLP DOI BibTeX RDF
1	Milka Hutagalung	Topological Characterisation of Multi-buffer Simulation.	RP	2017	DBLP DOI BibTeX RDF
1	Tomoyuki Yamakami	Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions - (Preliminary Report).	RP	2017	DBLP DOI BibTeX RDF
1	Jeremy Sproston	Probabilistic Timed Automata with Clock-Dependent Probabilities.	RP	2017	DBLP DOI BibTeX RDF
1	Reino Niskanen	Reachability Problem for Polynomial Iteration Is PSPACE-complete.	RP	2017	DBLP DOI BibTeX RDF
1	Antti Valmari	Stubborn Sets with Frozen Actions.	RP	2017	DBLP DOI BibTeX RDF
1	Matthew Hague, Igor Potapov (eds.)	Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings	RP	2017	DBLP DOI BibTeX RDF
1	Laurent Doyen 0001	The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract).	RP	2017	DBLP DOI BibTeX RDF
1	Florian Bruse, Martin Lange, Étienne Lozes	Space-Efficient Fragments of Higher-Order Fixpoint Logic.	RP	2017	DBLP DOI BibTeX RDF
1	Franck Cassez, Peter Gjøl Jensen, Kim Guldstrand Larsen	Refinement of Trace Abstraction for Real-Time Programs.	RP	2017	DBLP DOI BibTeX RDF
1	Davide Ancona, Giorgio Delzanno, Luca Franceschini, Maurizio Leotta, Enrico Prampolini, Marina Ribaudo, Filippo Ricca	An Abstract Machine for Asynchronous Programs with Closures and Priority Queues.	RP	2017	DBLP DOI BibTeX RDF
1	Devendra Bhave, Shibashis Guha	Adding Dense-Timed Stack to Integer Reset Timed Automata.	RP	2017	DBLP DOI BibTeX RDF
1	Adrien Le Coënt, Julien Alexandre Dit Sandretto, Alexandre Chapoutot, Laurent Fribourg, Florian De Vuyst, Ludovic Chamoin	Distributed Control Synthesis Using Euler's Method.	RP	2017	DBLP DOI BibTeX RDF
1	Norbert Hundeshagen, Martin Lange	Model Checking CTL over Restricted Classes of Automatic Structures.	RP	2017	DBLP DOI BibTeX RDF
1	Emmanuel Filiot, Pierre-Alain Reynier	Copyful Streaming String Transducers.	RP	2017	DBLP DOI BibTeX RDF
1	Henri Hansen, Antti Valmari	Safety Property-Driven Stubborn Sets.	RP	2016	DBLP DOI BibTeX RDF
1	Giorgio Delzanno	Reachability Predicates for Graph Assertions.	RP	2016	DBLP DOI BibTeX RDF
1	Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan 0001	On the Complexity of Resource-Bounded Logics.	RP	2016	DBLP DOI BibTeX RDF
1	Axel Legay, Sean Sedwards, Louis-Marie Traonouez	Rare Events for Statistical Model Checking an Overview.	RP	2016	DBLP DOI BibTeX RDF
1	Igor Potapov, Olena Prianychnykova, Sergey Verlan	Insertion-Deletion Systems over Relational Words.	RP	2016	DBLP DOI BibTeX RDF
1	Sam A. M. Jones, Richard M. Thomas	Characterizing Word Problems of Groups.	RP	2016	DBLP DOI BibTeX RDF
1	Alain Finkel	The Ideal Theory for WSTS.	RP	2016	DBLP DOI BibTeX RDF