Handbook of theoretical computer science (vol. B)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Specification and Verification of Message Sequence Charts
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Infinite-State High-Level MSCs: Model-Checking and Realizability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Product Version of Dynamic Linear Time Temporal Logic
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model-Checking of causality properties
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Reasoning about layered message passing systems
Computer Languages, Systems and Structures
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Propositional Dynamic Logic Approach for Order of Magnitude Reasoning
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
Magnitude qualitative reasoning via PDL
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Propositional dynamic logic with converse and repeat for message-passing systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC-. Every formula is translated into an equivalent communicating finite-state machine (CFM) of exponential size. This synthesis problem is solved in full generality, i.e., also for MSCs with unbounded channels. The model checking problems for CFMs and for HMSCs against PDL formulas are shown to be in PSPACE for existentially bounded MSCs. It is shown that CFMs are to weak to capture the semantics of PDL with intersection.