Author:
Valmari Antti,Kervinen Antti
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Bolognesi, T. & Brinksma, E.: “Introduction to the ISO Specification Language LOTOS”. Computer Networks and ISDN Systems 14, 1987, pp. 25–59.
2. Lect Notes Comput Sci;J. Helovuo,2000
3. Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p.
4. Hopcroft, J. E., Motwani, R. & Ullman, J. D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 2001, 521 p.
5. Jategaonkar, L. & Meyer, A. R.: “Deciding True Concurrency Equivalences on Finite Safe Nets”. Theoretical Computer Science 154 (1), 1996, pp. 107–143.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. External Behaviour of Systems of State Machines with Variables;Transactions on Petri Nets and Other Models of Concurrency VII;2013
2. Hardness of Preorder Checking for Basic Formalisms;Logic for Programming, Artificial Intelligence, and Reasoning;2010
3. Hardness of equivalence checking for composed finite-state systems;Acta Informatica;2009-01-13
4. Operational Semantics for Fun and Profit;Communicating Sequential Processes. The First 25 Years;2005
5. Equivalence Checking of Non-flat Systems Is EXPTIME-Hard;CONCUR 2003 - Concurrency Theory;2003