Search for Author All Reviews
	Haase, Christoph     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       The logical view on continuous Petri nets Blondin M., Finkel A., Haase C., Haddad S. ACM Transactions on Computational Logic 18(3): 1-28, 2017.  Type: Article The reachability problem for standard Petri nets is EXPSPACE hard, and the coverability problem is EXPSPACE complete. However, more efficient algorithms exist for variants of the standard nets. Continuous Petri nets are such a variant ...... Nov 17 2017
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy