A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms
暂无分享,去创建一个
[1] Parosh Aziz Abdulla,et al. Verifying Programs with Unreliable Channels , 1996, Inf. Comput..
[2] Benedikt Bollig,et al. Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..
[3] P. Madhusudan,et al. Beyond Message Sequence Graphs , 2001, FSTTCS.
[4] Madhavan Mukund,et al. On Message Sequence Graphs and Finitely Generated Regular MSC Languages , 2000, ICALP.
[5] Madhavan Mukund,et al. A theory of regular MSC languages , 2005, Inf. Comput..
[6] Philippe Schnoebelen,et al. Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..
[7] Anca Muscholl,et al. Compositional Message Sequence Charts , 2001, TACAS.
[8] Doron A. Peled,et al. Specification and Verification of Message Sequence Charts , 2000, FORTE.
[9] Rajeev Alur,et al. Model Checking of Message Sequence Charts , 1999, CONCUR.
[10] Anca Muscholl,et al. Infinite-State High-Level MSCs: Model-Checking and Realizability , 2002, ICALP.
[11] Wei Wei,et al. A Scalable Incomplete Test for the Boundedness of UML RT Models , 2004, TACAS.
[12] Patrice Godefroid,et al. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs , 1999, Formal Methods Syst. Des..
[13] Anca Muscholl,et al. Logical Definability on Infinite Traces , 1996, Theor. Comput. Sci..
[14] Pierre Wolper,et al. The Power of QDDs (Extended Abstract) , 1997, SAS.
[15] Anca Muscholl,et al. Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces , 1999, MFCS.
[16] Daniel Brand,et al. On Communicating Finite-State Machines , 1983, JACM.
[17] Pierre Wolper,et al. The Power of QDDs , 1997 .
[18] Rémi Morin,et al. Recognizable Sets of Message Sequence Charts , 2002, STACS.
[19] Wieslaw Zielonka,et al. Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..
[20] Anca Muscholl,et al. Specifying and Verifying Partial Order Properties Using Template MSCs , 2004, FoSSaCS.
[21] A. Mazurkiewicz. Concurrent Program Schemes and their Interpretations , 1977 .
[22] Dietrich Kuske,et al. Regular sets of infinite message sequence charts , 2003, Inf. Comput..
[23] Ahmed Bouajjani,et al. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations , 1999, Theor. Comput. Sci..
[24] Anca Muscholl,et al. Bounded MSC communication , 2002, Inf. Comput..
[25] Edward Ochmanski,et al. Regular behaviour of concurrent systems , 1985, Bull. EATCS.
[26] Philippe Schnoebelen,et al. Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..