Message-passing automata are expressively equivalent to EMSO logic-Reference-Cited by-同舟云学术

Message-passing automata are expressively equivalent to EMSO logic

Published:2006-08 Issue:2-3 Volume:358 Page:150-172
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bollig Benedikt,Leucker Martin

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference30 articles.

1. Inference of message sequence charts;Alur,2000

2. R. Alur, K. Etessami, M. Yannakakis. Realizability and verification of MSC graphs, in: Proc. 28th Internat. Colloq. on Automata, Languages and Programming (ICALP 2001), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001.

3. R. Alur, M. Yannakakis, Model checking of message sequence charts, in: Proc. 10th Internat. Conf. on Concurrency Theory (CONCUR 1999), Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999.

4. H. Ben-Abdallah, S. Leue, Syntactic detection of process divergence and non-local choice in message sequence charts, in: Proc. Third Internat. Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS 1997), Lecture Notes in Computer Science, Vol. 1217, Springer, Berlin, 1997.

5. On communicating finite-state machines;Brand;J. ACM,1983

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Synthesis and Analysis of Petri Nets from Causal Specifications;Computer Aided Verification;2022

2. Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic;Journal of Computer and System Sciences;2021-02

3. Relating Paths in Transition Systems;ACM Transactions on Computational Logic;2018-07-31

4. Communicating Finite-State Machines and Two-Variable Logic;LEIBNIZ INT PR INFOR;2018

5. Automata and Logics for Concurrent Systems: Five Models in Five Pages;Implementation and Application of Automata;2015