-
Vector Addition System Reachability Problem: A Short Self-Contained Proof
International audience -
Communication sequence selection to preserve reachability/observability in ne...
International audience -
Modeling and Compositional Analysis of Genetic Regulatory Networks
Proteins fulfil a huge number of functions in any living organism. The dynamics of the protein concentrations in a cell is defined by a regulatory network which... -
Reach Scheduling for Embedded Systems
Projet POP_ART -
Reachability Analysis over Term Rewriting Systems
This paper surveys some techniques and tools for achieving reachability analysis over term rewriting systems. The core of those techniques is a generic tree automata... -
Reachability problems for products of matrices in semirings
We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a... -
Rational Semimodules over the Max-Plus Semiring and Geometric Approach of Dis...
We introduce rational semimodules over semirings whose addition is idempotent, like the max-plus semiring. We say that a subsemimodule of the free semimodule S^n over... -
Reachability Analysis of Term Rewriting Systems with Timbuk
We present Timbuk - a tree automata library - which implements usual operation- s on tree automata as well as a completion algorithm used to compute an... -
On the Decidability of Fragments of the Asynchronous Pi-Calculus
We study the decidability of a reachability problem for various fragments of the asynchronous $\pi$-calculus. We consider the combination of three main features: name... -
The Regular Viewpoint on PA-Processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PA-processes as {\em tree languages}. Our... -
A Primitive Recursive Algorithm for the General Petri Net Reachability Problem
The general Petri net reachability problem is shown to be decidable in double exponential space. The previous algorithm is non-primitive recursive. -
Decidable Approximations of Sets of Descendants and Sets of Normal Forms - ex...
We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on specific tree automata techniques. In the... -
Vector Addition Systems with States vs. Petri Nets
Petri nets are a well-known and intensively studied model of concurrency often used to specify distributed or parallel systems. Vector addition systems with states are... -
State space exploration of spatially organized populations of agents
International audience -
Reachability Analysis of Hybrid Systems using Support Functions
In model based design, one constructs a mathematical model of the system and uses it to design the system so that it exhibits the desired properties. For safety... -
A Logic of Reachable Patterns in Linked Data-Structures
Original article available at http://www.sciencedirect.com. -
Synthesis and Analysis of Product-form Petri Nets
This is a version including proofs of the conference paper: Haddad, Mairesse and Nguyen. Synthesis and Analysis of Product-form Petri Nets. Accepted at the conference Petri Nets... -
Vector Addition Systems Reachability Problem (A Simpler Solution)
International audience
