The following pages link to Bounded MSC communication (Q1881218):
Displaying 12 items.
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
- On interactive knowledge with bounded communication (Q2901218) (← links)
- Quantifying the Discord: Order Discrepancies in Message Sequence Charts (Q3510808) (← links)
- Mixing Lossy and Perfect Fifo Channels (Q3541029) (← links)
- QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS (Q3552521) (← links)
- (Q5009419) (← links)
- Towards generalised half-duplex systems (Q6649540) (← links)
