Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Reachability_problem> ?p ?o }
Showing triples 1 to 44 of
44
with 100 triples per page.
- Reachability_problem abstract "Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, program analysis, discrete and continuous systems, time critical systems, hybrid systems, rewriting systems, probabilistic and parametric systems, and open systems modelled as games.In general the reachability problem can be formulated as follows: Given a computational (potentially infinite state) system with a set of allowed rules or transformations, decide whether a certain state of a system is reachable from a given initial state of the system.Variants of the reachability problem may result from additional constraints on the initial or final states, specific requirement for reachability paths as well as for iterative reachability or changing the questions into analysis of winning strategies in infinite games or unavoidability of some dynamics.Typically, for a fixed system description given in some form (reduction rules, systems of equations, logical formulas, etc.) a reachability problem consists of checking whether a given set of target states can be reached starting from a fixed set of initial states. The set of target states can be represented explicitly or via some implicit representation (e.g., a system of equations, a set of minimal elements with respect to some ordering on the states). Sophisticated quantitative and qualitative properties can often be reduced to basic reachability questions. Decidability and complexity boundaries, algorithmic solutions, and efficient heuristics are all important aspects to be considered in this context. Algorithmic solutions are often based on different combinations of exploration strategies, symbolic manipulations of sets of states, decomposition properties, or reduction to linear programming problems, and they often benefit from approximations, abstractions, accelerations and extrapolation heurisitics. Ad hoc solutions as well as solutions based on general purpose constraint solvers and deduction engines are often combined in order to balance efficiency and flexibility.".
- Reachability_problem wikiPageID "38878183".
- Reachability_problem wikiPageLength "3311".
- Reachability_problem wikiPageOutDegree "21".
- Reachability_problem wikiPageRevisionID "674954288".
- Reachability_problem wikiPageWikiLink Category:Theory_of_computation.
- Reachability_problem wikiPageWikiLink Cellular_automaton.
- Reachability_problem wikiPageWikiLink Computational_model.
- Reachability_problem wikiPageWikiLink Concurrency_(computer_science).
- Reachability_problem wikiPageWikiLink Constraint_programming.
- Reachability_problem wikiPageWikiLink Discrete_system.
- Reachability_problem wikiPageWikiLink Feed_forward_(control).
- Reachability_problem wikiPageWikiLink Game_theory.
- Reachability_problem wikiPageWikiLink Heuristic.
- Reachability_problem wikiPageWikiLink Hybrid_system.
- Reachability_problem wikiPageWikiLink Iteration.
- Reachability_problem wikiPageWikiLink Linear_programming.
- Reachability_problem wikiPageWikiLink Parametric_equation.
- Reachability_problem wikiPageWikiLink Petri_net.
- Reachability_problem wikiPageWikiLink Probability.
- Reachability_problem wikiPageWikiLink Program_analysis.
- Reachability_problem wikiPageWikiLink Recursive_set.
- Reachability_problem wikiPageWikiLink Rewriting.
- Reachability_problem wikiPageWikiLink Simultaneous_equations.
- Reachability_problem wikiPageWikiLink State_variable.
- Reachability_problem wikiPageWikiLink Workshop_on_Reachability_Problems.
- Reachability_problem wikiPageWikiLinkText "Reachability problem".
- Reachability_problem wikiPageWikiLinkText "reachability problem".
- Reachability_problem wikiPageWikiLinkText "reachable".
- Reachability_problem wikiPageUsesTemplate Template:Empty_section.
- Reachability_problem wikiPageUsesTemplate Template:Reflist.
- Reachability_problem subject Category:Theory_of_computation.
- Reachability_problem hypernym Problem.
- Reachability_problem type Area.
- Reachability_problem type Disease.
- Reachability_problem type Area.
- Reachability_problem comment "Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, program analysis, discrete and continuous systems, time critical systems, hybrid systems, rewriting systems, probabilistic and parametric systems, and open systems modelled as games.In general the reachability problem can be formulated as follows: Given a computational (potentially infinite state) system with a set of allowed rules or transformations, decide whether a certain state of a system is reachable from a given initial state of the system.Variants of the reachability problem may result from additional constraints on the initial or final states, specific requirement for reachability paths as well as for iterative reachability or changing the questions into analysis of winning strategies in infinite games or unavoidability of some dynamics.Typically, for a fixed system description given in some form (reduction rules, systems of equations, logical formulas, etc.) a reachability problem consists of checking whether a given set of target states can be reached starting from a fixed set of initial states. ".
- Reachability_problem label "Reachability problem".
- Reachability_problem sameAs Q17141570.
- Reachability_problem sameAs Problema_da_alcançabilidade.
- Reachability_problem sameAs m.0ryslfc.
- Reachability_problem sameAs Q17141570.
- Reachability_problem wasDerivedFrom Reachability_problem?oldid=674954288.
- Reachability_problem isPrimaryTopicOf Reachability_problem.