Author:
Genest Blaise,Muscholl Anca,Kuske Dietrich
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Abdulla, P., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91–101 (1996)
2. Lecture Notes in Computer Science;R. Alur,1999
3. Bouajjani, A., Habermehl, P.: Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. Theoretical Computer Science 221(1-2), 211–250 (1999)
4. Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The Power of QDDs. SAS 1997, 172–186 (1997)
5. Boigelot, B., Godefroid, P.: Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. Formal Methods in System Design 14(3), 237–255 (1999)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Partial Order View of Message-Passing Communication Models;Proceedings of the ACM on Programming Languages;2023-01-09
2. Controllable-Choice Message Sequence Graphs;Mathematical and Engineering Methods in Computer Science;2013
3. Unfolding Synthesis of Asynchronous Automata;Computer Science – Theory and Applications;2006
4. Constructing Exponential-Size Deterministic Zielonka Automata;Automata, Languages and Programming;2006
5. The Synthesis Problem of Netcharts;Petri Nets and Other Models of Concurrency - ICATPN 2006;2006