Search results for "reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
13	Till Tantau	A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.	STACS	2004	DBLP DOI BibTeX RDF
13	Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani 0001	Resource-Optimal Scheduling Using Priced Timed Automata.	TACAS	2004	DBLP DOI BibTeX RDF
13	Suman Roy 0001	Symbolic Verification of Infinite Systems using a Finite Union of DFAs.	SEFM	2004	DBLP DOI BibTeX RDF	Symbolic Verification, Accelerations, DFA, Infinite State Systems, FIFO queues
13	Massimo D'Antonio, Giorgio Delzanno	SAT-Based Analysis of Cellular Automata.	ACRI	2004	DBLP DOI BibTeX RDF
13	Micah Adler, Neil Immerman	An n! lower bound on formula size.	ACM Trans. Comput. Log.	2003	DBLP DOI BibTeX RDF	lower bounds, temporal logic, Descriptive complexity
13	Nick Feamster, Hari Balakrishnan	Towards a logic for wide-area Internet routing.	Comput. Commun. Rev.	2003	DBLP DOI BibTeX RDF
13	Giorgio Delzanno	Constraint-Based Verification of Parameterized Cache Coherence Protocols.	Formal Methods Syst. Des.	2003	DBLP DOI BibTeX RDF	constraints, abstractions, symbolic model checking, cache coherence protocols
13	Yu-Chee Tseng, Sze-Yao Ni, En-Yu Shih	Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	mobile computing, communication, wireless network, mobile ad hoc network (MANET), Broadcast, broadcast storm
13	Sridhar Radhakrishnan, Gopal Racherla, Chandra N. Sekharan, Nageswara S. V. Rao, Stephen Gordon Batsell	Protocol for Dynamic Ad-Hoc Networks Using Distributed Spanning Trees.	Wirel. Networks	2003	DBLP DOI BibTeX RDF	simulation, routing, ad-hoc network, distributed algorithm, spanning tree
13	Hubert Comon-Lundh, Vitaly Shmatikov	Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or.	LICS	2003	DBLP DOI BibTeX RDF
13	Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato	Hierarchical and Recursive State Machines with Context-Dependent Properties.	ICALP	2003	DBLP DOI BibTeX RDF	Model Checking, Temporal Logic, Automata
13	Tadeusz Kaczorek	Some Recent Developments in Positive 2D Systems.	POSTA	2003	DBLP DOI BibTeX RDF
13	Rafael Bru, Carmen Coll, Sergio Romero-Vivo, Elena Sánchez	Some Problems about Structural Properties of Positive Descriptor Systems.	POSTA	2003	DBLP DOI BibTeX RDF
13	Ahmed Helmy, Saurabh Garg 0002, Priyatham Pamu, Nitin Nahata	Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets.	IPDPS	2003	DBLP DOI BibTeX RDF	Small Transactions, Short Flows, Contact-based Architecture, Scalability, Mobile Ad Hoc Networks, Routing Protocol, Network Simulation, Resource Discovery, Small World, Self-configuration
13	Kengo Nagahashi, Hiroshi Esaki, Jun Murai	BGP Integrity Check for the Conflict Origin AS Prefix in the Inter-domain Routing.	SAINT	2003	DBLP DOI BibTeX RDF
13	Stephen Chong, Radu Rugina	Static Analysis of Accessed Regions in Recursive Data Structures.	SAS	2003	DBLP DOI BibTeX RDF
13	Klaus Echtle, Irene Eusgeld	A Genetic Algorithm for Fault-Tolerant System Design.	LADC	2003	DBLP DOI BibTeX RDF	analysis of fault-tolerant behaviour, genetic algorithm, Fault tolerance, fault model, fitness function
13	Elena Fersman, Leonid Mokrushin, Paul Pettersson, Wang Yi 0001	Schedulability Analysis Using Two Clocks.	TACAS	2003	DBLP DOI BibTeX RDF
13	Pierluigi San Pietro, Zhe Dang	Automatic Verification of Multi-queue Discrete Timed Automata.	COCOON	2003	DBLP DOI BibTeX RDF	infinite-state model-checking, real-time systems, Timed Automata
13	Matthew Andrews, Michael A. Bender, Lisa Zhang	New Algorithms for Disk Scheduling.	Algorithmica	2002	DBLP DOI BibTeX RDF	Approximation algorithms, Disk scheduling, Asymmetric Traveling Salesman Problem
13	Alexander Kurz 0001	Notions of Behaviour and Reachable-Part and Their Institutions.	WADT	2002	DBLP DOI BibTeX RDF
13	Andrew S. Miner	Efficient State Space Generation of GSPNs using Decision Diagrams.	DSN	2002	DBLP DOI BibTeX RDF
13	Eugene Asarin, Gordon J. Pace, Gerardo Schneider, Sergio Yovine	SPeeDI - A Verification Tool for Polygonal Hybrid Systems.	CAV	2002	DBLP DOI BibTeX RDF
13	Tatiana Rybina, Andrei Voronkov	Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking.	CAV	2002	DBLP DOI BibTeX RDF
13	Per Bjesse	Industrial Model Checking Based on Satisfiability Solvers.	SPIN	2002	DBLP DOI BibTeX RDF
13	Timothy Griffin, Gordon T. Wilfong	On the correctness of IBGP configuration.	SIGCOMM	2002	DBLP DOI BibTeX RDF	BGP congfiguration, internal BGP, BGP, border gateway protocol
13	Glenn Bruns, Satish Chandra 0001	Searching for points-to analysis.	SIGSOFT FSE	2002	DBLP DOI BibTeX RDF
13	Mitsuharu Yamamoto, Jean-Marie Cottin, Masami Hagiya	Decidability of Safety Properties of Timed Multiset Rewriting.	FTRTFT	2002	DBLP DOI BibTeX RDF	real-time systems, timed automata, decidability, timed Petri nets
13	Fabio Balduzzi, Angela Di Febbraro, Alessandro Giua, Carla Seatzu	Decidability results in First-Order Hybrid Petri Nets.	Discret. Event Dyn. Syst.	2001	DBLP DOI BibTeX RDF	hybrid Petri nets, decidability properties, timed automata, hybrid automata
13	Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi 0001, Leen Stougie, Maurizio Talamo	Algorithms for the On-Line Travelling Salesman.	Algorithmica	2001	DBLP DOI BibTeX RDF	Approximation algorithms, Disk scheduling, Asymmetric Traveling Salesman Problem
13	Enric Pastor, Jordi Cortadella, Oriol Roig	Symbolic Analysis of Bounded Petri Nets.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	Binary Decition Diagrams, Petri nets, formal verification, symbolic methods
13	Alon Y. Halevy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli	Static analysis in datalog extensions.	J. ACM	2001	DBLP DOI BibTeX RDF	query satisfiability, Abstract interpretation, datalog, query containment
13	Enrico Vicario	Static Analysis and Dynamic Steering of Time-Dependent Systems.	IEEE Trans. Software Eng.	2001	DBLP DOI BibTeX RDF	Time-dependent systems, timeliness predictability, enumerative static analysis, dynamic task guarantee, quantitative timing estimation, Time Petri Nets, hard real-time systems
13	Serge Haddad, Patrice Moreaux, Matteo Sereno, Manuel Silva Suárez	Structural Characterization and Qualitative Properties of Product Form Stochastic Petri Nets.	ICATPN	2001	DBLP DOI BibTeX RDF
13	Ivar Ekeland, Roger Temam	Hamiltonian Mechanics2.	HSCC	2001	DBLP BibTeX RDF
13	Eugene Asarin, Sorav Bansal, Bernard Espiau, Thao Dang 0001, Oded Maler	On Hybrid Control of Under-Actuated Mechanical Systems.	HSCC	2001	DBLP DOI BibTeX RDF
13	Jun Zhou, Kuo-Chung Tai	Efficient Deadlock Analysis of Clients/Server Systems with Two-Way Communication.	ISSRE	2001	DBLP DOI BibTeX RDF
13	Ahmed Bouajjani, Aurore Collomb-Annichini, Yassine Lakhnech, Mihaela Sighireanu	Analyzing Fair Parametric Extended Automata.	SAS	2001	DBLP DOI BibTeX RDF
13	Rubén Carvajal-Schiaffino, Giorgio Delzanno, Giovanni Chiola	Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets.	TACAS	2001	DBLP DOI BibTeX RDF
13	Yu-Chee Tseng, Sze-Yao Ni, En-Yu Shih	Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network.	ICDCS	2001	DBLP DOI BibTeX RDF
13	Markus Müller-Olm, Helmut Seidl	On optimal slicing of parallel programs.	STOC	2001	DBLP DOI BibTeX RDF	complexity, parallel programs, slicing, undecidability, interprocedural analysis
13	Fabrizio Ferrandi, Franco Fummi, Enrico Macii, Massimo Poncino, Donatella Sciuto	Symbolic optimization of interacting controllers based onredundancy identification and removal.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
13	Lorenz Huelsbergen	A representation for dynamic graphs in reconfigurable hardware and its application to fundamental graph algorithms.	FPGA	2000	DBLP DOI BibTeX RDF
13	Denis Lugiez, Philippe Schnoebelen	Decidable First-Order Transition Logics for PA-Processes.	ICALP	2000	DBLP DOI BibTeX RDF
13	Joseph S. Miller	Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata.	HSCC	2000	DBLP DOI BibTeX RDF
13	Alain Finkel, Grégoire Sutre	An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS.	MFCS	2000	DBLP DOI BibTeX RDF
13	Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer	Conter Machines: Decidable Properties and Applications to Verification Problems.	MFCS	2000	DBLP DOI BibTeX RDF
13	Oscar H. Ibarra, Jianwen Su	Generalizing the Discrete Timed Automaton.	CIAA	2000	DBLP DOI BibTeX RDF
13	Thomas A. Henzinger, Rupak Majumdar	A Classification of Symbolic Transition Systems.	STACS	2000	DBLP DOI BibTeX RDF
13	Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides	Embedding Problems for Paths with Direction Constrained Edges.	COCOON	2000	DBLP DOI BibTeX RDF
13	Laura Recalde, Enrique Teruel, Manuel Silva Suárez	Autonomous Continuous P/T Systems.	ICATPN	1999	DBLP DOI BibTeX RDF
13	Gerardo Lafferriere, George J. Pappas, Sergio Yovine	A New Class of Decidable Hybrid Systems.	HSCC	1999	DBLP DOI BibTeX RDF
13	Kathi Fisler, Moshe Y. Vardi	Bisimulation and Model Checking.	CHARME	1999	DBLP DOI BibTeX RDF
13	Gerd Behrmann, Kim Guldstrand Larsen, Henrik Reif Andersen, Henrik Hulgaard, Jørn Lind-Nielsen	Verification of Hierarchical State/Event Systems Using Reusability and Compositionality.	TACAS	1999	DBLP DOI BibTeX RDF
13	Hubert Comon, Yan Jurski	Timed Automata and the Theory of Real Numbers.	CONCUR	1999	DBLP DOI BibTeX RDF
13	Rajeev Alur, Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang	Automating Modular Verification.	CONCUR	1999	DBLP DOI BibTeX RDF
13	Takashi Nagaya, Yoshihito Toyama	Decidability for Left-Linaer Growing Term Rewriting Systems.	RTA	1999	DBLP DOI BibTeX RDF
13	Christel Baier, Bettina Engelen	Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach.	ARTS	1999	DBLP DOI BibTeX RDF
13	Adrian J. Isles, Ramin Hojati, Robert K. Brayton	Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory.	CAV	1998	DBLP DOI BibTeX RDF
13	Parosh Aziz Abdulla, Bengt Jonsson 0001, Mats Kindahl, Doron A. Peled	A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract).	CAV	1998	DBLP DOI BibTeX RDF
13	Grégoire Sutre, Alain Finkel, Olivier F. Roux, Franck Cassez	Effective Recognizability and Model Checking of Reactive Fiffo Automata.	AMAST	1998	DBLP DOI BibTeX RDF
13	Parosh Aziz Abdulla, Bengt Jonsson 0001	Verifying Networks of Timed Processes (Extended Abstract).	TACAS	1998	DBLP DOI BibTeX RDF
13	Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple, Fabio Somenzi	Approximation and Decomposition of Binary Decision Diagrams.	DAC	1998	DBLP DOI BibTeX RDF	transceiver, spread spectrum communication, RF CMOS, digital radio, ISM frequency band
13	Gérard Cécé, Alain Finkel	Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract).	CAV	1997	DBLP DOI BibTeX RDF
13	Laurent Fribourg, Hans Olsén	Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic.	CONCUR	1997	DBLP DOI BibTeX RDF
13	Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Stefano Quer	Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits.	DAC	1997	DBLP DOI BibTeX RDF
13	Florent Jacquemard	Decidable Approximations of Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
13	Hendrik Decker, Ernest Teniente, Toni Urpí	How to Tackle Schema Validation by View Updating.	EDBT	1996	DBLP DOI BibTeX RDF
13	Thomas A. Henzinger, Pei-Hsin Ho	Algorithmic Analysis of Nonlinear Hybrid Systems.	CAV	1995	DBLP DOI BibTeX RDF
13	Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, Alexandre Yakovlev	Synthesizing Petri nets from state-based models.	ICCAD	1995	DBLP DOI BibTeX RDF	Petri nets, Synthesis, Finite State Machines, Asynchronous Circuits, Transition Systems
13	Gitanjali Swamy, Robert K. Brayton, Vigyan Singhal	Incremental methods for FSM traversal.	ICCD	1995	DBLP DOI BibTeX RDF	FSM traversal, formal verification, formal verification, finite state machines, finite state machine, logic design, directed graphs, logic CAD, incremental algorithms, digital systems, reachable states, incremental methods
13	Mikko Tiusanen	Symbolic, Symmetry, and Stubborn Set Searches.	Application and Theory of Petri Nets	1994	DBLP DOI BibTeX RDF
13	Li-Ling Chen, Williams Ludwell Harrison III	An efficient approach to computing fixpoints for complex program analysis.	International Conference on Supercomputing	1994	DBLP DOI BibTeX RDF	fixpoint computation, program analysis, abstract interpretation, optimizing compilers
13	Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger	Computing Accumulated Delays in Real-time Systems.	CAV	1993	DBLP DOI BibTeX RDF
13	Allan Cheng, Javier Esparza, Jens Palsberg	Complexity Results for 1-safe Nets.	FSTTCS	1993	DBLP DOI BibTeX RDF
13	Enrique Teruel, Piotr Chrzastowski-Wachtel, José Manuel Colom, Manuel Silva Suárez	On Weighted T-Systems.	Application and Theory of Petri Nets	1992	DBLP DOI BibTeX RDF	weighted T-graphs, Structure theory, Marked Graphs
13	Florian Matthes, Atsushi Ohori, Joachim W. Schmidt	Typing Schemes for Objects with Locality.	East/West Database Workshop	1990	DBLP DOI BibTeX RDF
13	Maria C. Yuang, Aaron Kershenbaum	Parallel Protocol Verification: The Two-Phase Algorithm and Complexity Analysis.	Automatic Verification Methods for Finite State Systems	1989	DBLP DOI BibTeX RDF
13	Rodney R. Howell, Louis E. Rosier	Recent results on the complexity of problems related to Petri nets.	European Workshop on Applications and Theory of Petri Nets	1986	DBLP DOI BibTeX RDF
11	Joonwon Choi, Hyunsang Park, Inseok Hwang 0002	Bootstrapped Gaussian Mixture Model-Based Data-Driven Forward Stochastic Reachability Analysis.	IEEE Control. Syst. Lett.	2024	DBLP DOI BibTeX RDF
11	Shankaranarayanan Krishna, Aniket Lal, Andreas Pavlogiannis, Omkar Tuppe	On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability.	Proc. ACM Program. Lang.	2024	DBLP DOI BibTeX RDF
11	Yanis Sellami, Guillaume Girol, Frédéric Recoules, Damien Couroussé, Sébastien Bardin	Inference of Robust Reachability Constraints.	Proc. ACM Program. Lang.	2024	DBLP DOI BibTeX RDF
11	A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche	Reachability in Continuous Pushdown VASS.	Proc. ACM Program. Lang.	2024	DBLP DOI BibTeX RDF
11	Guannan Wei 0001, Oliver Bracevac, Songlin Jia, Yuyan Bao, Tiark Rompf	Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs.	Proc. ACM Program. Lang.	2024	DBLP DOI BibTeX RDF
11	Yi Dong 0002, Xingyu Zhao 0001, Sen Wang 0002, Xiaowei Huang 0001	Reachability Verification Based Reliability Assessment for Deep Reinforcement Learning Controlled Robotics and Autonomous Systems.	IEEE Robotics Autom. Lett.	2024	DBLP DOI BibTeX RDF
11	Mohamed Serry, Jun Liu 0015	Underapproximate Reachability Analysis for a Class of Linear Systems With Inputs.	IEEE Trans. Autom. Control.	2024	DBLP DOI BibTeX RDF
11	Moise Bonilla-Licea, Moisés E. Bonilla	On the Behavioral Reachability of a Confined Molecule Under Laser Action.	IEEE Trans. Autom. Control.	2024	DBLP DOI BibTeX RDF
11	Di Liu 0001, Bart Besselink, Simone Baldi, Wenwu Yu, Harry L. Trentelman	A Reachability Approach to Disturbance and Safety Propagation in Mixed Platoons.	IEEE Trans. Autom. Control.	2024	DBLP DOI BibTeX RDF
11	Rahul Jain 0015, Raghunath Tewari	Space efficient algorithm for solving reachability using tree decomposition and separators.	Theor. Comput. Sci.	2024	DBLP DOI BibTeX RDF
11	Wei Liao, Taotao Liang, Pengwen Xiong, Chen Wang, Aiguo Song, Peter X. Liu	An Improved Level Set Method for Reachability Problems in Differential Games.	IEEE Trans. Syst. Man Cybern. Syst.	2024	DBLP DOI BibTeX RDF
11	Cong Lu, Raluca Georgescu, Johan Verwey	Go-Explore Complex 3-D Game Environments for Automated Reachability Testing.	IEEE Trans. Games	2024	DBLP DOI BibTeX RDF
11	Yixuan Wang 0001, Weichao Zhou, Jiameng Fan, Zhilu Wang, Jiajun Li, Xin Chen 0002, Chao Huang 0015, Wenchao Li 0001, Qi Zhu 0002	POLAR-Express: Efficient and Precise Formal Reachability Analysis of Neural-Network Controlled Systems.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2024	DBLP DOI BibTeX RDF
11	Dongliang Zheng, Jack Ridderhof, Zhiyuan Zhang 0007, Panagiotis Tsiotras, Ali-Akbar Agha-Mohammadi	CS-BRM: A Probabilistic RoadMap for Consistent Belief Space Planning With Reachability Guarantees.	IEEE Trans. Robotics	2024	DBLP DOI BibTeX RDF
11	Jinsun Liu, Yifei Simon Shao, Lucas Lymburner, Hansen Qin, Vishrut Kaushik, Lena Trang, Ruiyang Wang, Vladimir Ivanovic, H. Eric Tseng, Ram Vasudevan	REFINE: Reachability-Based Trajectory Design Using Robust Feedback Linearization and Zonotopes.	IEEE Trans. Robotics	2024	DBLP DOI BibTeX RDF
11	Eren Keskin, Roland Meyer 0001	On the Separability Problem of VASS Reachability Languages.	CoRR	2024	DBLP DOI BibTeX RDF
11	Juho Bae, Ji Hoon Bai, Byung-Yoon Lee, Jun-Yong Lee	Constraint-Aware Mesh Refinement Method by Reachability Set Envelope of Curvature Bounded Paths.	CoRR	2024	DBLP DOI BibTeX RDF
11	Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan	Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability.	CoRR	2024	DBLP DOI BibTeX RDF
11	Will Sharpless, Yat Tin Chow, Sylvia L. Herbert	Conservative Linear Envelopes for High-Dimensional, Hamilton-Jacobi Reachability for Nonlinear Systems via the Hopf Formula.	CoRR	2024	DBLP DOI BibTeX RDF
11	Qirun Zhang	A Note on Dynamic Bidirected Dyck-Reachability with Cycles.	CoRR	2024	DBLP DOI BibTeX RDF
11	Lian Chen, Junfeng Zhou, Ming Du, Sheng Yu, Xian Tang, Ziyang Chen	Efficient k-step Weighted Reachability Query Processing Algorithms.	CoRR	2024	DBLP DOI BibTeX RDF