All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

359 (0,086s) •

Result

Logspace reduction of directed reachability for bounded genus graphs to the planar case

We show that reachability in directed graphs embedded on a fixed surface of arbitrary genus is logspace-reducible to reachability in directed graphs embedded in the plane....

IN - Informatika

  • 2010
    • •
  • Jx
Result

Parabolic Set Simulation for Reachability Analysis of Linear Time Invariant Systems with Integral Quadratic Constraint

This work extends reachability analyses based on ellipsoidal techniques energetic constraint. To compute the reachable set, the LTI system is augmented is violated. For a given parabolic set of initial states, the reachable...

Automation and control systems

  • 2019
    • •
  • D
    • •
  • Link
Result

On Reachable States Of Nonlinear Dynamical Systems

We study the set of states which are reachable in time $T > 0$ from zero initial state of the infinite-dimensional dynamical system described by a nonlinear under which a reachable state in time T of the associated linear dynamical ...

BA - Obecná matematika

  • 2006
    • •
  • D
Result

Reachability Problems

Proceedings of 4th International Workshop on Reachability Problems (RP 2010).

IN - Informatika

  • 2010
    • •
  • O
Result

Checking Algebraic Reachability of Polynomial and Rational Systems

The overview of possible approaches to check algebraic reachability of polynomial and rational systems is provided. The respective methods are demonstrated on a number of examples chosen with the emphasis on tutorial presentation of the resu...

Applied mathematics

  • 2017
    • •
  • D
    • •
  • Link
Result

General Optimization Framework for Recurrent Reachability Objectives

We consider the mobile robot path planning problem for a class of recurrent reachability objectives. These objectives are parameterized by the expected time needed to visit one position from another, the expected square of this time, and als...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022
    • •
  • D
    • •
  • Link
Result

4th International Workshop on Reachability Problems

4th International Workshop on Reachability Problems, organized in Brno, Czech Republic...

IN - Informatika

  • 2010
    • •
  • W
Result

TAPAAL and Reachability Analysis of P/T Nets

We discuss selected model checking techniques used in the tool TAPAAL for the reachability analysis of weighted Petri nets with inhibitor arcs. We focus on techniques that had the most significant effect at the 2015 Model Checking Contest (M...

IN - Informatika

  • 2016
    • •
  • D
    • •
  • Link
Result

Reachability Analysis of Multithreaded Software with Asynchronous Communication

. Since the reachability problem for ADPN is undecidable even in the case without dynamic creation of processes, we address the bounded reachability problem [QR05 efficient algorithms for both forward and backward reachability

IN - Informatika

  • 2005
    • •
  • D
Result

Reachability for Extended Process Rewrite Systems

We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the reachability problem for PRS extended with a so called weak finite state unit is decidable....

IN - Informatika

  • 2004
    • •
  • D
  • 1 - 10 out of 359