Search results for "Reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Liam Roditty, Uri Zwick	Improved Dynamic Reachability Algorithms for Directed Graphs.	FOCS	2002	DBLP DOI BibTeX RDF
23	Oscar H. Ibarra, Zhe Dang	On Removing the Pushdown Stack in Reachability Constructions.	ISAAC	2001	DBLP DOI BibTeX RDF
23	Kim Guldstrand Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, Judi Romijn	As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata.	CAV	2001	DBLP DOI BibTeX RDF
23	Zhe Dang	Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks.	CAV	2001	DBLP DOI BibTeX RDF
23	Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Guldstrand Larsen, Paul Pettersson, Judi Romijn, Frits W. Vaandrager	Minimum-Cost Reachability for Priced Timed Automata.	HSCC	2001	DBLP DOI BibTeX RDF	Optimization, Algorithms, Verification, Data Structures, Timed Automata
23	Eugene Asarin, Gerardo Schneider, Sergio Yovine	On the Decidability of the Reachability Problem for Planar Differential Inclusions.	HSCC	2001	DBLP DOI BibTeX RDF
23	Keijo Heljanko	Bounded Reachability Checking with Process Semantics.	CONCUR	2001	DBLP DOI BibTeX RDF
23	Gerardo Lafferriere, Christopher Lee Miller	Uniform Reachability Algorithms.	HSCC	2000	DBLP DOI BibTeX RDF
23	Oscar H. Ibarra	Reachability and Safety in Queue Systems.	CIAA	2000	DBLP DOI BibTeX RDF
23	Alain Finkel, Grégoire Sutre	Decidability of Reachability Problems for Classes of Two Counters Automata.	STACS	2000	DBLP DOI BibTeX RDF
23	Aarti Gupta, Zijiang Yang 0006, Pranav Ashar, Anubhav Gupta 0001	SAT-Based Image Computation with Application in Reachability Analysis.	FMCAD	2000	DBLP DOI BibTeX RDF
23	Patrice Boisieau, Olivier F. Roux	Splitting reachability analysis in hybrid automata.	ECRTS	1999	DBLP DOI BibTeX RDF
23	Andrew S. Miner, Gianfranco Ciardo	Efficient Reachability Set Generation and Storage Using Decision Diagrams.	ICATPN	1999	DBLP DOI BibTeX RDF
23	Jörg Preußig, Olaf Stursberg, Stefan Kowalewski	Reachability Analysis of a Class of Switched Continuous Systems by Integrating Rectangular Approximation and Rectangular Analysis.	HSCC	1999	DBLP DOI BibTeX RDF
23	Mark R. Greenstreet, Ian Mitchell 0001	Reachability Analysis Using Polygonal Projections.	HSCC	1999	DBLP DOI BibTeX RDF
23	Béatrice Bérard, Laurent Fribourg	Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic.	CONCUR	1999	DBLP DOI BibTeX RDF
23	Jerzy Marcinkowski	Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games.	CSL	1999	DBLP DOI BibTeX RDF
23	Stephen J. H. Yang, Sam Lin, Jonathan Lee, William C. Chu	Specifying and Verifying Temporal Behavior of High Assurance Systems Using Reachability Tree Logic.	HASE	1998	DBLP DOI BibTeX RDF	verification, formal methods, Petri nets, specification, temporal logic, High assurance systems
23	Harald Ganzinger, Florent Jacquemard, Margus Veanes	Rigid Reachability.	ASIAN	1998	DBLP DOI BibTeX RDF
23	Kimmo Varpaaniemi, Keijo Heljanko, Johan Lilius	prod 3.2: An Advanced Tool for Efficient Reachability Analysis.	CAV	1997	DBLP DOI BibTeX RDF
23	Jean-Michel Ilié, Khalil Ajami	Model Checking Through Symbolic Reachability Graph.	TAPSOFT	1997	DBLP DOI BibTeX RDF
23	Ahmed Bouajjani, Peter Habermehl	Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract).	ICALP	1997	DBLP DOI BibTeX RDF
23	Keith P. Pomakis, Joanne M. Atlee	Reachability Analysis of Feature Interactions: A Progress Report.	ISSTA	1996	DBLP DOI BibTeX RDF
23	Karsten Schmidt 0004	Parameterized Reachability Trees for Algebraic Petri Nets.	Application and Theory of Petri Nets	1995	DBLP DOI BibTeX RDF	Analysis of higher-level net models
23	Kavita Ravi, Fabio Somenzi	High-density reachability analysis.	ICCAD	1995	DBLP DOI BibTeX RDF
23	Farn Wang	Reachability Analysis at Procedure Level through Timing Coincidence.	CONCUR	1995	DBLP DOI BibTeX RDF
23	Oded Maler, Amir Pnueli	Reachability Analysis of Planar Multi-limear Systems.	CAV	1993	DBLP DOI BibTeX RDF
23	Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli	Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.	PODS	1993	DBLP DOI BibTeX RDF	Datalog
23	Anne-Cécile Caron	Decidability of Reachability and Disjoint Union of Term Rewriting Systems.	CAAP	1992	DBLP DOI BibTeX RDF
23	Fuchun J. Lin, P. M. Chu, Ming T. Liu	Protocol verification using reachability analysis: the state space explosion problem and relief strategies.	Comput. Commun. Rev.	1987	DBLP DOI BibTeX RDF
23	Deborah A. Joseph, W. Harry Plantinga	On the complexity of reachability and motion planning questions (extended abstract).	SCG	1985	DBLP DOI BibTeX RDF
23	Horst Müller	Decidability of Reachability in Persistent Vector Replacement Systems.	MFCS	1980	DBLP DOI BibTeX RDF
23	J. M. Barzdin	The Problem of Reachability and Verification of Programs.	MFCS	1979	DBLP DOI BibTeX RDF
21	Jason J. Choi, Donggun Lee, Boyang Li, Jonathan P. How, Koushil Sreenath, Sylvia L. Herbert, Claire J. Tomlin	A Forward Reachability Perspective on Robust Control Invariance and Discount Factors in Reachability Analysis.	CoRR	2023	DBLP DOI BibTeX RDF
21	Honglu Sun, Maxime Folschette, Morgan Magnin	Reachability Analysis of a Class of Hybrid Gene Regulatory Networks.	RP	2023	DBLP DOI BibTeX RDF
21	Thomas Brihaye, Aline Goeminne	Multi-weighted Reachability Games.	RP	2023	DBLP DOI BibTeX RDF
21	Adrian Wurm	Complexity of Reachability Problems in Neural Networks.	RP	2023	DBLP DOI BibTeX RDF
21	Thomas Brihaye, Véronique Bruyère, Gaspard Reghem	Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete.	RP	2023	DBLP DOI BibTeX RDF
21	Zhaokai Li, Zhanyou Ma, Xia Li, Yingnan Gao	A Method Converting Multi-Properties Objective Reachability Problems to Multi-Objective Sets Reachability Problems over FKS.	Symmetry	2022	DBLP DOI BibTeX RDF
21	Lilla Tóthmérész	Rotor-routing reachability is easy, chip-firing reachability is hard.	Eur. J. Comb.	2022	DBLP DOI BibTeX RDF
21	Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi 0001	On Higher-Order Reachability Games vs May Reachability.	CoRR	2022	DBLP DOI BibTeX RDF
21	Michele Boreale, Luisa Collodi	Linearization, Model Reduction and Reachability in Nonlinear odes.	RP	2022	DBLP DOI BibTeX RDF
21	Wei Liao, Xiaohui Wei, Jizhou Lai	Cost-limited reachability: a new problem in reachability analysis.	CoRR	2021	DBLP BibTeX RDF
21	Elena Vladislavivna Strzheletska, Vassilis J. Tsotras	Reachability and Top-k Reachability Queries with Transfer Decay.	CoRR	2021	DBLP BibTeX RDF
21	Marcelo Forets, Christian Schilling 0001	Reachability of Weakly Nonlinear Systems Using Carleman Linearization.	RP	2021	DBLP DOI BibTeX RDF
21	Georg Zetzsche	Recent Advances on Reachability Problems for Valence Systems (Invited Talk).	RP	2021	DBLP DOI BibTeX RDF
21	Marco Sälzer, Martin Lange	Reachability is NP-Complete Even for the Simplest Neural Networks.	RP	2021	DBLP DOI BibTeX RDF
21	Ana L. Milanova	FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability.	Proc. ACM Program. Lang.	2020	DBLP DOI BibTeX RDF
21	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
21	Kousha Etessami, Emanuel Martinov	Qualitative Multi-objective Reachability for Ordered Branching MDPs.	RP	2020	DBLP DOI BibTeX RDF
21	Shruti Biswal, Andrew S. Miner	Reachability Set Generation Using Hybrid Relation Compatible Saturation.	RP	2020	DBLP DOI BibTeX RDF
21	Ventsislav Chonev	Reachability in Augmented Interval Markov Chains.	RP	2019	DBLP DOI BibTeX RDF
21	Andrei Sandler, Olga Tveretina	Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds.	RP	2019	DBLP DOI BibTeX RDF
21	Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer	Reachability of Five Gossip Protocols.	RP	2019	DBLP DOI BibTeX RDF
21	Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset	On Relevant Equilibria in Reachability Games.	RP	2019	DBLP DOI BibTeX RDF
21	Chris Köcher	Reachability Problems on Partially Lossy Queue Automata.	RP	2019	DBLP DOI BibTeX RDF
21	Dan You, Shouguang Wang, Wenhui Wu	An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees.	IEEE Access	2018	DBLP DOI BibTeX RDF
21	Shouguang Wang, Dan You, Mengchu Zhou	New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets.	Sci. China Inf. Sci.	2018	DBLP DOI BibTeX RDF
21	Julien Alexandre Dit Sandretto, Jian Wan 0002	Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta.	RP	2018	DBLP DOI BibTeX RDF
21	Jeremy Sproston	Qualitative Reachability for Open Interval Markov Chains.	RP	2018	DBLP DOI BibTeX RDF
21	Ziyue Ma, Yin Tong, Zhiwu Li 0001, Alessandro Giua	Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem.	IEEE Trans. Autom. Control.	2017	DBLP DOI BibTeX RDF
21	Reino Niskanen	Reachability Problem for Polynomial Iteration Is PSPACE-complete.	RP	2017	DBLP DOI BibTeX RDF
21	Giorgio Delzanno	Reachability Predicates for Graph Assertions.	RP	2016	DBLP DOI BibTeX RDF
21	Eike Best, Harro Wimmel	Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs.	RP	2016	DBLP DOI BibTeX RDF
21	Fedor Shmarov, Paolo Zuliani	ProbReach: A Tool for Guaranteed Reachability Analysis of Stochastic Hybrid Systems.	SNR@CAV	2015	DBLP DOI BibTeX RDF
21	Sriram Sankaranarayanan 0001	Symbolic-Numeric Reachability Analysis of Hybrid Systems.	SNR@CAV	2015	DBLP DOI BibTeX RDF
21	Petr Jancar	On Reachability-Related Games on Vector Addition Systems with States.	RP	2015	DBLP DOI BibTeX RDF
21	Paul Hunter	Reachability in Succinct One-Counter Games.	RP	2015	DBLP DOI BibTeX RDF
21	Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki	Reducing Bounded Realizability Analysis to Reachability Checking.	RP	2015	DBLP DOI BibTeX RDF
21	Julian Rathke, Pawel Sobocinski 0001, Owen Stephens	Compositional Reachability in Petri Nets.	RP	2014	DBLP DOI BibTeX RDF
21	Arnaud Carayol, Matthew Hague	Regular Strategies in Pushdown Reachability Games.	RP	2014	DBLP DOI BibTeX RDF
21	Gilles Geeraerts, Joël Goossens, Amélie Stainer	Synthesising Succinct Strategies in Safety and Reachability Games.	RP	2014	DBLP DOI BibTeX RDF
21	Hugo Bazille, Olivier Bournez, Walid Gomaa 0001, Amaury Pouly	On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.	RP	2014	DBLP DOI BibTeX RDF
21	Serge Haddad, Benjamin Monmege	Reachability in MDPs: Refining Convergence of Value Iteration.	RP	2014	DBLP DOI BibTeX RDF
21	Paul C. Bell, Shang Chen, Lisa M. Jackson	Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives.	RP	2014	DBLP DOI BibTeX RDF
21	Nils Semmelrock	Complexity Results for Reachability in Cooperating Systems and Approximated Reachability by Abstract Over-Approximations.		2013	RDF
21	Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen	Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games.	RP	2013	DBLP DOI BibTeX RDF
21	Julien Reichert	On the Complexity of Counter Reachability Games.	RP	2013	DBLP DOI BibTeX RDF
21	Paul C. Bell, Shang Chen	Reachability Problems for Hierarchical Piecewise Constant Derivative Systems.	RP	2013	DBLP DOI BibTeX RDF
21	Akash Lal, Shaz Qadeer	Reachability Modulo Theories.	RP	2013	DBLP DOI BibTeX RDF
21	Kais Klai, Naim Aber, Laure Petrucci	Verification of Reachability Properties for Time Petri Nets.	RP	2013	DBLP DOI BibTeX RDF
21	Thomas Schwentick	The Dynamic Complexity of the Reachability Problem on Graphs.	RP	2013	DBLP DOI BibTeX RDF
21	Carlo Bellettini, Matteo Camilli, Lorenzo Capra, Mattia Monga	MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters.	RP	2013	DBLP DOI BibTeX RDF
21	Luca Benvenuti, Davide Bresolin, Pieter Collins, Alberto Ferrari, Luca Geretti, Tiziano Villa	Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis.	RP	2012	DBLP DOI BibTeX RDF
21	Christoph Haase, Joël Ouaknine, James Worrell 0001	On the Relationship between Reachability Problems in Timed and Counter Automata.	RP	2012	DBLP DOI BibTeX RDF
21	Shahab Kaynama, Meeko Oishi, Ian M. Mitchell, Guy Albert Dumont	The continual reachability set and its computation using maximal reachability techniques.	CDC/ECC	2011	DBLP DOI BibTeX RDF
21	Xin Chen 0002, Erika Ábrahám, Goran Frehse	Efficient Bounded Reachability Computation for Rectangular Automata.	RP	2011	DBLP DOI BibTeX RDF
21	Nataliya Skrypnyuk, Flemming Nielson	Reachability for Finite-State Process Algebras Using Static Analysis.	RP	2011	DBLP DOI BibTeX RDF
21	Christian Eggermont, Gerhard J. Woeginger	Reachability and Deadlocking Problems in Multi-stage Scheduling.	RP	2011	DBLP DOI BibTeX RDF
21	Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni	Improving Reachability Analysis of Infinite State Systems by Specialization.	RP	2011	DBLP DOI BibTeX RDF
21	Krishnendu Chatterjee	Graph Games with Reachability Objectives - (Invited Talk).	RP	2011	DBLP DOI BibTeX RDF
21	Jean-François Raskin	Reachability Problems for Hybrid Automata.	RP	2011	DBLP DOI BibTeX RDF
21	Roland Axelsson, Martin Lange	Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics.	RP	2011	DBLP DOI BibTeX RDF
21	Paulin Jacobé de Naurois, Virgile Mogbil	Rewriting Systems for Reachability in Vector Addition Systems with Pairs.	RP	2010	DBLP DOI BibTeX RDF
21	Kim Guldstrand Larsen	Symbolic and Compositional Reachability for Timed Automata.	RP	2010	DBLP DOI BibTeX RDF
21	Fang Wei 0001	Efficient Graph Reachability Query Answering Using Tree Decomposition.	RP	2010	DBLP DOI BibTeX RDF
21	Jakub Chaloupka	Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P.	RP	2010	DBLP DOI BibTeX RDF
21	Mohamed Faouzi Atig, Ahmed Bouajjani	On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems.	RP	2009	DBLP DOI BibTeX RDF
21	Moshe Y. Vardi	Model Checking as A Reachability Problem.	RP	2009	DBLP DOI BibTeX RDF
21	Klaus Reinhardt	Reachability in Petri Nets with Inhibitor Arcs.	RP	2008	DBLP DOI BibTeX RDF