Reachability in Networks of Register Protocols under Stochastic Schedulers

October 16, 2017 in by

by Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan
Reference:
Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP’16). Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, July 2016. (To appear)
Bibtex Entry:
@string{jul="July"}
@inproceedings{BMRSS-icalp16,
  address =       {Rome, Italy},
  author =        {Bouyer, Patricia and Markey, Nicolas and
                   Randour, Mickael and Sangnier, Arnaud and
                   Stan, Daniel},
  booktitle =     {{P}roceedings of the 43rd {I}nternational
                   {C}olloquium on {A}utomata, {L}anguages and
                   {P}rogramming ({ICALP}'16)},
  month =         jul,
  note =          {To~appear},
  publisher =     {Leibniz-Zentrum f{"u}r Informatik},
  series =        {Leibniz International Proceedings in Informatics},
  title =         {Reachability in Networks of Register Protocols under
                   Stochastic Schedulers},
  year =          {2016},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  arxiv16-BMRSS.pdf},
  category =      {conf},
  wps =           {wp1 and wp2},
  partners =      {CNRS and ULB},
  casstingpart =  {100},
}