Composition and behaviors of probabilistic I/O automata
From MaRDI portal
Publication:1392272
DOI10.1016/S0304-3975(97)00056-XzbMath0903.68123OpenAlexW1974090207MaRDI QIDQ1392272
Eugene W. Stark, Scott A. Smolka, Sue-Hwey Wu
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00056-x
Related Items
Categorical foundations for randomly timed automata, Generalized interface automata with multicast synchronization, Weighted Bisimulation in Linear Algebraic Form, Modeling Radio Networks, Metrics for labelled Markov processes, Parametric probabilistic transition systems for system design and analysis, Approximating labelled Markov processes, Algebraic theory of probabilistic processes., Using schedulers to test probabilistic distributed systems, Probabilistic may/must testing: retaining probabilities by restricted schedulers, The design of novel distributed protocols from differential equations, Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms, Modeling radio networks, Distributed consensus, revisited, The reactive simulatability (RSIM) framework for asynchronous systems, Unifying simulatability definitions in cryptographic systems under different timing assumptions, Process algebra for performance evaluation, Distributed Synthesis in Continuous Time, Performance measure sensitive congruences for Markovian process algebras, Discrete time generative-reactive probabilistic processes with different advancing speeds, Testing preorders for probabilistic processes., Testing preorders for probabilistic processes can be characterized by simulations, Additive models of probabilistic processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulation through probabilistic testing
- Testing equivalences for processes
- Testing preorders for probabilistic processes.
- The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
- Probabilistic automata
- Hierarchical reasoning in probabilistic CSP
