Résumé : Trace monoids are basic mathematical models of concurrent systems. The probabilistic framework on trace monoids can be found in Abbes and Mairesse (2015) including the uniqueness of uniform measure and random generation. To adopt more practical dynamic systems, it is essential to take account of ”state”. Conventionally, we model the ”concurrency” by the traces in a trace monoid and model the ”state” by the words in an automaton. Combining these two features, we consider the traces in an automaton, which is equivalent to the executions in a safe Petri net. Our goal is to prove the uniqueness of the uniform measure for partial actions on a trace monoid in order to generate uniformly the infinite executions of a 1-safe Petri net. In this talk, I will present some properties and the difficulties that we encounter now.
| Dernière modification : Thursday 21 November 2024 |
|
Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr |