Bounded MSC communication

DOI10.1016/j.ic.2003.10.002zbMath1091.68006OpenAlexW2013082250MaRDI QIDQ1881218

Anca Muscholl, Markus Lohrey

Publication date: 4 October 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2003.10.002

zbMATH Keywords

asynchronous processescommunication protocols

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (11)

Realizability of concurrent recursive programs ⋮ On interactive knowledge with bounded communication ⋮ Multiparty half-duplex systems and synchronous communications ⋮ Quantifying the Discord: Order Discrepancies in Message Sequence Charts ⋮ Unnamed Item ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ Mixing Lossy and Perfect Fifo Channels ⋮ QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS ⋮ Event clock message passing automata: a logical characterization and an emptiness checking algorithm ⋮ A Kleene theorem and model checking algorithms for existentially bounded communicating automata ⋮ Message-passing automata are expressively equivalent to EMSO logic

Cites Work

• The method of forced enumeration for nondeterministic automata
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• Nondeterministic Space is Closed under Complementation
• Complete Register Allocation Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded MSC communication