Pages that link to "Item:Q2503037"
From MaRDI portal
The following pages link to Message-passing automata are expressively equivalent to EMSO logic (Q2503037):
Displaying 14 items.
- An optimal construction of Hanf sentences (Q420856) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- MSO Logic for Unambiguous Shared-Memory Systems (Q3533037) (← links)
- UNAMBIGUOUS SHARED-MEMORY SYSTEMS (Q3586410) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- (Q5009419) (← links)
- Synthesis of Safe Message-Passing Systems (Q5458841) (← links)
- Automata and Logics for Timed Message Sequence Charts (Q5458842) (← links)
- Propositional Dynamic Logic for Message-Passing Systems (Q5458843) (← links)
