Haddad et al, 2012

Summary

Serge Haddad, Sylvain Schmitz, and Philippe Schnoebelen (2012) The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets LICS 2012 IEEE Computer Society Press 355–364 (URL)

BibTeX entry

@INPROCEEDINGS { HSS-lics2012,
    LOCATION = { Dubrovnik, Croatia },
    AUTHOR = { Haddad, Serge and Schmitz, Sylvain and Schnoebelen, {\relax Ph}ilippe },
    BOOKTITLE = { LICS 2012 },
    CONFNAME = { {A}nnual {IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience },
    CONFNUM = { 27th },
    MONTH = { },
    PAGES = { 355--364 },
    DOI = { 10.1109/LICS.2012.46 },
    PUBLISHER = { {IEEE} Computer Society Press },
    TITLE = { The Ordinal-Recursive Complexity of Timed-Arc {P}etri Nets, Data Nets, and Other Enriched Nets },
    URL = { http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HSS-lics12.pdf },
    YEAR = { 2012 },
}