Reasoning about sequential and branching behaviours of message sequence graphs
From MaRDI portal
Recommendations
Cited in
(13)- Infinite-state high-level MSCs: model-checking and realizability
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Message-passing automata are expressively equivalent to EMSO logic
- A theory of regular MSC languages
- Specification and verification using message sequence charts
- Quantitative analysis of communication scenarios
- scientific article; zbMATH DE number 1954389 (Why is no real title available?)
- scientific article; zbMATH DE number 1980918 (Why is no real title available?)
- scientific article; zbMATH DE number 2081110 (Why is no real title available?)
- Message sequence graphs and decision problems on Marzurkiewicz traces
- Products of Message Sequence Charts
- Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
- Pattern matching and membership for hierarchical message sequence charts
This page was built for publication: Reasoning about sequential and branching behaviours of message sequence graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535064)