Pages that link to "Item:Q5111454"
From MaRDI portal
The following pages link to Synchronizability of communicating finite state machines is not decidable (Q5111454):
Displaying 14 items.
- On deciding synchronizability for asynchronously communicating systems (Q344799) (← links)
- Guessing the buffer bound for k-synchronizability (Q2117668) (← links)
- Automatic analysis of complex interactions in microservice systems (Q2175983) (← links)
- On the \(k\)-synchronizability of systems (Q2200819) (← links)
- Input urgent semantics for asynchronous timed session types (Q2329441) (← links)
- Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
- Event-B-Supported Choreography-Defined Communicating Systems (Q5040369) (← links)
- (Q5129947) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
- Guessing the Buffer Bound for k-Synchronizability (Q6070755) (← links)
- Branching pomsets: design, expressiveness and applications to choreographies (Q6151606) (← links)
- A formal theory of choreographic programming (Q6161233) (← links)
- Weakly synchronous systems with three machines are Turing powerful (Q6623012) (← links)
- Towards generalised half-duplex systems (Q6649540) (← links)