@InProceedings{   bollig:inria-00589714,
  Author        = "Bollig, Benedikt and Helouet, Loic",
  Abstract      = "{We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can be described as sets of message sequence charts (MSCs). We consider the realizability problem for DCA: given a dynamic MSC grammar (a high-level MSC specification), is there a DCA defining the same set of MSCs? We show that this problem is EXPTIME-complete. Moreover, we identify a class of realizable grammars that can be implemented by finite DCA.}",
  Address       = "Kazan, Russie, F{\'e}d{\'e}ration De",
  affiliation   = "Laboratoire Sp{\'e}cification et V{\'e}rification [Cachan] - LSV , DISTRIBCOM - INRIA - IRISA",
  audience      = "internationale",
  BookTitle     = "{International Computer Science Symposium in Russia}",
  date-added    = "2012-12-04 21:45:35 +0000",
  date-modified = "2012-12-04 21:46:31 +0000",
  hal_id        = "inria-00589714",
  Keywords      = "dynamic communicating automata",
  Language      = "Anglais",
  PDF           = "http://hal.inria.fr/inria-00589714/PDF/dynamic.pdf",
  Title         = "{Realizability of Dynamic MSC Languages}",
  URL           = "http://hal.inria.fr/inria-00589714",
  Year          = "2010",
  bdsk-url-1    = "http://hal.inria.fr/inria-00589714",
  File          = "Realizability of Dynamic MSC Languages - Bollig, Helouet (0) (0) - a - a - n.pdf",
  file-2        = "Realizability of Dynamic MSC Languages - Bollig, Helouet (1) (0) - a - a - n.pdf"
}

@InProceedings{ bollig:inria-00589714, Author = "Bollig, Benedikt and Helouet, Loic", Abstract = "{We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can be described as sets of message sequence charts (MSCs). We consider the realizability problem for DCA: given a dynamic MSC grammar (a high-level MSC specification), is there a DCA defining the same set of MSCs? We show that this problem is EXPTIME-complete. Moreover, we identify a class of realizable grammars that can be implemented by finite DCA.}", Address = "Kazan, Russie, F{\'e}d{\'e}ration De", affiliation = "Laboratoire Sp{\'e}cification et V{\'e}rification [Cachan] - LSV , DISTRIBCOM - INRIA - IRISA", audience = "internationale", BookTitle = "{International Computer Science Symposium in Russia}", date-added = "2012-12-04 21:45:35 +0000", date-modified = "2012-12-04 21:46:31 +0000", hal_id = "inria-00589714", Keywords = "dynamic communicating automata", Language = "Anglais", PDF = "http://hal.inria.fr/inria-00589714/PDF/dynamic.pdf", Title = "{Realizability of Dynamic MSC Languages}", URL = "http://hal.inria.fr/inria-00589714", Year = "2010", bdsk-url-1 = "http://hal.inria.fr/inria-00589714", File = "Realizability of Dynamic MSC Languages - Bollig, Helouet (0) (0) - a - a - n.pdf", file-2 = "Realizability of Dynamic MSC Languages - Bollig, Helouet (1) (0) - a - a - n.pdf" }