Author:
Harel David,Kupferman Orna,Vardi Moshe Y.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference30 articles.
1. The existence of refinement mappings;Abadi;Theoret. Comput. Sci.,1991
2. Aziz, A, Singhal, V, Balarin, F, Brayton, R, and, Sangiovanni-Vincentelli, A. L. 1994, Equivalences for fair kripke structures, in, Proc. 21st International Colloquium on Automata, Languages and Programming, Jerusalem, Israel, July 1994.
3. Bensalem, S., Bouajjani, A., Loiseaux, C., and Sifakis, J.1992, Property preserving simulations, inProc. 4th Conference on Computer Aided Verification, Montreal, June 1992, Lecture Notes in Computer Science, Vol. 663, pp. 260–273, Springer-Verlag, Berlin.
4. Deciding bisimilarity is P-complete;Balcazar;Form. Asp. Comput.,1992
5. Clarke, E. M, Grumberg, O, and, Peled, D. 1999, Model Checking, MIT Press, Cambridge, MA.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Extremal Fitting Problems for Conjunctive Queries;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18
2. A Parametrized Analysis of Algorithms on Hierarchical Graphs;International Journal of Foundations of Computer Science;2019-09
3. Automated Equivalence Checking of Concurrent Quantum Systems;ACM Transactions on Computational Logic;2018-12-08
4. A Parametrized Analysis of Algorithms on Hierarchical Graphs;Descriptional Complexity of Formal Systems;2017
5. Sufficient conditions for reachability in automata networks with priorities;Theoretical Computer Science;2015-12