Author:
Groote Jan Friso,Moller Faron
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
2. A. Bouajjani, J.-C. Fernandez and N. Halbwachs. Minimal model generation. Draft, 1991.
3. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking 1020 states and beyond. In Proceedings 5 th Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 428–439, 1990.
4. S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3 rd Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, pages 151–158, 1971.
5. J. Engelfriet. Determinacy → (observation equivalence = trace equivalence). Theoretical Computer Science, 36(1):21–25, 1985.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Team Automata: Overview and Roadmap;Lecture Notes in Computer Science;2024
2. Realisability of Global Models of Interaction;Theoretical Aspects of Computing – ICTAC 2023;2023
3. Compositional Automata Learning of Synchronous Systems;Fundamental Approaches to Software Engineering;2023
4. Decomposing Monolithic Processes in a Process Algebra with Multi-actions;Electronic Proceedings in Theoretical Computer Science;2021-10-02
5. Unique Parallel Decomposition for the Pi-calculus;Electronic Proceedings in Theoretical Computer Science;2016-08-09