Author:
Czerwiński Wojciech,Hofman Piotr,Lasota Sławomir
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Christensen, S.: Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)
2. Lecture Notes in Computer Science;S. Christensen,1993
3. Esparza, J.: Petri nets, commutative context-free grammars, and Basic Parallel Processes. Fundam. Inform. 31(1), 13–25 (1997)
4. Fröschle, S., Lasota, S.: Normed processes, unique decomposition, and complexity of bisimulation equivalences. Electr. Notes Theor. Comp. Sci. 239, 17–42 (2009)
5. Hirshfeld, Y.: Congruences in commutative semigroups. Technical report, University of Edinburgh, LFCS report ECS-LFCS-94-291 (1994)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Process Algebras for Petri Nets;Monographs in Theoretical Computer Science. An EATCS Series;2017
2. Theory of interaction;Theoretical Computer Science;2016-01
3. Branching Bisimilarity on Normed BPA Is EXPTIME-Complete;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07
4. A polynomial time algorithm for checking regularity of totally normed process algebra;Journal of Shanghai Jiaotong University (Science);2014-09-30
5. Branching Bisimilarity Checking for PRS;Automata, Languages, and Programming;2014