The following pages link to A theory of regular MSC languages (Q2573333):
Displaying 31 items.
- A quadratic construction for Zielonka automata with acyclic communication structure (Q407518) (← links)
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- Compositional synthesis of asynchronous automata (Q551202) (← links)
- Causal message sequence charts (Q843103) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Bounded time-stamping in message-passing systems (Q1853588) (← 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)
- 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)
- Timed Semantics of Message Sequence Charts Based on Timed Automata (Q2842583) (← links)
- A Calculus of Global Interaction based on Session Types (Q2864218) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- Shared-Memory Systems and Charts (Q3007636) (← links)
- Distributed Asynchronous Automata (Q3184669) (← links)
- On Distributed Monitoring and Synthesis (Q3195680) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- Automated Synthesis of Distributed Controllers (Q3449462) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- MSO Logic for Unambiguous Shared-Memory Systems (Q3533037) (← links)
- Semantics of Deterministic Shared-Memory Systems (Q3541010) (← links)
- Mixing Lossy and Perfect Fifo Channels (Q3541029) (← links)
- UNAMBIGUOUS SHARED-MEMORY SYSTEMS (Q3586410) (← links)
- Realizability of Concurrent Recursive Programs (Q3617744) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- (Q5009419) (← links)
- Exhibition of a Structural Bug with Wings (Q5166768) (← links)
- Synthesis of Safe Message-Passing Systems (Q5458841) (← links)
- Automata and Logics for Timed Message Sequence Charts (Q5458842) (← links)
