Actualités
  Période
semaine
ou mois
aucune période


  Thèmes:
Thèses
Colloques
Autres
Groupes
Tous les thèmes

   
  Liens:
Voir les thèses

Voir les colloques

Voir les autres événements

Voir la page des groupes

Accéder à l'intranet

Intitulé:   
Branching bisimulation for normed commutative context free grammars
du groupe Modélisation et Verification

Date 2014-09-18  11:00-12:00
TitreBranching bisimulation for normed commutative context free grammars 
RésuméBisimulation is known and well studied equivalence relation between states of a labeled transition system, however there is no canonical extension of it to systems with epsilon transitions. There are several candidates among which the best known are weak and branching bisimulation. During the talk I will present some ideas behind one of algorithms to compute branching bisimulation for infinite state systems, namely those induced by normed commutative context free grammars. I will start from basic definitions and then I will go to the sketch of the proof. This talk bases on a joint work with Wojciech Czerwinski and Slawomir Lasota published on Concur 2011. 
Lieu076 
OrateurPiotr Hofman 
Emailpiotrek.hofman@gmail.com 
UrlUniv. Bayreuth 



Aucun document lié à cet événement.

Retour
Retour à l'index