Infinite results-Reference-Cited by-同舟云学术

Infinite results

Published:1996 Issue: Volume: Page:195-216
ISSN:0302-9743
Container-title:CONCUR '96: Concurrency Theory
language:
Short-container-title:

Author:

Moller Faron

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61604-7_56.pdf

Reference49 articles.

1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop (1987). Decidability of bisimulation equivalence for processes generating context-free languages. Proceedings of PARLE'87, Lecture Notes in Computer Science 259:94–113.

2. J.C.M. Baeten, J.A. Bergstra and J.W. Klop (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM 40:653–682.

3. Y. Bar-Hillel, M. Perles and E. Shamir (1961). On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung 14:143–177.

4. J.A. Bergstra and J.W. Klop (1985). Algebra of Communicating Processes with Abstraction. Theoretical Computer Science 37:77–121.

5. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill and L.J. Hwang (1990). Symbolic model checking 1020 states and beyond. Proceedings of LICS'90:428–439.

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2023-09-14

2. Simulation Relations and Applications in Formal Methods;Lecture Notes in Computer Science;2022

3. Sequential Composition in the Presence of Intermediate Termination (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2017-08-31

4. Turing Meets Milner;Lecture Notes in Computer Science;2012

5. Algebraic Synchronization Trees and Processes;Automata, Languages, and Programming;2012