scientific article; zbMATH DE number 2086413
From MaRDI portal
Publication:4736868
Recommendations
Cited in
(19)- 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
- Specifying reversibility with \(\mathrm{TLA}^+\)
- 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
- QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS
- Pomset Languages of Finite Step Transition Systems
- scientific article; zbMATH DE number 1927562 (Why is no real title available?)
- scientific article; zbMATH DE number 1746448 (Why is no real title available?)
- scientific article; zbMATH DE number 1754631 (Why is no real title available?)
- scientific article; zbMATH DE number 2087438 (Why is no real title available?)
- Lectures on Concurrency and Petri Nets
- High-level message sequence charts and projections.
- Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
- Certified implementability of global multiparty protocols
- Causal message sequence charts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736868)