Skip to main content
Conference ProceedingsOPEN ACCESS

On automatically explaining bisimulation inequivalence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 531 LNCS 364-372
DOI: 10.1007/BFb0023750
30Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper describes a technique for generating a logical formula that differentiates between two bisimulation-inequivalent finite-state systems. The method works in conjunction with a partition-refinement algorithm for computing bisimulation equivalence and yields formulas that are often minimal in a precisely defined sense.

Cite

CITATION STYLE

APA

Cleveland, R. (1991). On automatically explaining bisimulation inequivalence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 531 LNCS, pp. 364–372). Springer Verlag. https://doi.org/10.1007/BFb0023750

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free