The following pages link to (Q2769610):
Displaying 12 items.
- Causal message sequence charts (Q843103) (← links)
- Realizability of high-level message sequence charts: closing the gaps (Q1884911) (← links)
- Reasoning about layered message passing systems (Q1886450) (← links)
- Interpreting message flow graphs (Q1904641) (← links)
- Realisability of pomsets (Q2011200) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- Specification and verification using message sequence charts (Q2841317) (← links)
- Timed semantics of message sequence charts based on timed automata (Q2842583) (← links)
- Quantitative Analysis of Communication Scenarios (Q2945583) (← links)
- (Q4428292) (← links)
- On the composition of Tunstall messages (Q4701420) (← links)
- Lectures on Concurrency and Petri Nets (Q5712282) (← links)