logo
ProjectOngoing

Finite-state abstractions of infinite-state systems

One of 10,000+ projects Taiyo tracks in Germany.

Source: EU Funding & Tenders Portal

The algorithmic analysis of infinite-state systems is a central topic of theoretical computer science that is part of a popular approach to software verification. While analyzing infinite-state systems is indispensable when verifying software, finite-state sytems are far better understood and permit much more efficient analysis. In this project, I will pursue fundamental questions that arise whe

Status
Under Construction
Sector
Electric Vehicles (EVs), Automotive, Government
Location
Germany
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Finite-state abstractions of infinite-state systems

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

4 Q
The project “Finite-state abstractions of infinite-state systems” is an infrastructure initiative in the Electric Vehicles (EVs) sector, located in Germany. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Sponsoring Agency

Status

Original status

ongoing

Taiyo status

Under Construction

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

The algorithmic analysis of infinite-state systems is a central topic of theoretical computer science that is part of a popular approach to software verification. While analyzing infinite-state systems is indispensable when verifying software, finite-state sytems are far better understood and permit much more efficient analysis. In this project, I will pursue fundamental questions that arise when we want to abstract infinite-state systems by finite-state systems. The goal is to understand two types of problems: 1. Separability problems: Given two infinite-state systems, can we find a finite-state overapproximation of the first system whose behaviors are disjoint from those of the second system? Separability is a basic task for synthesizing certificates for disjointness and therefore safety properties in concurrent systems. 2. Closure computation. There are several non-constructive results that guarantee the existence of finite-state overapproximations of infinite-state systems that preserve some particular information. We are interested in how to compute these overapproximations effectively and efficiently. Examples include downward closures and upward closures with respect to the (scattered) subword ordering. Efficient procedures for closure computation would have immediate implications for infinite-state verification tasks that combine recursion with concurrency. In addition to directly attacking well-known deep open problems regarding these fundamental questions, the project will also develop methods that will likely be crucial for resolving further major open problems in infinite-state systems. Moreover, the obtained results would have immediate implications for software verification in settings that combine recursion with concurrency, which is a notoriously difficult task.

Location

Country

Germany

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Electric Vehicles (EVs), Automotive, Government

Article published date

2025-10-15

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project