Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. E. Badouel, L. Bernardinello, and P. Darondeau. Polynomial algorithms for the synthesis of bounded nets. In P. Mosses et al., editors, TAPSOFT 95, Lect. Notes Comp. Sci. 915, 364–378. Springer, 1995.
2. E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri nets. Acta Informatica, 28:231–264, 1991.
3. J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Deriving Petri nets from finite transition systems. IEEE Transactions on Computers, 47:859–882, 1998.
4. P. Darondeau. Deriving unbounded Petri nets from formal languages. In D. Sangiorgi and R. de Simone, editors, CONCUR 98, Lect. Notes Comp. Sci. 1466, 533–548. Springer, 1998.
5. M. Droste and R.M. Shortt. Petri nets and automata with concurrency relations — an adjunction. In M. Droste et al., editors, Semantics of Programming Languages and Model Theory. Gordon and Breach, 69–87. 1993.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献