Faron Moller
- S. Abramsky. The lazy lambda calculus. In D. A. Turner, editor, Research Topics in Functional Programming, pages 65--116. Addison-Welsey, Reading, MA, 1990.]] Google Scholar
Digital Library
- P. Aczel. Non-Well-Founded Sets. Number~14 in CSLI Lecture Notes. CSLI Publications, Stanford, CA, 1988.]]Google Scholar
- J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, 40(3):653--682, July 1993.]] Google ScholarDigital Library
- J. Balcazar, J. Gabarro, and M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4:638--648, 1992.]]Google ScholarCross Ref
- Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung, 14:143--177, 1961.]]Google Scholar
- S. Blom and S. Orzan. A distributed algorithm for strong bisimulation reduction of state spaces. In L. Brim and O. Grumberg, editors, Parallel and Distributed Model Checking (PDMC 2002). Elsevier Science, Electronic Notes in Theoretical Computer Science, 68(4), 16 pages, 2002.]]Google Scholar
- O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, chapter~9, pages 545--623. Elsevier Science, 2001.]]Google Scholar
- O. Burkart, D. Caucal, and B. Steffen. An elementary decision procedure for arbitrary context-free processes. In Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science (MFCS'95), volume 969 of Lecture Notes in Computer Science, pages 423--433. Springer-Verlag, 1995.]] Google ScholarDigital Library
- S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for Basic Parallel Processes. In Proceedings of CONCUR'93: Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 143--157. Springer-Verlag, 1993.]] Google ScholarDigital Library
- S. Christensen, Y. Hirshfeld, and F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on Basic Parallel Processes. In 8th Annual IEEE Symposium on Logic in Computer Science, pages 386--396. IEEE, 1993.]]Google ScholarCross Ref
- S. Christensen, H. Hüttel, and C. Stirling. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Information and Computation, 12(2):143--148, 1995.]] Google ScholarDigital Library
- J. Hartmanis. Turing Award lecture: On computational complexity and the nature of computer science. Communications of the ACM, 37(10):37--43, October 1994.]] Google ScholarDigital Library
- Y. Hirshfeld. Petri nets and the equivalence problem. In Proceedings of CSL'93: Computer Science Logic, volume 832 of LNCS, pages 165--174. Springer-Verlag, 1994.]] Google ScholarDigital Library
- Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science, 158:143--159, May 1996.]] Google ScholarDigital Library
- Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Mathematical Structures in Computer Science, 6:251--259, 1996.]]Google ScholarCross Ref
- P. Jancar. Strong bisimilarity on Basic Parallel Processes is PSPACE-complete. In 18th Annual IEEE Symposium on Logic in Computer Science. IEEE, 2003.]] Google ScholarDigital Library
- P. Jancar and A. Kucera. Equivalence-checking with infinite-state systems: Techniques and results. In Proceedings of 29th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'02), volume 2540 of Lecture Notes in Computer Science, pages 41--73. Springer-Verlag, 2002.]] Google ScholarDigital Library
- P. Jancar and F. Moller. Techniques for decidability and undecidability of bisimilarity. In Proceedings of CONCUR'99: Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 30--45. Springer-Verlag, 1999.]] Google ScholarDigital Library
- C. Jeong, Y. Kim, H. Kim, and Y. Oh. A faster parallel implementation of Kanellakis-Smolka algorithm for bisimilarity checking. In Proceedings of the International Computer Symposium, Tainan, Taiwan, 1998.]]Google Scholar
- P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43--68, May 1990.]] Google ScholarDigital Library
- A.J. Korenjak and J.E. Hopcroft. Simple deterministic languages. In 7th Annual IEEE Symposium on Switching and Automata Theory, pages 36--46. IEEE, 1966.]]Google ScholarDigital Library
- E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In Proceedings of 16th Annual Symposium on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 404--413. Springer-Verlag, 1999.]]Google ScholarCross Ref
- R. Milner. A Calculus of Communicating Systems, volume~92 of LNCS. Springer-Verlag, Berlin, 1980.]] Google ScholarDigital Library
- R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.]] Google ScholarDigital Library
- R. Milner. Elements of interaction --- Turing Award lecture. Communications of the ACM, 36(1):78--89, January 1993.]] Google ScholarDigital Library
- R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I and II. Information and Computation, 100, 1992.]] Google ScholarDigital Library
- F. Moller. Infinite results. In Proceedings of CONCUR'96: Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 195--216. Springer-Verlag, 1996.]] Google ScholarDigital Library
- F. Moller and S. A. Smolka. On the computational complexity of bisimulation. ACM Computing Surveys, 27(2):287--289, June 1995.]] Google ScholarDigital Library
- M. Nielsen and C. Clausen. Bisimulation, games and logic. In Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa, volume 812 of Lecture Notes in Computer Science, pages 289--306. Springer-Verlag, 1994.]] Google ScholarDigital Library
- R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973--989, December 1987.]] Google ScholarDigital Library
- C. H. Papadimitriou. Algorithms, games, and the internet. In Proceedings of 33rd Symposium on Theory of Computing, pages 749--753. ACM Press, New York, 2001.]] Google ScholarDigital Library
- D. M. R. Park. Concurrency and automata on infinite sequences. In Proceedings of 5th G.I. Conference on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 167--183. Springer-Verlag, 1981.]] Google ScholarDigital Library
- S. Rajasekaran and I. Lee. Parallel algorithms for relational coarsest partition problems. IEEE Transactions on Parallel and Distributed Systems, 9(7):687--699, July 1998.]] Google ScholarDigital Library
- G. Senizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In 39th Annual IEEE Symposium on Foundations of Computer Science, pages 120--129. IEEE, 1998.]] Google ScholarDigital Library
- G. Senizergues. L(A)=L(B)? Decidability results from complete formal systems. Theoretical Computer Science, 251(1-2):1--166, January 2001.]] Google ScholarDigital Library
- J. Srba. Roadmap of infinite results. Department of Computer Science, University of Aarhus, http://www.brics.dk/~srba/roadmap+, 2002.]]Google Scholar
- J. Srba. Strong bisimilarity and regularity of Basic Process Algebra is PSPACE-hard. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP'02), volume 2380 of Lecture Notes in Computer Science, pages 716--727. Springer-Verlag, 2002.]] Google ScholarDigital Library
- C. Stirling. Local model checking games. In Proceedings of 6th International Conference on Concurrency Theory (CONCUR'95), volume 962 of Lecture Notes in Computer Science, pages 1--11. Springer-Verlag, 1995.]] Google ScholarDigital Library
- C. Stirling. Games for bisimulation and model checking. In Notes for Mathfit Workshop on Finite Model Theory, University of Wales, Swansea, July 1996.]]Google Scholar
- C. Stirling. Modal and temporal logics for processes. In Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science, pages 149--237. Springer-Verlag, 1996.]] Google Scholar
- C. Stirling. Decidability of bisimulation equivalence for pushdown processes. Research Report EDI-INF-RR-0005, School of Informatics, Edinburgh University, January 2000.]]Google Scholar
- C. Stirling. Decidability of DPDA equivalence. Theoretical Computer Science, 255(1-2):1--31, March 2001.]] Google ScholarDigital Library
- L. J. Stockmeyer and A. Meyer. Word problems requiring exponential time. In Proceedings of Fifth ACM Symposium on Theory of Computing, pages 1--9, 1973.]] Google ScholarDigital Library
- M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):182--221, 1986.]] Google ScholarDigital Library
- S. Zhang and S. A. Smolka. Efficient parallelization of equivalence checking algorithms. In M. Diaz and R. Groz, editors, Proceedings of Fifth International Conference on Formal Description Techniques, pages 133--146, October 1992.]] Google ScholarDigital Library
Index Terms
- On the computational complexity of bisimulation, redux
Recommendations
On the computational complexity of bisimulation, redux
Paris Kanellakis and the second author (Smolka) were among the first to investigate the computational complexity of bisimulation, and the first and third authors (Moller and Srba) have long-established track records in the field. Smolka and Moller have ...
Bisimulation on speed: a unified approach
Two process-algebraic approaches have been developed for comparing two bisimulation-equivalent processes with respect to speed: the one of Moller/Tofts equips actions with lower time bounds, while the other by Lüttgen/Vogler considers upper time bounds ...
Bisimulation on speed: a unified approach
FOSSACS'05: Proceedings of the 8th international conference on Foundations of Software Science and Computation StructuresTwo process–algebraic approaches have been developed for comparing two bisimulation–equivalent processes with respect to speed: the one of Moller/Tofts equips actions with lower time bounds, while the one by Lüttgen/Vogler considers upper time bounds ...
Comments