Author:
Bernardinello Luca,Kılınç Görkem,Pomello Lucia
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Balaguer, S., Chatain, T., Haar, S.: Building tight occurrence nets from reveals relations. In: Caillaud, B., Carmona, J., Hiraishi, K. (eds.) 11th International Conference on Application of Concurrency to System Design, ACSD 2011, Newcastle Upon Tyne, UK, pp. 44–53. IEEE, 20–24 June 2011. http://doi.ieeecomputersociety.org/10.1109/ACSD.2011.16
2. Balaguer, S., Chatain, T., Haar, S.: Building occurrence nets from reveals relations. Fundam. Inform. 123(3), 245–272 (2013). http://dx.doi.org/10.3233/FI-2013-809
3. Lecture Notes in Computer Science;P Baldan,2014
4. Bernardinello, L., Kılınç, G., Pomello, L.: Non-interference notions based on reveals and excludes relations for Petri nets. In: Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE 2015), Brussels, Belgium, pp. 59–78, 22–23 June 2015
5. Lecture Notes in Computer Science;E Best,2012
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献