The Complexity of Coverability in ν-Petri Nets

Article Details
Title:	The Complexity of Coverability in ν-Petri Nets
Article URLs:	https://doi.org/10.1145/2933575.2933593 http://ieeexplore.ieee.org/document/8576456
Alternative Article URLs:
Authors:	Ranko Lazic	University of Warwick, DIMAP University of Warwick, Department of Computer Science
Authors:	Sylvain Schmitz	LSV ENS Cachan CNRS INRIA Université Paris-Saclay
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/lics/LazicS16
Author Comments:

ACM/IEEE Logic in Computer Science, LICS 2016