Author:
Valmari Antti,Hansen Henri
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Lecture Notes in Computer Science;A. Finkel,1993
2. Finkel, A., Geeraerts, G., Raskin, J.-F., Van Begin, L.: A counter-example to the minimal coverability tree algorithm. Technical Report 535, Universite Libre de Bruxelles (2005)
3. Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the efficient computation of the minimal coverability set of Petri nets. International Journal of Foundations of Computer Science 21(2), 135–165 (2010)
4. Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences 3(2), 147–195 (1969)
5. König, B., Koziura, V.: Incremental construction of coverability graphs. Information Processing Letters 103(5), 203–209 (2007)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献