On message sequence graphs and finitely generated regular MSC languages
From MaRDI portal
Recommendations
Cited in
(18)- Realizability and verification of MSC graphs
- Bounded MSC communication
- Realizability of high-level message sequence charts: closing the gaps
- Regular sets of infinite message sequence charts
- Infinite-state high-level MSCs: model-checking and realizability
- Message-passing automata are expressively equivalent to EMSO logic
- A theory of regular MSC languages
- Languages for analysis and testing of event sequences
- On regular message sequence chart languages and relationships to Mazurkiewicz trace theory
- scientific article; zbMATH DE number 1980918 (Why is no real title available?)
- scientific article; zbMATH DE number 2081110 (Why is no real title available?)
- Reasoning about sequential and branching behaviours of message sequence graphs
- Regular collections of message sequence charts (extended abstract)
- Synthesizing distributed finite-state systems from MSCs
- scientific article; zbMATH DE number 2086410 (Why is no real title available?)
- scientific article; zbMATH DE number 2087422 (Why is no real title available?)
- Message sequence graphs and decision problems on Marzurkiewicz traces
- Products of Message Sequence Charts
This page was built for publication: On message sequence graphs and finitely generated regular MSC languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754187)