Search results for "reachability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Oskar Mencer, Zhining Huang, Lorenz Huelsbergen	HAGAR: Efficient Multi-context Graph Processors.	FPL	2002	DBLP DOI BibTeX RDF
19	Eugene Asarin, Gerardo Schneider	Widening the Boundary between Decidable and Undecidable Hybrid Systems.	CONCUR	2002	DBLP DOI BibTeX RDF
19	Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns	Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.	MFCS	2001	DBLP DOI BibTeX RDF
19	Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk	Space Efficient Algorithms for Series-Parallel Graphs.	STACS	2001	DBLP DOI BibTeX RDF
19	John N. Zigman, Stephen M. Blackburn, J. Eliot B. Moss	TMOS: A Transactional Garbage Collector.	POS	2000	DBLP DOI BibTeX RDF
19	Ian Mitchell 0001, Claire J. Tomlin	Level Set Methods for Computation in Hybrid Systems.	HSCC	2000	DBLP DOI BibTeX RDF
19	Franck Cassez, Kim Guldstrand Larsen	The Impressive Power of Stopwatches.	CONCUR	2000	DBLP DOI BibTeX RDF
19	Jun Zhou, Kuo-Chung Tai	Deadlock Analysis of Synchronous Message-Passing Programs.	PDSE	1999	DBLP DOI BibTeX RDF	LTS, Deadlock, CCS, Observational Equivalence
19	Laurence Tianruo Yang, Zebo Peng	An Improved Register-Transfer Level Functional Partitioning Approach for Testability.	EUROMICRO	1998	DBLP DOI BibTeX RDF
19	Jeffrey J. P. Tsai, Steve Jennhwa Yang, Yao-Hsiung Chang	Timing Constraint Petri Nets and Their Application to Schedulability Analysis of Real-Time System Specifications.	IEEE Trans. Software Eng.	1995	DBLP DOI BibTeX RDF	real-time systems, Petri nets, synthesis, timing analysis, Timing constraints, time Petri nets, timed Petri nets, specification and verification
19	Hyunwoo Cho, Gary D. Hachtel, Fabio Somenzi	Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1993	DBLP DOI BibTeX RDF
19	Alain Finkel	The Minimal Coverability Graph for Petri Nets.	Applications and Theory of Petri Nets	1991	DBLP DOI BibTeX RDF	Karp-Miller graph, minimal coverability graph, effective computation of the minimal coverability graph, verification of protocols, Petri nets, decidability
17	Yoshiaki Kuwata, Lars Blackmore, Michael T. Wolf, Nanaz Fathpour, Claire Newman, Alberto Elfes	Decomposition algorithm for global reachability analysis on a time-varying graph with an application to planetary exploration.	IROS	2009	DBLP DOI BibTeX RDF
17	Tony Tan	Graph Reachability and Pebble Automata over Infinite Alphabets.	LICS	2009	DBLP DOI BibTeX RDF
17	Jasper Berendsen, Taolue Chen, David N. Jansen	Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata.	TAMC	2009	DBLP DOI BibTeX RDF
17	Patricia Bouyer, Vojtech Forejt	Reachability in Stochastic Timed Games.	ICALP (2)	2009	DBLP DOI BibTeX RDF
17	Ernst Moritz Hahn, Holger Hermanns, Lijun Zhang 0001	Probabilistic Reachability for Parametric Markov Models.	SPIN	2009	DBLP DOI BibTeX RDF
17	Parosh Aziz Abdulla, Richard Mayr	Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.	FoSSaCS	2009	DBLP DOI BibTeX RDF
17	Eithon Cadag, Peter Tarczy-Hornoch, Peter J. Myler	On the Reachability of Trustworthy Information from Integrated Exploratory Biological Queries.	DILS	2009	DBLP DOI BibTeX RDF
17	Scott D. Stoller, Ping Yang 0002, Mikhail I. Gofman, C. R. Ramakrishnan 0001	Symbolic reachability analysis for parameterized administrative role based access control.	SACMAT	2009	DBLP DOI BibTeX RDF	parameterized administrative role based access control, security policy analysis
17	Wolfgang Thomas	The Reachability Problem over Infinite Graphs.	CSR	2009	DBLP DOI BibTeX RDF
17	Klaus Reinhardt	The Simple Reachability Problem in Switch Graphs.	SOFSEM	2009	DBLP DOI BibTeX RDF
17	Hywel R. Dunn-Davies, Jim Cunningham	Verifying realizability and reachability in recursive interaction protocol specifications.	AAMAS (2)	2009	DBLP BibTeX RDF	propositional statecharts, verification, interaction protocols
17	Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine	Automatic Verification of Directory-Based Consistency Protocols.	RP	2009	DBLP DOI BibTeX RDF
17	Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko	How to Tackle Integer Weighted Automata Positivity.	RP	2009	DBLP DOI BibTeX RDF
17	Mohamed Faouzi Atig, Peter Habermehl	On Yen's Path Logic for Petri Nets.	RP	2009	DBLP DOI BibTeX RDF
17	Bastien Maubert, Sophie Pinchinat	Games with Opacity Condition.	RP	2009	DBLP DOI BibTeX RDF
17	Robert Endre Tarjan	Reachability Problems on Directed Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF
17	Ulrich Schöpp	A Formalised Lower Bound on Undirected Graph Reachability.	LPAR	2008	DBLP DOI BibTeX RDF
17	Margus Veanes, Ando Saabas	On Bounded Reachability of Programs with Set Comprehensions.	LPAR	2008	DBLP DOI BibTeX RDF
17	Roland Groz, Keqin Li 0002, Alexandre Petrenko, Muzammil Shahbaz	Modular System Verification by Inference, Testing and Reachability Analysis.	TestCom/FATES	2008	DBLP DOI BibTeX RDF
17	Stefan Blom, Jaco van de Pol	Symbolic Reachability for Process Algebras with Recursive Data Types.	ICTAC	2008	DBLP DOI BibTeX RDF
17	Nacim Ramdani, Nacim Meslem, Yves Candau	Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization.	HSCC	2008	DBLP DOI BibTeX RDF
17	Maria Prandini, Jianghai Hu	Application of reachability analysis for stochastic hybrid systems to aircraft conflict prediction.	CDC	2008	DBLP DOI BibTeX RDF
17	Weehong Tan, Ufuk Topcu, Peter J. Seiler, Gary J. Balas, Andrew K. Packard	Simulation-aided reachability and local gain analysis for nonlinear dynamical systems.	CDC	2008	DBLP DOI BibTeX RDF
17	Xutao Du, Chunxiao Xing, Lizhu Zhou	Abstract Reachability Graph for Verifying Web Service Interfaces.	ICSR	2008	DBLP DOI BibTeX RDF
17	Margus Veanes, Nikolaj S. Bjørner, Alexander Raschke	An SMT Approach to Bounded Reachability Analysis of Model Programs.	FORTE	2008	DBLP DOI BibTeX RDF
17	Ayman Abdel-Hamid, Lobna Eslim, Yasser Y. Hanafy	Enhanced mobile node's reachability through anycasting for MIPv6 regional registrations.	AICCSA	2008	DBLP DOI BibTeX RDF
17	Julien Cristau, Florian Horn 0001	On Reachability Games of Ordinal Length.	SOFSEM	2008	DBLP DOI BibTeX RDF
17	Hanifa Boucheneb, Kamel Barkaoui	Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs.	FORMATS	2008	DBLP DOI BibTeX RDF
17	Tong-xiao Zhang, Mamoru Minami, Wei Song	Multi-preview configuration control for redundant manipulator by future reachability evaluation.	IROS	2007	DBLP DOI BibTeX RDF
17	Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin	Minimum-Time Reachability in Timed Games.	ICALP	2007	DBLP DOI BibTeX RDF
17	Anil Aswani, Claire J. Tomlin	Reachability Algorithm for Biological Piecewise-Affine Hybrid Systems.	HSCC	2007	DBLP DOI BibTeX RDF
17	Goran Frehse, Oded Maler	Reachability Analysis of a Switched Buffer Network.	HSCC	2007	DBLP DOI BibTeX RDF
17	Jesús Medina 0001, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño	On Reachability of Minimal Models of Multilattice-Based Logic Programs.	MICAI	2007	DBLP DOI BibTeX RDF
17	Paul Bell, Igor Potapov	Reachability Problems in Quaternion Matrix and Rotation Semigroups.	MFCS	2007	DBLP DOI BibTeX RDF
17	Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen	Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams.	TACAS	2007	DBLP DOI BibTeX RDF
17	Eric Allender	Reachability Problems: An Update.	CiE	2007	DBLP DOI BibTeX RDF
17	William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Yang 0006, Marek A. Perkowski	Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
17	Giorgio Delzanno, Roberto Montagna	Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting.	ICTAC	2006	DBLP DOI BibTeX RDF
17	Jasper Berendsen, David N. Jansen, Joost-Pieter Katoen	Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata.	QEST	2006	DBLP DOI BibTeX RDF
17	Thao Dang 0001	Approximate Reachability Computation for Polynomial Systems.	HSCC	2006	DBLP DOI BibTeX RDF
17	Saurabh Amin, Alessandro Abate, Maria Prandini, John Lygeros, Shankar Sastry 0001	Reachability Analysis for Controlled Discrete Time Stochastic Hybrid Systems.	HSCC	2006	DBLP DOI BibTeX RDF
17	Marius Kloetzer, Calin Belta	Reachability Analysis of Multi-affine Systems.	HSCC	2006	DBLP DOI BibTeX RDF
17	Michael Luttenberger	Reachability Analysis of Procedural Programs with Affine Integer Arithmetic.	CIAA	2006	DBLP DOI BibTeX RDF
17	Moe Thandar Wynn, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, David Edmond	Verifying Workflows with Cancellation Regions and OR-Joins: An Approach Based on Reset Nets and Reachability Analysis.	Business Process Management	2006	DBLP DOI BibTeX RDF	Workflow verification, Cancellation, OR-joins, Reset nets, YAWL
17	David Ward, Fabio Somenzi	Decomposing image computation for symbolic reachability analysis using control flow information.	ICCAD	2006	DBLP DOI BibTeX RDF
17	Polyvios Pratikakis, Jeffrey S. Foster, Michael Hicks 0001	Existential Label Flow Inference Via CFL Reachability.	SAS	2006	DBLP DOI BibTeX RDF
17	José Miguel Montañana, José Flich, Antonio Robles, José Duato	Reachability-Based Fault-Tolerant Routing.	ICPADS (1)	2006	DBLP DOI BibTeX RDF
17	Parosh Aziz Abdulla, Bengt Jonsson 0001, Ahmed Rezine, Mayank Saksena	Proving Liveness by Backwards Reachability.	CONCUR	2006	DBLP DOI BibTeX RDF
17	Gregor Gößler	Compositional Reachability Analysis of Genetic Networks.	CMSB	2006	DBLP DOI BibTeX RDF
17	Stefan Ratschan, Zhikun She	Constraints for Continuous Reachability in the Verification of Hybrid Systems.	AISC	2006	DBLP DOI BibTeX RDF
17	Daniel Y. Chao	Reachability of nonsynchronized choice Petri nets and its applications.	IEEE Trans. Syst. Man Cybern. Part B	2005	DBLP DOI BibTeX RDF
17	Gerd Behrmann	Distributed reachability analysis in timed automata.	Int. J. Softw. Tools Technol. Transf.	2005	DBLP DOI BibTeX RDF	Distributed state space generation, Model checking, Load balancing, Timed automata
17	Sabine M. Böhm	H-RAFT - Heuristic Reachability Analysis for Fault Tolerance Protocols Modelled in SDL.	DSN	2005	DBLP DOI BibTeX RDF
17	Olivier Tardieu, Stephen A. Edwards	Approximate Reachability for Dead Code Elimination in Esterel.	ATVA	2005	DBLP DOI BibTeX RDF
17	Kim Guldstrand Larsen, Jacob Illum Rasmussen	Optimal Conditional Reachability for Multi-priced Timed Automata.	FoSSaCS	2005	DBLP DOI BibTeX RDF
17	Nadia Busi, Gianluigi Zavattaro	Deciding Reachability in Mobile Ambients.	ESOP	2005	DBLP DOI BibTeX RDF
17	Cristina Cerschi Seceleanu	Designing Controllers for Reachability.	COMPSAC (1)	2005	DBLP DOI BibTeX RDF
17	Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Angelika Mader	Production Scheduling by Reachability Analysis - A Case Study.	IPDPS	2005	DBLP DOI BibTeX RDF
17	Yi Lu 0003, John Potter	A Type System for Reachability and Acyclicity.	ECOOP	2005	DBLP DOI BibTeX RDF
17	Orna Grumberg, Tamir Heyman, Nili Ifergan, Assaf Schuster	Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation.	CHARME	2005	DBLP DOI BibTeX RDF
17	Wenjie Wang 0006, Cheng Jin 0009, Sugih Jamin	Network overlay construction under limited end-to-end reachability.	INFOCOM	2005	DBLP DOI BibTeX RDF
17	Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan	On-the-Fly Reachability and Cycle Detection for Recursive State Machines.	TACAS	2005	DBLP DOI BibTeX RDF
17	Olivier Buffet	Reachability Analysis for Uncertain SSPs.	ICTAI	2005	DBLP DOI BibTeX RDF
17	Themistoklis Haniotakis, Spyros Tragoudas, G. Pani	Reduced Test Application Time Based on Reachability Analysis.	ISQED	2005	DBLP DOI BibTeX RDF
17	Eric Allender, Samir Datta, Sambuddha Roy	The Directed Planar Reachability Problem.	FSTTCS	2005	DBLP DOI BibTeX RDF
17	Husain Aljazzar, Holger Hermanns, Stefan Leue	Counterexamples for Timed Probabilistic Reachability.	FORMATS	2005	DBLP DOI BibTeX RDF
17	Jan Gulliksen, Hans Andersson, Per Lundgren	Accomplishing universal access through system reachability-a management perspective.	Univers. Access Inf. Soc.	2004	DBLP DOI BibTeX RDF	Usability, Accessibility, Standards, Management, Guidelines
17	Ganapathy Parthasarathy, Madhu K. Iyer, Kwang-Ting Cheng, Li-C. Wang	Efficient reachability checking using sequential SAT.	ASP-DAC	2004	DBLP DOI BibTeX RDF
17	Calin Belta, Peter Finin, Luc C. G. J. M. Habets, Ádám M. Halász, Marcin Imielinski, Vijay Kumar 0001, Harvey Rubin	Understanding the Bacterial Stringent Response Using Reachability Analysis of Hybrid Systems.	HSCC	2004	DBLP DOI BibTeX RDF
17	Sebastiano Vigna	Reachability Problems in Entity-Relationship Schema Instances.	ER	2004	DBLP DOI BibTeX RDF
17	Xiaofang Qi, Baowen Xu	Dependence Analysis of Concurrent Programs Based on Reachability Graph and Its Applications.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
17	Thomas Mailund, Michael Westergaard	Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method.	TACAS	2004	DBLP DOI BibTeX RDF	memory efficient state representation, the sweep-line method, Verification, state space reduction, state space methods
17	Mojmír Kretínský, Vojtech Rehák, Jan Strejcek	Extended Process Rewrite Systems: Expressiveness and Reachability.	CONCUR	2004	DBLP DOI BibTeX RDF
17	Orna Grumberg, Assaf Schuster, Avi Yadgar	Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis.	FMCAD	2004	DBLP DOI BibTeX RDF
17	Xenofon D. Koutsoukos, Panos J. Antsaklis	Safety and Reachability of Piecewise Linear Hybrid Dynamical Systems Based on Discrete Abstractions.	Discret. Event Dyn. Syst.	2003	DBLP DOI BibTeX RDF
17	Orna Grumberg, Tamir Heyman, Assaf Schuster	A Work-Efficient Distributed Algorithm for Reachability Analysis.	CAV	2003	DBLP DOI BibTeX RDF
17	Johan Bengtsson, Wang Yi 0001	On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata.	ICFEM	2003	DBLP DOI BibTeX RDF
17	Rajeev Alur, Thao Dang 0001, Franjo Ivancic	Progress on Reachability Analysis of Hybrid Systems Using Predicate Abstraction.	HSCC	2003	DBLP DOI BibTeX RDF
17	René David, Hassane Alla	Reachability Graph for Autonomous Continuous Petri Nets.	POSTA	2003	DBLP DOI BibTeX RDF
17	Stephane Gaubert, Ricardo Katz	Reachability and Invariance Problems in Max-plus Algebra.	POSTA	2003	DBLP DOI BibTeX RDF
17	Enric Pastor, Marco A. Peña	Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems.	CHARME	2003	DBLP DOI BibTeX RDF
17	Kenneth L. McMillan	Craig Interpolation and Reachability Analysis.	SAS	2003	DBLP DOI BibTeX RDF
17	Ahmed Bouajjani, Tayssir Touili	Reachability Analysis of Process Rewrite Systems.	FSTTCS	2003	DBLP DOI BibTeX RDF
17	David W. Binkley, Mark Harman	Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms.	SCAM	2003	DBLP DOI BibTeX RDF
17	Geert Stremersch, René K. Boel	Structuring Acyclic Petri Nets for Reachability Analysis and Control.	Discret. Event Dyn. Syst.	2002	DBLP DOI BibTeX RDF	acyclic Petri net, uncontrollable transitions, Petri net, supervisory control
17	Marko Mäkelä	Maria: Modular Reachability Analyser for Algebraic System Nets.	ICATPN	2002	DBLP DOI BibTeX RDF
17	Rolf Drechsler, Daniel Große	Reachability Analysis for Formal Verification of SystemC.	DSD	2002	DBLP DOI BibTeX RDF
17	Tatiana Rybina, Andrei Voronkov	BRAIN : Backward Reachability Analysis with Integers.	AMAST	2002	DBLP DOI BibTeX RDF