Reactive, generative, and stratified models of probabilistic processes
From MaRDI portal
Publication:1898113
DOI10.1006/inco.1995.1123zbMath0832.68042OpenAlexW2135657750MaRDI QIDQ1898113
Bernhard Steffen, Scott A. Smolka, Robert J. van Glabbeek
Publication date: 20 September 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/2019
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items (94)
Refinement-oriented probability for CSP ⋮ Model independent approach to probabilistic models ⋮ A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Specification, testing and implementation relations for symbolic-probabilistic systems ⋮ Paracategories. II: Adjunctions, fibrations and examples from probabilistic automata theory ⋮ Performance analysis of concurrent systems in algebra dtsiPBC ⋮ Non-bisimulation-based Markovian behavioral equivalences ⋮ A general SOS theory for the specification of probabilistic transition systems ⋮ Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC ⋮ Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Bisimulation as a logical relation ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers ⋮ Switched PIOA: parallel composition via distributed scheduling ⋮ Comparative branching-time semantics for Markov chains ⋮ Metrics for labelled Markov processes ⋮ Quantitative analysis of software approximate correctness ⋮ Behavioural equivalences of a probabilistic pi-calculus ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ SOS formats and meta-theory: 20 years after ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Characteristic invariants in Hennessy-Milner logic ⋮ Determining asynchronous test equivalence for probabilistic processes ⋮ Finite axiomatization for symbolic probabilistic \(\pi \)-calculus ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Approximating labelled Markov processes ⋮ Algebraic theory of probabilistic and nondeterministic processes. ⋮ Algebraic theory of probabilistic processes. ⋮ A framework to measure the robustness of programs in the unpredictable environment ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Using schedulers to test probabilistic distributed systems ⋮ Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Coalgebraic trace semantics via forgetful logics ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ Bisimulation for probabilistic transition systems: A coalgebraic approach ⋮ The infinite evolution mechanism of \(\epsilon\)-bisimilarity ⋮ From Gene Regulation to Stochastic Fusion ⋮ Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms ⋮ Constructive logical characterizations of bisimilarity for reactive probabilistic systems ⋮ The compositional construction of Markov processes II ⋮ Probabilistic communicating processes ⋮ Modular construction of complete coalgebraic logics ⋮ VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC ⋮ A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols ⋮ Quantitative Kleene coalgebras ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ Linear Structures for Concurrency in Probabilistic Programming Languages ⋮ Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems ⋮ Equivalence relations for modular performance evaluation in dtsPBC ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ On metrics for probabilistic systems: definitions and algorithms ⋮ A hierarchy of probabilistic system types ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders ⋮ A behavioural pseudometric for probabilistic transition systems ⋮ Corrigendum to ``A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets ⋮ Measuring the confinement of probabilistic systems ⋮ A modular approach to defining and characterising notions of simulation ⋮ Process algebra for performance evaluation ⋮ Tempus fugit: How to plug it ⋮ Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems ⋮ Testing from a stochastic timed system with a fault model ⋮ A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems ⋮ Unnamed Item ⋮ Probabilistic mobile ambients ⋮ Weighted versus Probabilistic Logics ⋮ Priority as extremal probability ⋮ Probabilistic model of software approximate correctness ⋮ Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations ⋮ GSOS for probabilistic transition systems ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity ⋮ Universal coalgebra: A theory of systems ⋮ \(\pi\)-calculus with noisy channels ⋮ Non Expansive ε-Bisimulations ⋮ Bisimulation for probabilistic transition systems: A coalgebraic approach ⋮ A theory of stochastic systems. I: Stochastic automata ⋮ Quantitative information in the tuple space coordination model ⋮ Performance measure sensitive congruences for Markovian process algebras ⋮ Discrete time generative-reactive probabilistic processes with different advancing speeds ⋮ Testing preorders for probabilistic processes. ⋮ Language-based performance prediction for distributed and mobile systems ⋮ On the verification of qualitative properties of probabilistic processes under fairness constraints. ⋮ Notes on Generative Probabilistic Bisimulation ⋮ Bisimulation and Simulation Relations for Markov Chains ⋮ Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity ⋮ On Probabilistic Techniques for Data Flow Analysis ⋮ A process algebra for probabilistic and nondeterministic processes ⋮ Additive models of probabilistic processes ⋮ How adaptive and reliable is your program?
This page was built for publication: Reactive, generative, and stratified models of probabilistic processes
