Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,782,929 papers from all fields of science
Search
Sign In
Create Free Account
Reachability
Known as:
Graph reachability
, Reach
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex can reach a vertex (and is reachable…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
39 relations
Argus - Audit Record Generation and Utilization System
Bipolar orientation
Book embedding
CPAchecker
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Certified Interpolant Generation for EUF
Andrew Reynolds
,
Cesare Tinelli
2011
Corpus ID: 16349579
Logical interpolants have found a wide array of applications in automated verification, including symbolic model checking and…
Expand
2008
2008
Fusing Procedural and Declarative Planning Goals for Nondeterministic Domains
Dmitry Shaparau
,
M. Pistore
,
P. Traverso
AAAI Conference on Artificial Intelligence
2008
Corpus ID: 18558514
While in most planning approaches goals and plans are different objects, it is often useful to specify goals that combine…
Expand
2006
2006
Agent - Based Workflow Management Systems(Wfmss): JBees - A Distributed and Adaptive WFMS with Moni
Lars Ehrler
,
Martin K. Fleurke
,
M. Purvis
,
Bastin Tony Roy Savarimuthu
2006
Corpus ID: 14961368
The bogies are connected together via fluid pressure operated reciprocating actuators and pressure lines in order to have the…
Expand
2005
2005
Petri net models, functional abstractions, and reduction techniques: applications to the design of automated manufacturing systems
R. Zurawski
IEEE transactions on industrial electronics…
2005
Corpus ID: 23947052
The use of generic models in the synthesis of flexible manufacturing systems (FMSs) systems, which allows for rapid modeling and…
Expand
2002
2002
Static Dependency Analysis for Concurrent Ada 95 Programs
Zhengqiang Chen
,
Baowen Xu
,
Jianjun Zhao
,
Hongji Yang
International Conference on Reliable Software…
2002
Corpus ID: 18781164
Program dependency analysis is an analysis technique to identify and determine various program dependencies in program source…
Expand
2002
2002
Software Tools for the Supervisory Control of Petri Nets Based on Place Invariants
M. V. Iordache
,
P. Antsaklis
2002
Corpus ID: 6701505
A computationally efficient method for constructing Petri net controllers is presented. The method is derived using place…
Expand
2000
2000
Guided Synthesis of Control Programs for a Batch Plant using UPPAAL
T. Hune
,
K. Larsen
,
P. Pettersson
2000
Corpus ID: 14379515
In this paper we address the problem of scheduling and synthesizing distributed control programs for a batch production plant. We…
Expand
2000
2000
Planning with tokens: an approach between satisfaction and optimisation
P. Fabiani
,
Y. Meiller
Planen und Konfigurieren
2000
Corpus ID: 15846930
This paper presents an initial approach in an attempt to integrate powerful propositional planning tools within a general…
Expand
1999
1999
A GSM-MAP Protocol Experiment Using Passive Testing
Marine Tabourier
,
A. Cavalli
,
M. Ionescu
World Congress on Formal Methods
1999
Corpus ID: 1235205
Passive testing is the process of collecting traces of the messages exchanged between an operating implementation and its…
Expand
1999
1999
Modeling and Formal Verification of the Fairisle ATM Switch Fabric Using MDG ’ s
S. Tahar
,
Xiao-Yu Song
,
E. Cerny
,
Zi-Jian Zhou
,
M. Langevin
,
Otmane Aït-Mohamed
1999
Corpus ID: 15107291
In this paper, we present several techniques for modeling and formal verification of the Fairisle asynchronous transfer mode (ATM…
Expand