Pages that link to "Item:Q1887140"
From MaRDI portal
The following pages link to Regular sets of infinite message sequence charts (Q1887140):
Displaying 13 items.
- Causal message sequence charts (Q843103) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Checking conformance for time-constrained scenario-based specifications (Q2355682) (← 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)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- MSO Logic for Unambiguous Shared-Memory Systems (Q3533037) (← links)
- Semantics of Deterministic Shared-Memory Systems (Q3541010) (← links)
- (Q5009419) (← links)
- Synthesis of Safe Message-Passing Systems (Q5458841) (← links)
