Author:
Klarlund Nils,Nielsen Mogens,Sunesen Kim
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. This volume.
2. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, 1991.
3. M. Abadi and L. Lamport. Conjoining specifications. Technical Report Report 118, Digital Equipment Corporation, Systems Research Center, 1993.
4. M. Broy and L. Lamport. The RPC-Memory Specification Problem. A case study for the Dagstuhl Seminar 9439. This volume.
5. E.M. Clark, I.A. Browne, and R.P. Kurshan. A unified approach for showing language containment and equivalence between various types of ω-automata. In A. Arnold, editor, CAAP, LNCS 431, pages 103–116, 1990.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Automata Terms in a Lazy WSkS Decision Procedure;Journal of Automated Reasoning;2021-08-03
2. Automata Terms in a Lazy WSkS Decision Procedure;Lecture Notes in Computer Science;2019
3. MONA Implementation Secrets;Implementation and Application of Automata;2001
4. LISA: A specification language based on WS2S;Computer Science Logic;1998
5. Mosel: A flexible toolset for monadic second-order logic;Tools and Algorithms for the Construction and Analysis of Systems;1997