On automatically explaining bisimulation inequivalence-Reference-Cited by-同舟云学术

On automatically explaining bisimulation inequivalence

Published: Issue: Volume: Page:364-372
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cleveland Rance

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0023750.pdf

Reference16 articles.

1. Bloom, B., S. Istrail and A. Meyer. “Bisimulation Can't Be Traced.” In Proceedings of the ACM Symposium on Principles of Programming Languages, 1988.

2. Lecture Notes in Computer Science;G. Boudol,1990

3. Brookes, S.D., C.A.R. Hoare and A.W. Roscoe. “A Theory of Communicating Sequential Processes.” Journal of the ACM, v. 31, n. 3, July 1984, pp. 560–599.

4. Lecture Notes in Computer Science;R. Cleaveland,1990

5. Cleaveland, R., J. Parrow and B. Steffen. “A Semantics-Based Tool for the Verification of Finite-State Systems.” In Proceedings of the Ninth IFIP Symposium on Protocol Specification, Testing and Verification, 287–302. North-Holland, Amsterdam, 1990.

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

1. Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation;Lecture Notes in Computer Science;2024

2. Modal Logic Characterizations of Forward, Reverse, and Forward-Reverse Bisimilarities;Electronic Proceedings in Theoretical Computer Science;2023-09-30

3. Fixpoint Theory -- Upside Down;Logical Methods in Computer Science;2023-06-07

4. Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence;Logical Methods in Computer Science;2022-11-17

5. Equivalence Checking 40 Years After: A Review of Bisimulation Tools;Lecture Notes in Computer Science;2022