Pages that link to "Item:Q1183455"
From MaRDI portal
The following pages link to The synchronization problem in protocol testing and its complexity (Q1183455):
Displaying 13 items.
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Overcoming observability problems in distributed test architectures (Q844193) (← links)
- Distributed testing without encountering controllability and observability problems (Q1028999) (← links)
- Canonical finite state machines for distributed systems (Q1044846) (← links)
- On the complexity of generating synchronizable test sequences (Q1203646) (← links)
- Implementation relations and test generation for systems with distributed interfaces (Q1938358) (← links)
- Overcoming controllability problems in distributed testing from an input output transition system (Q1938361) (← links)
- Using schedulers to test probabilistic distributed systems (Q1941881) (← links)
- Synchronization paradigm for protocol testing under multiparty configuration (Q1963369) (← links)
- Timed implementation relations for the distributed test architecture (Q2251156) (← links)
- Checking sequences for distributed test architectures (Q2377256) (← links)
- The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs (Q2398505) (← links)
- Minimizing Coordination Channels in Distributed Testing (Q3613091) (← links)