Search results for "reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
36	Michel Bidoit, Rolf Hennicker, Alexander Kurz 0001	On the Duality between Observability and Reachability.	FoSSaCS	2001	DBLP DOI BibTeX RDF
36	Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston	Symbolic Computation of Maximal Probabilistic Reachability.	CONCUR	2001	DBLP DOI BibTeX RDF
36	Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic	Latency effects on reachability in large-scale peer-to-peer networks.	SPAA	2001	DBLP DOI BibTeX RDF
36	Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin	Reachability and Connectivity Queries in Constraint Databases.	PODS	2000	DBLP DOI BibTeX RDF
36	Luca Aceto, Augusto Burgueño, Kim Guldstrand Larsen	Model Checking via Reachability Testing for Timed Automata.	TACAS	1998	DBLP DOI BibTeX RDF
36	Mauro Pezzè, Richard N. Taylor, Michal Young	Graph Models for Reachability of Concurrent Programs.	ACM Trans. Softw. Eng. Methodol.	1995	DBLP DOI BibTeX RDF	static analysis, process algebra, Ada tasking
36	Rodney R. Howell	On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States.	STACS	1987	DBLP DOI BibTeX RDF
33	Anders Wall, Kristian Sandström, Jukka Mäki-Turja, Christer Norström, Wang Yi 0001	Verifying temporal constraints on data in multi-rate transactions using timed automata.	RTCSA	2000	DBLP DOI BibTeX RDF	temporal constraint verification, multi-rate transactions, nonpreemptive execution order, scheduling, real-time systems, real-time systems, program verification, transaction processing, computational models, timed automata, data dependencies, schedulability analysis, reachability analysis, reachability analysis, automata theory, end-to-end latency
33	Christos T. Karamanolis, Dimitra Giannakopoulou, Jeff Magee, Stuart M. Wheater	Model Checking of Workflow Schemas.	EDOC	2000	DBLP DOI BibTeX RDF	workflow schemas, error-prone process, primitive syntactic verification, automata-based method, compositional reachability analysis, model checking, formal methods, formal verification, robustness, correctness, reachability analysis, liveness properties
33	Kim Guldstrand Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi 0001	Efficient verification of real-time systems: compact data structure and state-space reduction.	RTSS	1997	DBLP DOI BibTeX RDF	real-time systems verification, clock values, clock constraints, real-valued variables, static analysis, timed automata, termination, reachability analysis, reachability analysis, state-space reduction, compact data structure
33	Alvin S. Lim	Automatic analytical tools for reliability and dynamic adaptation of complex distributed systems.	ICECCS	1995	DBLP DOI BibTeX RDF	automatic analytical tools, complex distributed systems, runtime facilities, complex application behavior, reliability, formal specification, distributed processing, software tools, software reliability, software fault tolerance, reachability analysis, liveness, reachability, dynamic adaptation, failure recovery, development environment, behavior specification, group behavior
33	Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mackenzie	An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks.	EPEW	2007	DBLP DOI BibTeX RDF	Broadcast storm problem, Saved-rebroadcast, MANETs, Latency, Flooding, Reachability
33	Geguang Pu, Dang Van Hung, Jifeng He 0001, Wang Yi 0001	An Optimal Approach to Hardware/Software Partitioning for Synchronous Model.	IFM	2004	DBLP DOI BibTeX RDF	timed automata, scheduling algorithm, reachability, Hardware/software partitioning
33	Sébastien Bardin, Alain Finkel, Jérôme Leroux	FASTer Acceleration of Counter Automata in Practice.	TACAS	2004	DBLP DOI BibTeX RDF	counter automata, convex translation, TTP protocol, acceleration, reachability set
33	Christophe Lohr, Jean-Pierre Courtiat	From the Specification to the Scheduling of Time-Dependent Systems.	FTRTFT	2002	DBLP DOI BibTeX RDF	Minimal Reachability Graph, Time Labeled Scheduling Automata, Process Algebra, Timed Automata, Temporal Consistency, RT-Lotos
33	Marko Mäkelä	Optimising Enabling Tests and Unfoldings of Algebraic System Nets.	ICATPN	2001	DBLP DOI BibTeX RDF	reachability analysis, unification, high-level Petri nets, unfolding
33	Christoph Schneider, Joachim Wehler	Petri Net Theory - Problems Solved by Commutative Algebra.	ICATPN	1999	DBLP DOI BibTeX RDF	Artin net, commutative net, Gröbner theory, Coloured Petri net, flow, reachability
32	Fernando Rosa-Velardo, David de Frutos-Escrig	Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication.	Petri Nets	2009	DBLP DOI BibTeX RDF
32	Taolue Chen, Tingting Han 0001, Joost-Pieter Katoen, Alexandru Mereacre	LTL Model Checking of Time-Inhomogeneous Markov Chains.	ATVA	2009	DBLP DOI BibTeX RDF
32	Marta Z. Kwiatkowska, Gethin Norman, David Parker 0001	Stochastic Games for Verification of Probabilistic Timed Automata.	FORMATS	2009	DBLP DOI BibTeX RDF
32	Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr	Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.	LICS	2005	DBLP DOI BibTeX RDF
32	Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili	Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems.	CONCUR	2005	DBLP DOI BibTeX RDF
32	Jie-Hong Roland Jiang, Robert K. Brayton	Functional Dependency for Verification Reduction.	CAV	2004	DBLP DOI BibTeX RDF
32	Tatiana Rybina, Andrei Voronkov	Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture).	CSL	2003	DBLP DOI BibTeX RDF
32	Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi 0001	On Higher-Order Reachability Games Vs May Reachability.	RP	2022	DBLP DOI BibTeX RDF
30	Sa'ed Abed, Otmane Aït Mohamed, Ghiath Al Sammane	An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	correctness, reachability analysis, multiway decision graphs, HOL theorem prover
30	Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen	Decision-diagram-based techniques for bounded reachability checking of asynchronous systems.	Int. J. Softw. Tools Technol. Transf.	2009	DBLP DOI BibTeX RDF	Edge-valued decision diagrams, Petri net, Formal verification, BDDs, Reachability analysis, Bounded model checking, Asynchronous design, ADDs
30	Giorgio Delzanno, Roberto Montagna	Reachability analysis of fragments of mobile ambients in AC term rewriting.	Formal Aspects Comput.	2008	DBLP DOI BibTeX RDF	Petri nets, Term rewriting, Reachability, Mobile ambients
30	Sa'ed Abed, Otmane Aït Mohamed, Ghiath Al Sammane	Reachability analysis using multiway decision graphs in the HOL theorem prover.	SAC	2008	DBLP DOI BibTeX RDF	reachability analysis, HOL, multiway decision graphs
30	Emmanuel Hainry	Reachability in Linear Dynamical Systems.	CiE	2008	DBLP DOI BibTeX RDF	Skolem-Pisot problem, Gelfond-Schneider Theorem, Dynamical Systems, Reachability
30	Xutao Du, Chunxiao Xing, Lizhu Zhou	Path-Sensitive Reachability Analysis of Web Service Interfaces (Short Paper).	QSIC	2008	DBLP DOI BibTeX RDF	web service interface, verification, web service composition, reachability analysis
30	Bernard Berthomieu, Didier Lime, Olivier H. Roux, François Vernadat 0001	Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches.	Discret. Event Dyn. Syst.	2007	DBLP DOI BibTeX RDF	State classes, Real-time systems modeling and verification, Approximation, Decidability, Time Petri nets, Reachability, Stopwatches
30	José Meseguer 0001, Prasanna Thati	Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Rewrite theories, Security protocols, Reachability, Narrowing
30	Orna Grumberg, Tamir Heyman, Assaf Schuster	A work-efficient distributed algorithm for reachability analysis.	Formal Methods Syst. Des.	2006	DBLP DOI BibTeX RDF	Distributed reachability, Distributed BDDs, Symbolic model checking
30	Rajeev Alur, Thao Dang 0001, Franjo Ivancic	Predicate abstraction for reachability analysis of hybrid systems.	ACM Trans. Embed. Comput. Syst.	2006	DBLP DOI BibTeX RDF	hybrid systems, Reachability analysis, predicate abstraction
30	Abdelaziz Guerrouat, Harald Richter 0001	A Combined Approach for Reachability Analysis.	ICSEA	2006	DBLP DOI BibTeX RDF	testing and validation, formal specifications, Formal methods, reachability analysis
30	Sujatha Kashyap, Vijay K. Garg	Exploiting predicate structure for efficient reachability detection.	ASE	2005	DBLP DOI BibTeX RDF	model checking, reachability, Mazurkiewicz traces
30	Mikkel Thorup	Compact oracles for reachability and approximate distances in planar digraphs.	J. ACM	2004	DBLP DOI BibTeX RDF	reachability and shortest paths oracles, Planar graphs
30	Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong	Reachability Analysis over Term Rewriting Systems.	J. Autom. Reason.	2004	DBLP DOI BibTeX RDF	completion algorithm, Timbuk, tree automaton, term rewriting, reachability analysis
30	Xu Wang 0001, A. W. Roscoe 0001, Ranko Lazic 0001	Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption.	IFM	2004	DBLP DOI BibTeX RDF	Trace refinement, Model checking, CSP, Array, Reachability, Data independence
30	Liam Roditty, Uri Zwick	A fully dynamic reachability algorithm for directed graphs with an almost linear update time.	STOC	2004	DBLP DOI BibTeX RDF	directed graphs, reachability, transitive closure, dynamic graphs algorithms
30	Ali Mohades, Mohammadreza Razzazi	Reachability on a Region Bounded by Two Attached Squares.	International Conference on Computational Science (1)	2001	DBLP DOI BibTeX RDF	Multi-link arm, concave region, motion planning, reachability, robot arms
30	Shing-Chi Cheung, Jeff Kramer	Checking Safety Properties Using Compositional Reachability Analysis.	ACM Trans. Softw. Eng. Methodol.	1999	DBLP DOI BibTeX RDF	compositional reachability analysis, distributed systems, model checking, static analysis, safety properties
30	Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger	Termination criteria for solving concurrent safety and reachability games.	SODA	2009	DBLP DOI BibTeX RDF
30	Tayssir Touili	Constrained Reachability of Process Rewrite Systems.	ICTAC	2009	DBLP DOI BibTeX RDF
30	Ming Xu 0010, Liangyu Chen 0001, Zhi-bin Li 0005	Symbolic Reachability Computation of a Class of Nonlinear Systems.	ACIS-ICIS	2009	DBLP DOI BibTeX RDF
30	Martin Hofmann 0001, Ulrich Schöpp	Pointer Programs and Undirected Reachability.	LICS	2009	DBLP DOI BibTeX RDF
30	Guoqing Xu 0001, Atanas Rountev, Manu Sridharan	Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis.	ECOOP	2009	DBLP DOI BibTeX RDF
30	Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell 0001	Reachability in Succinct and Parametric One-Counter Automata.	CONCUR	2009	DBLP DOI BibTeX RDF
30	Min Wan, Gianfranco Ciardo	Symbolic Reachability Analysis of Integer Timed Petri Nets.	SOFSEM	2009	DBLP DOI BibTeX RDF
30	Ran Duan, Seth Pettie	Bounded-leg distance and reachability oracles.	SODA	2008	DBLP BibTeX RDF
30	Yangjun Chen, Yibin Chen	An Efficient Algorithm for Answering Graph Reachability Queries.	ICDE	2008	DBLP DOI BibTeX RDF
30	Leevar Williams, Richard Lippmann, Kyle Ingols	GARNET: A Graphical Attack Graph and Reachability Network Evaluation Tool.	VizSEC	2008	DBLP DOI BibTeX RDF	attack path, visualization, network, recommendation, vulnerability, treemap, security metrics, attack graph, exploit, adversary model
30	Maria Elena Valcher, Paolo Santesso	On the reachability of single-input positive switched systems.	CDC	2008	DBLP DOI BibTeX RDF
30	Barbara F. Csima, Bakhadyr Khoussainov	When Is Reachability Intrinsically Decidable?.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
30	Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili	On the Reachability Analysis of Acyclic Networks of Pushdown Systems.	CONCUR	2008	DBLP DOI BibTeX RDF
30	Lei Bu, You Li, Linzhang Wang, Xuandong Li	BACH : Bounded ReAchability CHecker for Linear Hybrid Automata.	FMCAD	2008	DBLP DOI BibTeX RDF
30	Sudip K. Mazumder, Kaustuva Acharya, Muhammad Tahir 0002	Network reconfiguration of distributed controlled homogenous power inverter network using composite Lyapunov function based reachability bound.	SCSC	2007	DBLP BibTeX RDF	piecewise linear systems, reaching conditions, switching power converters, linear matrix inequality, Markov-chain model, Lyapunov stability
30	Spring Berman, Ádám M. Halász, Vijay Kumar 0001	MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems.	HSCC	2007	DBLP DOI BibTeX RDF
30	Ian M. Mitchell	Comparing Forward and Backward Reachability as Tools for Safety Analysis.	HSCC	2007	DBLP DOI BibTeX RDF
30	Alessandro Abate, Saurabh Amin, Maria Prandini, John Lygeros, Shankar Sastry 0001	Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems.	HSCC	2007	DBLP DOI BibTeX RDF
30	Mikolaj Bojanczyk, Piotr Hoffman	Reachability in Unions of Commutative Rewriting Systems Is Decidable.	STACS	2007	DBLP DOI BibTeX RDF	Topic classification Logic in computer science, rewriting
30	Woosin Lee, Hyukjoon Lee, Hyungkeun Lee, Keecheon Kim	Packet Forwarding Based on Reachability Information for VANETs.	ICOIN	2007	DBLP DOI BibTeX RDF
30	Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger	Strategy Improvement for Concurrent Reachability Games.	QEST	2006	DBLP DOI BibTeX RDF
30	Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera 0001	Reachability in Recursive Markov Decision Processes.	CONCUR	2006	DBLP DOI BibTeX RDF
30	Stephen Prajna, Anders Rantzer	Primal-Dual Tests for Safety and Reachability.	HSCC	2005	DBLP DOI BibTeX RDF
30	Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer, David L. Dill, E. Allen Emerson	Predictive Reachability Using a Sample-Based Approach.	CHARME	2005	DBLP DOI BibTeX RDF
30	Luis Quesada 0001, Peter Van Roy, Yves Deville	Speeding Up Constrained Path Solvers with a Reachability Propagator.	CP	2005	DBLP DOI BibTeX RDF
30	Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek	Reachability Analysis of Multithreaded Software with Asynchronous Communication.	FSTTCS	2005	DBLP DOI BibTeX RDF
30	Raffaella Gentilini	Reachability Problems on Extended O-Minimal Hybrid Automata.	FORMATS	2005	DBLP DOI BibTeX RDF
30	Peep Küngas	Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies.	SARA	2005	DBLP DOI BibTeX RDF
30	Lawrence E. Holloway, A. S. Khare, Yu Gong	Computing bounds for forbidden State reachability functions for controlled Petri nets.	IEEE Trans. Syst. Man Cybern. Part A	2004	DBLP DOI BibTeX RDF
30	Amit Bhatia 0001, Emilio Frazzoli	Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems.	HSCC	2004	DBLP DOI BibTeX RDF
30	Yu Lei 0001, Richard H. Carver	Reachability Testing of Semaphore-Based Programs.	COMPSAC	2004	DBLP DOI BibTeX RDF
30	Igor Potapov	From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
30	Shuang Quan Li, Huo Yan Chen, Yu Xia Sun	A framework of reachability testing for Java multithread programs.	SMC (3)	2004	DBLP DOI BibTeX RDF
30	Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, Aletta Nylén	Forward Reachability Analysis of Timed Petri Nets.	FORMATS/FTRTFT	2004	DBLP DOI BibTeX RDF
30	Amit Goel, Randal E. Bryant	Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis.	DATE	2003	DBLP DOI BibTeX RDF
30	Eugene Asarin, Thao Dang 0001, Antoine Girard	Reachability Analysis of Nonlinear Systems Using Conservative Approximation .	HSCC	2003	DBLP DOI BibTeX RDF
30	Ettore Fornasini, Maria Elena Valcher	On the Positive Reachability of 2D Positive Systems.	POSTA	2003	DBLP DOI BibTeX RDF
30	Guangming Xie, Long Wang 0001	Reachability and Controllability of Positive Linear Discrete-time Systems with Time-delays.	POSTA	2003	DBLP DOI BibTeX RDF
30	Arfst Nickelsen, Till Tantau	On Reachability in Graphs with Bounded Independence Number.	COCOON	2002	DBLP DOI BibTeX RDF
30	Yu Lei 0001, Kuo-Chung Tai	Efficient Reachability Testing of Asynchronous Message-Passing Programs.	ICECCS	2002	DBLP DOI BibTeX RDF
30	Kamil Saraç, Kevin C. Almeroth	Providing Scalable Many-to-One Feedback in Multicast Reachability Monitoring Systems.	MMNS	2001	DBLP DOI BibTeX RDF
30	Dirk Beyer 0001	Improvements in BDD-Based Reachability Analysis of Timed Automata.	FME	2001	DBLP DOI BibTeX RDF	Real-time systems, Formal verification, Timed automata, BDDs, Discretization
30	Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech	Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.	CAV	1999	DBLP DOI BibTeX RDF
30	Antony L. Hosking, Jiawan Chen	Mostly-copying Reachability-based Orthogonal Persistence.	OOPSLA	1999	DBLP DOI BibTeX RDF	C++, Modula-3
30	Yiorgos Makris, Alex Orailoglu	Channel-Based Behavioral Test Synthesis for Improved Module Reachability.	DATE	1999	DBLP DOI BibTeX RDF
30	Sairam Subramanian	A Fully Dynamic Data Structure for Reachability in Planar Digraphs.	ESA	1993	DBLP DOI BibTeX RDF
30	Shing-Chi Cheung, Jeff Kramer	Enhancing Compositional Reachability Analysis with Context Constraints.	SIGSOFT FSE	1993	DBLP DOI BibTeX RDF
30	Ryszard Janicki, Maciej Koutny	Using Optimal Simulations to Reduce Reachability Graphs.	CAV	1990	DBLP DOI BibTeX RDF
30	Rodney R. Howell, Louis E. Rosier	Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems.	ICALP	1987	DBLP DOI BibTeX RDF
28	Oded Maler	Reachability for Continuous and Hybrid Systems.	RP	2009	DBLP DOI BibTeX RDF
28	V. S. Anil Kumar 0001, Matthew Macauley, Henning S. Mortveit	Limit Set Reachability in Asynchronous Graph Dynamical Systems.	RP	2009	DBLP DOI BibTeX RDF
27	Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata	Compositional Verification of Concurrent Systems Using Petri-Net-Based Condensation Rules.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	deadlock states, reachable markings, Petri nets, reachability analysis, compositional verification, boundedness, reachability graphs
26	Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci	FAST: acceleration from theory to practice.	Int. J. Softw. Tools Technol. Transf.	2008	DBLP DOI BibTeX RDF	Counter systems, Infinite reachability set, Acceleration, Symbolic representation
26	Ramadhana Bramandia, Byron Choi, Wee Keong Ng	On incremental maintenance of 2-hop labeling of graphs.	WWW	2008	DBLP DOI BibTeX RDF	2-hop, incremental maintenance, graph indexing, reachability test
26	Haibin Zhang, Zhenhua Duan	Symbolic Algorithm Analysis of Rectangular Hybrid Systems.	TAMC	2008	DBLP DOI BibTeX RDF	model checking, temporal logic, hybrid systems, reachability analysis
26	Silke Trißl, Ulf Leser	Fast and practical indexing and querying of very large graphs.	SIGMOD Conference	2007	DBLP DOI BibTeX RDF	databases, graph indexing, reachability queries
26	John Kodumal, Alex Aiken	Regularly annotated set constraints.	PLDI	2007	DBLP DOI BibTeX RDF	annotated inclusion constraints, pushdown model checking, flow analysis, set constraints, context-free language reachability