Paper: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (at LICS 2012)

Authors: Serge Haddad Sylvain Schmitz Philippe Schnoebelen

Abstract

No Abstract Available

BibTeX

  @InProceedings{HaddadSchmitzSchnoe-TheOrdinalRecursive,
    author = 	 {Serge Haddad and Sylvain Schmitz and Philippe Schnoebelen},
    title = 	 {The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets},
    booktitle =  {Proceedings of the Twenty-Seventh Annual IEEE Symposium on Logic in Computer Science (LICS 2012)},
    year =	 {2012},
    month =	 {June}, 
    pages =      {355--364},
    location =   {Dubrovnik, Croatia}, 
    publisher =	 {IEEE Computer Society Press}
  }