Pages that link to "Item:Q2496297"
From MaRDI portal
The following pages link to A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297):
Displayed 24 items.
- A quadratic construction for Zielonka automata with acyclic communication structure (Q407518) (← links)
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- Diagnosis from scenarios (Q481349) (← 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)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Fair refinement for asynchronous session types (Q2233400) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- Verification of Parameterized Communicating Automata via Split-Width (Q2811340) (← links)
- Quantitative Analysis of Communication Scenarios (Q2945583) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- (Q3130542) (← 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)
- Realizability of Concurrent Recursive Programs (Q3617744) (← links)
- (Q5009419) (← links)
- (Q5111454) (← 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)
