Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,475 papers from all fields of science
Search
Sign In
Create Free Account
Reachability problem
Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Computational model
Discrete system
Game theory
Hybrid system
Expand
Broader (1)
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
A model driven approach to data privacy verification in E-Health systems
F. Amato
,
Francesco Moscato
Transactions on Data Privacy
2015
Corpus ID: 6182702
Last years experienced the growth of new technologies able to remotely monitor health state of persons. This includes both (even…
Expand
2014
2014
Stochastic Approximation of Global Reachability Probabilities of Markov Population Models
L. Bortolussi
,
Roberta Lanciani
European Performance Engineering Workshop
2014
Corpus ID: 16029485
Complex computer systems, from peer-to-peer networks to the spreading of computer virus epidemics, can often be described as…
Expand
Review
2008
Review
2008
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
M. Praveen
,
Kamal Lodaya
Reachability Problems
2008
Corpus ID: 8774544
2007
2007
A Global Algorithm for Model-Based Test Suite Generation
A. Hessel
,
P. Pettersson
MBT
2007
Corpus ID: 14051304
2007
2007
Automated Reasoning with Analytic Tableaux and Related Methods
Nicola Olivetti
2007
Corpus ID: 27641932
Invited Talks.- Nonmonotonic Description Logics - Requirements, Theory, and Implementations.- Our Quest for the Holy Grail of…
Expand
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
2003
2003
Infinite graphs generated by tree rewriting
Christof Löding
,
W. Thomas
,
E. Grädel
2003
Corpus ID: 124000641
2003
2003
Rewriting in the partial algebra of typed terms modulo AC
Thomas Colcombet
Infinity
2003
Corpus ID: 18706316
1998
1998
Validation of a SFC Software Specification by Using Hybrid Automata
G. Hassapis
,
Isabella Kotini
,
Z. Doulgeri
1998
Corpus ID: 64505335
1995
1995
Deadlock detection in communicating finite state machines by even reachability analysis
W. Peng
Proceedings of Fourth International Conference on…
1995
Corpus ID: 23950358
A network of communicating finite state machines (CFSM) consists of a set of finite state machines which communicate…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE