Message sequence graphs and decision problems on Marzurkiewicz traces
From MaRDI portal
Recommendations
Cited in
(29)- Weighted asynchronous cellular automata
- Realizability of concurrent recursive programs
- Knapsack in graph groups
- Realizability and verification of MSC graphs
- Bounded time-stamping in message-passing systems
- Bounded MSC communication
- Realizability of high-level message sequence charts: closing the gaps
- Regular sets of infinite message sequence charts
- Checking conformance for time-constrained scenario-based specifications
- 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
- scientific article; zbMATH DE number 1728524 (Why is no real title available?)
- Specification and verification using message sequence charts
- Quantitative analysis of communication scenarios
- Quantifying the Discord: Order Discrepancies in Message Sequence Charts
- Realizability of Concurrent Recursive Programs
- Regular set of representatives for time-constrained MSC graphs
- scientific article; zbMATH DE number 1980918 (Why is no real title available?)
- scientific article; zbMATH DE number 1754636 (Why is no real title available?)
- Diagnosis from scenarios
- Products of Message Sequence Charts
- Detecting Races in Ensembles of Message Sequence Charts
- Synthesis and Analysis of Petri Nets from Causal Specifications
- Certified implementability of global multiparty protocols
- Causal message sequence charts
- Permutation rewriting and algorithmic verification
- Pattern matching and membership for hierarchical message sequence charts
This page was built for publication: Message sequence graphs and decision problems on Marzurkiewicz traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941891)
