Author:
Meyer Roland,Khomenko Victor,Hüchting Reiner
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous π-calculus. Nord. J. Comp. 9(1), 70–101 (2002)
2. Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Monographs in Theoretical Computer Science. An EATCS Series. Springer (2001)
3. Busi, N., Gorrieri, R.: Distributed semantics for the π-calculus based on Petri nets with inhibitor arcs. J. Log. Alg. Prog. 78(1), 138–162 (2009)
4. Dam, M.: Model checking mobile processes. Inf. Comp. 129(1), 35–51 (1996)
5. Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general π-calculus terms. For. Asp. Comp. 20(4-5), 429–450 (2008)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Encoding Petri Nets into CCS;Lecture Notes in Computer Science;2024
2. Intransitive Non-Interference by Unfolding;Formal Aspects of Component Software;2015
3. Non-interference by Unfolding;Application and Theory of Petri Nets and Concurrency;2014
4. A Theory of Name Boundedness;CONCUR 2013 – Concurrency Theory;2013
5. A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets;Lecture Notes in Computer Science;2012