Pages that link to "Item:Q2864525"
From MaRDI portal
The following pages link to Proving approximate implementations for probabilistic I/O automata (Q2864525):
Displaying 6 items.
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- Stuttering for abstract probabilistic automata (Q2436515) (← links)
- Semantic Analysis of Gossip Protocols for Wireless Sensor Networks (Q3090828) (← links)
- Stuttering for Abstract Probabilistic Automata (Q3455842) (← links)
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms (Q5175774) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900566) (← links)