Pages that link to "Item:Q1392272"
From MaRDI portal
The following pages link to Composition and behaviors of probabilistic I/O automata (Q1392272):
Displaying 23 items.
- Metrics for labelled Markov processes (Q596029) (← links)
- Modeling radio networks (Q661053) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- Additive models of probabilistic processes (Q1607220) (← links)
- Generalized interface automata with multicast synchronization (Q1633060) (← links)
- Performance measure sensitive congruences for Markovian process algebras (Q1853585) (← links)
- Discrete time generative-reactive probabilistic processes with different advancing speeds (Q1853593) (← links)
- Testing preorders for probabilistic processes. (Q1854314) (← links)
- Categorical foundations for randomly timed automata (Q1884891) (← links)
- Using schedulers to test probabilistic distributed systems (Q1941881) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- The design of novel distributed protocols from differential equations (Q1954235) (← links)
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms (Q2453112) (← links)
- Distributed consensus, revisited (Q2458442) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Distributed Synthesis in Continuous Time (Q2811352) (← links)
- Weighted Bisimulation in Linear Algebraic Form (Q3184672) (← links)
- Modeling Radio Networks (Q3184694) (← links)
- Process algebra for performance evaluation (Q5958464) (← links)
