logo
ProjectEnded

Rule-algebraic Simple Rewriting

The status, timeline and source of this project. A free account opens every field.

Source: EU Funding & Tenders Portal

The basis for this project consists in a mathematical framework previously developed by the applicant that allows to describe graph rewriting systems algebraically, the so-called rule algebraic framework. In order to advance and valorise the concept, this project proposes to develop a general concept for rule-algebraic simple rewriting (RaSiR), both for conventional graph rewriting and for a novel

Status
Closed
Sector
Chemical (Industrial), Manufacturing (Industrial), Education
Location
France
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Rule-algebraic Simple Rewriting

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

First answer free · no account

I am a

Project Information FAQ

Project Information

3 Q
The project “Rule-algebraic Simple Rewriting” is an infrastructure initiative in the Chemical (Industrial) sector, located in France. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

ended

Taiyo status

Closed

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

The basis for this project consists in a mathematical framework previously developed by the applicant that allows to describe graph rewriting systems algebraically, the so-called rule algebraic framework. In order to advance and valorise the concept, this project proposes to develop a general concept for rule-algebraic simple rewriting (RaSiR), both for conventional graph rewriting and for a novel form of simplicial rewriting. Secondly, RaSiR will serve as the basis for developing rule-algebraic variants of trace compression and observable-update algorithms for the rewriting system Kappa. The final aim of the project consists in developing and implementing the so-called observable-centric bootstrapping algorithm (OCBA) as a module for the simulation suite KaSim for the Kappa language. Kappa is predominantly used for simulating biochemical reaction systems, which typically display an extremely high combinatorial complexity. The algorithms and software modules developed in this project will provide in particular an alternative to pure stochastic simulation via the SSA algorithm as currently implemented in KaSim, in the form of the OCBA module. This module will admit the generation of approximate observable distributions from individual pure states of the system by calculating algebraically truncations of the formal solution of the chemical master equation as well as the induced observable update functions. The project shall be hosted by Dr. Jean Krivine of the PPS team at IRIF at the University Paris-Diderot in France. Dr. Krivine is one of the two main developers of the KaSim simulation suite, and moreover one of the world experts in the theoretical and practical development of the programming language Kappa. IRIF will provide an ideal environment for the applicant to develop new skills, to be part the very interdisciplinary research team PPS, and to communicate and valorise the project results to the greater biochemical and systems biological simulation community.

Location

Country

France

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Chemical (Industrial), Manufacturing (Industrial), Education

Article published date

2026-01-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