Author:
Chen Taolue,Ploeger Bas,van de Pol Jaco,Willemse Tim A. C.
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
2. Andersen, H.R.: Model checking and boolean graphs. Theoretical Computer Science 126(1), 3–30 (1994)
3. Lecture Notes in Computer Science;H.R. Andersen,1995
4. Basten, T.: Branching bisimilarity is an equivalence indeed! Information Processing Letters 58, 141–147 (1996)
5. Bolognesi, T., Brinksma, E.: Introduction to the ISO specification language LOTOS. Computer Networks 14, 25–59 (1987)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On-The-Fly Solving for Symbolic Parity Games;Tools and Algorithms for the Construction and Analysis of Systems;2022
2. Equivalence Checking 40 Years After: A Review of Bisimulation Tools;Lecture Notes in Computer Science;2022
3. Fold/Unfold Transformations for Fixpoint Logic;Tools and Algorithms for the Construction and Analysis of Systems;2020
4. A Comparison of BDD-Based Parity Game Solvers;Electronic Proceedings in Theoretical Computer Science;2018-09-07
5. Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems;Electronic Proceedings in Theoretical Computer Science;2018-02-16