Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirty first Annual IEEE Symposium on

Logic in Computer Science (LICS 2016)

Paper: The Complexity of Coverability in ν-Petri Nets (at LICS 2016)

Authors: Ranko Lazic Sylvain Schmitz

Abstract

No Abstract Available

BibTeX

  @InProceedings{LazicSchmitz-TheComplexityofCove,
    author = 	 {Ranko Lazic and Sylvain Schmitz},
    title = 	 {The Complexity of Coverability in ν-Petri Nets},
    booktitle =  {Proceedings of the Thirty first Annual IEEE Symposium on Logic in Computer Science (LICS 2016)},
    year =	 {2016},
    month =	 {July}, 
    pages =      {467--476},
    location =   {New York City}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski