The following pages link to (Q4736868):
Displaying 9 items.
- Causal message sequence charts (Q843103) (← links)
- Realizability and verification of MSC graphs (Q1770427) (← links)
- Realizability of high-level message sequence charts: closing the gaps (Q1884911) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- Specifying reversibility with \(\mathrm{TLA}^+\) (Q2210867) (← links)
- Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← 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)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
