The Experts below are selected from a list of 42 Experts worldwide ranked by ideXlab platform

Georg Zetzsche - One of the best experts on this subject based on the ideXlab platform.

  • RP - Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
    Lecture Notes in Computer Science, 2019
    Co-Authors: Sylvain Schmitz, Georg Zetzsche
    Abstract:

    We consider the model of pushdown Vector addition systems with Resets. These consist of Vector addition systems that have access to a pushdown stack and have instructions to Reset counters. For this model, we study the coverability problem. In the absence of Resets, this problem is known to be decidable for one-dimensional pushdown Vector addition systems, but decidability is open for general pushdown Vector addition systems. Moreover, coverability is known to be decidable for Reset Vector addition systems without a pushdown stack. We show in this note that the problem is undecidable for one-dimensional pushdown Vector addition systems with Resets.

Sylvain Schmitz - One of the best experts on this subject based on the ideXlab platform.

  • RP - Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
    Lecture Notes in Computer Science, 2019
    Co-Authors: Sylvain Schmitz, Georg Zetzsche
    Abstract:

    We consider the model of pushdown Vector addition systems with Resets. These consist of Vector addition systems that have access to a pushdown stack and have instructions to Reset counters. For this model, we study the coverability problem. In the absence of Resets, this problem is known to be decidable for one-dimensional pushdown Vector addition systems, but decidability is open for general pushdown Vector addition systems. Moreover, coverability is known to be decidable for Reset Vector addition systems without a pushdown stack. We show in this note that the problem is undecidable for one-dimensional pushdown Vector addition systems with Resets.

Zetzsche Georg - One of the best experts on this subject based on the ideXlab platform.

  • Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets
    2019
    Co-Authors: Schmitz Sylvain, Zetzsche Georg
    Abstract:

    We consider the model of pushdown Vector addition systems with Resets. These consist of Vector addition systems that have access to a pushdown stack and have instructions to Reset counters. For this model, we study the coverability problem. In the absence of Resets, this problem is known to be decidable for one-dimensional pushdown Vector addition systems, but decidability is open for general pushdown Vector addition systems. Moreover, coverability is known to be decidable for Reset Vector addition systems without a pushdown stack. We show in this note that the problem is undecidable for one-dimensional pushdown Vector addition systems with Resets.Comment: 8 page

Prieto Matías Manuel - One of the best experts on this subject based on the ideXlab platform.

  • Customized Nios II multi-cycle instructions to accelerate block-matching techniques
    'SPIE-Intl Soc Optical Eng', 2015
    Co-Authors: González Diego, Botella Juan Guillermo, García Sánchez Carlos, Meyer Bäse Anke, Meyer Bäse Uwe, Prieto Matías Manuel
    Abstract:

    This study focuses on accelerating the optimization of motion estimation algorithms, which are widely used in video coding standards, by using both the paradigm based on Altera Custom Instructions as well as the efficient combination of SDRAM and On-Chip memory of Nios II processor. Firstly, a complete code profiling is carried out before the optimization in order to detect time leaking affecting the motion compensation algorithms. Then, a multi-cycle Custom Instruction which will be added to the specific embedded design is implemented. The approach deployed is based on optimizing SOC performance by using an efficient combination of On-Chip memory and SDRAM with regards to the Reset Vector, exception Vector, stack, heap, read/write data (.rwdata), read only data (.rodata), and program text (.text) in the design. Furthermore, this approach aims to enhance the said algorithms by incorporating Custom Instructions in the Nios II ISA. Finally, the efficient combination of both methods is then developed to build the final embedded system. The present contribution thus facilitates motion coding for low-cost Soft-Core microprocessors, particularly the RISC architecture of Nios II implemented in FPGA. It enables us to construct an SOC which processes 50×50 @ 180 fps

Schmitz Sylvain - One of the best experts on this subject based on the ideXlab platform.

  • Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets
    2019
    Co-Authors: Schmitz Sylvain, Zetzsche Georg
    Abstract:

    We consider the model of pushdown Vector addition systems with Resets. These consist of Vector addition systems that have access to a pushdown stack and have instructions to Reset counters. For this model, we study the coverability problem. In the absence of Resets, this problem is known to be decidable for one-dimensional pushdown Vector addition systems, but decidability is open for general pushdown Vector addition systems. Moreover, coverability is known to be decidable for Reset Vector addition systems without a pushdown stack. We show in this note that the problem is undecidable for one-dimensional pushdown Vector addition systems with Resets.Comment: 8 page