Enumeration and random generation of concurrent computations

HIGHLIGHTS

• who: AofA' and collaborators from the Laboratoire d'Informatique de Paris-Nord, CNRS UMR , Institut Galilée, Université Paris-Nord, France have published the research work: Enumeration and Random Generation of Concurrent Computations, in the Journal: (JOURNAL)
• what: The authors provide a quantitative study of the shuffle. As a first result, the authors show that the mean width of shuffle trees is exponentially smaller than the worst case upper-bound, which is reached.
• future: From a broader perspective the authors definitely see an interest in reinterpreting semantic objects (from logic programming language theory . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.