Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

AVS-ISS

Financiado

Analysis Verification and Synthesis for Infinite State Systems

The central objective of this project is to investigate key algorithmic verification questions concerning two fundamental mathematical structures used to model and analyse infinite-state systems, namely discrete linear dynamical s... ver más

31/01/2021

MPG

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

MAXPLANCKGESELLSCHAFT ZUR FORDERUNG DER WISSE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 3 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2021-01-31

ERC-CoG-2014: ERC Consolidator Grant

I+D

Cerrada hace 10 años

0% 100% 100%

3 Participantes

MPG

62.50K€ | Lider

LETS GOWEX, S.A

297.50K€ | Participante

UOXF

1.77M€ | Participante

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

TIN2009-14562-C05-04 FEAST: FUNDAMENTOS Y EXTENSIONES DE LA TECNOLOGIA ANSWER SET... 141K€ Cerrado

Nekoka Realizing the Promise of Higher-Order SMT and Superposition... 2M€ Cerrado

TIN2009-14562-C05-02 FUNDAMENTOS Y EXTENSIONES DE LA TECNOLOGIA ANSWER SET 54K€ Cerrado

TIN2009-14562-C05-03 FEAST: FUNDAMENTOS Y EXTENSIONES DE LA TECNOLOGIA ANSWER SET... 22K€ Cerrado

TIN2009-14562-C05-05 FUNDAMENTOS Y EXTENSIONES DE LA TECNOLOGIA ANSWER SET PROGRA... 54K€ Cerrado

FINABIS Finite-state abstractions of infinite-state systems 1M€ Cerrado

Duración del proyecto: 67 meses Fecha Inicio: 2015-06-24
Fecha Fin: 2021-01-31

Líder del proyecto

MAXPLANCKGESELLSCHAFT ZUR FORDERUNG DER WISSE... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Descripción del proyecto The central objective of this project is to investigate key algorithmic verification questions concerning two fundamental mathematical structures used to model and analyse infinite-state systems, namely discrete linear dynamical systems and counter automata, in both ordinary and parametric form. Motivated especially by applications to software model checking (more specifically the termination of linear loops and predicate abstraction computations), as well as parametric real-time reasoning and the verification of Markov chains, we will focus on model-checking, module-checking, and synthesis problems for linear dynamical systems and one-counter automata against various fragments and extensions of Linear Temporal Logic (LTL) specifications. The key deliverables will be novel verification algorithms along with a map of the complexity landscape. A second objective is then to transfer algorithmic insights into practical verification methodologies and tools, in collaboration with colleagues in academia and industrial research laboratories. We will build on a series of recent advances and breakthroughs in these areas (some of which from the PI’s team) to attack a range of specific algorithmic problems. We believe that this line of research will not only result in fundamental theoretical contributions and insights in their own right—potentially answering mathematical questions that have been open for years or even decades—but will also impact the practice of formal verification and lead to new and more powerful methods and tools for the use of engineers and programmers.

Conecta tu I+D

Entra hoy

¿Olvide mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores