|Unfoldings of contextual Petri nets|
du groupe Modélisation et Verification
|Date|| 2011-02-17 07:00-07:00|
|Titre||Unfoldings of contextual Petri nets |
|Résumé||In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finite-state) Petri nets, which can be used for verification purposes.
Contextual nets are a generalisation of Petri nets suited to model systems with read-only access to resources. When working with contextual nets, a finite complete prefix can be obtained by applying McMillan's construction to a suitable encoding of the contextual net into an ordinary net.
However, it has been observed that if the unfolding is itself a contextual net, then the complete prefix can be significantly smaller than the one obtained with the above technique. We propose a an unfolding algorithm that works for arbitrary semi-weighted, bounded contextual nets.
The talk is based on joint work with Paolo Baldan, Andrea Corradini, and Barbara Koenig. |
|Lieu||Salle 076, LaBRI, Rez-de-chaussée |
|Orateur||Stefan Schwoon |
|Url||LSV, Cachan |
Aucun document lié à cet événement.RetourRetour à l'index