Weak bisimulation approximants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4207 LNCS, Issue , 2006, Pages 365-379

  Harwood, Will ^a   Moller, Faron ^a   Setzer, Anton ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; HIERARCHICAL SYSTEMS; NUMBER THEORY;

BASIC PARALLEL PROCESSES (BPP); BISIMULATION APPROXIMANTS; CLASSICAL PROOFS; INFINITE ORDINALS;

APPROXIMATION THEORY;

EID: 33750289633     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_24     Document Type: Conference Paper

References (23)

1. A. Blass and Y. Gurevich, Program termination and well partial orderings. Microsoft Technical Report MSR-TR-2006-27, 31 pages, March 2006. (Available at ftp://ftp.research.microsoft.com/pub/tr/TR-2006-27.pdf.)
2. O. Burkart, D. Caucal, F. Moller and B. Steffen. Verification over Infinite States. Chapter 9 in the Handbook of Process Algebra, pages 545-623, Elsevier Publishers, 2001.
3. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In Proceedings of the 4th International Conference on Concurrency Theory (CONCUR'93), LNCS 715, pages 143-157, Springer, 1993.
4. S. Christensen, Y. Hirshfeld, and F. Moller. Decomposability, decidability und axiomatisability for bisimulation equivalence on basic parallel processes. In Procecdings of the 8th Annual IEEE Symposium on Logic in Computer Science (LICS'03). pages 386-396, IEEE Computer Society Press, 1993.
5. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes, In Proceedings of the 3rd International Conference on Concurrency Theory (CONCUR'92), LNCS 630, pages 138-147, Springer, 1992.
6. L.E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with distinct, factors, American Journal of Mathematics 3:413-422, 1913.
7. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel proceses, Fundamenta Informaticae 30:23-41, 1997.
8. R. Glabbeek. The linear time - branching; time spectrum 1: The semantics of concrete sequential processes. Chapter 1 in the Handbook of Process Algebra. pages 3-99, Elsevier Publishers, 2001.
9. W. Harwood and F. Moller. Weak bisimulation approximants, In Selected Papers from the CALCO Young Researchers Workshop (CALCO-jnr 2005), Swansea University Research Report CSR 18-2005, pages 27-40, December 2005, (Available at http://www-compsci.swan.ac.uk/reports/2005.html.)
10. Y. Hirshfeld, Bisimulation trees and the decidability of weak bisimulation, Electronic Notes in Theoretical Computer Science 5:2-13, 1997.
11. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes, In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS'94), Pages 623-631, IEEE Computer Society Press, 1994.
12. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of norined context-free processes. Theoretical Computer Science 15:143-159, 1996.
13. 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.
14. P. Jančar. Strong bisimilarity on Basic Parallel Processes is PSPACE-complete. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 218-227, IEEE Computer Society Press, 2003.
15. P. Jančar and F. Moller, Techniques for decidability and undecidability of bisimilarity. In Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), LNCS 1664, pages 30-45, Springer, 1999.
16. F. Moller. Infinite Results. In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR'96), LNCS 1119, pages 195-216, Springer, 1996.
17. J. Srba. Strong bisimilarity and regularity of Basic Process Algebra is PSPACE-hard. In Proceedings of the 29th International Conference on Automata, Languages and Programming (ICALP'02), LNCS 2380, pages 716-727, Springer, 2002.
18. J. Srba. Strong bisimilarity and regularity of Basic Parallel Processes is PSPACE-hard. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS'02), LNCS 2285, pages 535-546, Springer, 2002.
19. J. Srba. Complexity of weak bisimilarity and regularity for BPA and BPP. Mathematical Structures in Computer Science 13:567-587, 2003.
20. J. Srba. Roadmap of Infinite Results, http://www.brics.dk/~srba/roadmap.
21. C. Stirling. Decidability of weak bisimilarity for a subset of Basic Parallel Processes. In Proceedings of Foundations of Software Science and Computation Structures (FOSSACS'01), LNCS 2030, pages 379-393, 2001.
22. J. Stříbrná. Approximating weak bisimulation on Basic Process Algebras. In Proceedings of Mathematical Foundations of Computer Science (MFCS'99), LNCS 1072, pages 366-375, 1999.
23. M. Sustik. Proof of Dickson's Lemma using the ACL2 theorem prover via an explicit ordinal mapping. Unpublished presentation at the Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2003). (Available from http://www.cs.utexas.edu/users/moore/acl2/workshop-2003.)