|
Méthodes Formelles pour les Systèmes Logiciels et Matériels| old_uid | 5783 |
|---|
| title | Méthodes Formelles pour les Systèmes Logiciels et Matériels |
|---|
| start_date | 2008/12/05 |
|---|
| schedule | 14h-15h |
|---|
| online | no |
|---|
| location_info | salle 847 |
|---|
| summary | In this talk, it is shown that if a finite labelled transition system is deterministic, persistent, and weakly periodic, then it can be decomposed in the sense that there exists a finite set of label-disjoint cycles such that any other cycle is Parikh-equivalent to a multiset of cycles from this finite set. At the end of the talk, a few open questions are discussed. This is joint work with Philippe Darondeau from IRISA in Rennes.. |
|---|
| responsibles | Baerecke |
|---|
| |
|