scientific article; zbMATH DE number 794262
From MaRDI portal
Publication:4847023
zbMath0839.68067MaRDI QIDQ4847023
Roberto Segala, Nancy A. Lynch
Publication date: 28 May 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey, Approximating Labelled Markov Processes Again!, Deciding probabilistic automata weak bisimulation: theory and practice, An Algorithm for Probabilistic Alternating Simulation, A General Framework for Probabilistic Characterizing Formulae, A space-efficient simulation algorithm on probabilistic automata, Probabilistic and nondeterministic aspects of anonymity, Model Checking Probabilistic Systems, State explosion in almost-sure probabilistic reachability, Deriving Syntax and Axioms for Quantitative Regular Behaviours, A Demonic Approach to Information in Probabilistic Systems, Performance analysis of probabilistic timed automata using digital clocks, Switched PIOA: parallel composition via distributed scheduling, Comparative branching-time semantics for Markov chains, Probable innocence revisited, Behavioural equivalences of a probabilistic pi-calculus, Compositional abstraction-based synthesis for networks of stochastic switched systems, A Tutorial on Interactive Markov Chains, On Abstraction of Probabilistic Systems, Computing Behavioral Relations for Probabilistic Concurrent Systems, Compositional abstraction of large-scale stochastic systems: a relaxed dissipativity approach, SOS specifications for uniformly continuous operators, Compositional probabilistic verification through multi-objective model checking, Abstract probabilistic automata, Reduction semantics in Markovian process algebra, Safety verification for probabilistic hybrid systems, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions, Finite axiomatization for symbolic probabilistic \(\pi \)-calculus, Behavioural equivalences for coalgebras with unobservable moves, Algebraic theory of probabilistic and nondeterministic processes., Layered reasoning for randomized distributed algorithms, Using schedulers to test probabilistic distributed systems, Exploring probabilistic bisimulations. I, Measurable stochastics for Brane calculus, Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems, Integrating stochastic reasoning into Event-B development, Verification and control of partially observable probabilistic systems, Stuttering for abstract probabilistic automata, Compositional bisimulation metric reasoning with Probabilistic Process Calculi, Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings, Generic properties of subgroups of free groups and finite presentations, Unnamed Item, Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation, The infinite evolution mechanism of \(\epsilon\)-bisimilarity, On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context, Distributed consensus, revisited, Verification and control for probabilistic hybrid automata with finite bisimulations, Confluence Reduction for Probabilistic Systems, Probabilistic bisimulations for quantum processes, A framework for analyzing probabilistic protocols and its application to the partial secrets exchange, The reactive simulatability (RSIM) framework for asynchronous systems, Polynomial time decision algorithms for probabilistic automata, \(L^\ast\)-based learning of Markov decision processes (extended version), Probabilistic rely-guarantee calculus, Structural operational semantics for non-deterministic processes with quantitative aspects, Task-structured probabilistic I/O automata, Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation, On the Semantics of Markov Automata, Logical characterizations of simulation and bisimulation for fuzzy transition systems, The metric linear-time branching-time spectrum on nondeterministic probabilistic processes, Quantitative model-checking of controlled discrete-time Markov processes, Model checking for probabilistic timed automata, A compositional modelling and analysis framework for stochastic hybrid systems, Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states, Quantitative Kleene coalgebras, Preservation of probabilistic information flow under refinement, Deciding probabilistic bisimilarity over infinite-state probabilistic systems, Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes, Unifying simulatability definitions in cryptographic systems under different timing assumptions, Information hiding in probabilistic concurrent systems, A hierarchy of probabilistic system types, Probabilistic anonymity via coalgebraic simulations, Branching bisimulation for probabilistic systems: characteristics and decidability, A randomized encoding of the \(\pi\)-calculus with mixed choice, Weak bisimulation is sound and complete for pCTL\(^*\), Measuring the confinement of probabilistic systems, Making random choices invisible to the scheduler, A modular approach to defining and characterising notions of simulation, Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems, Logical characterization of branching metrics for nondeterministic probabilistic transition systems, The quest for minimal quotients for probabilistic and Markov automata, Probabilistic NetKAT, Probabilistic mobile ambients, Abstract Probabilistic Automata, CEGAR for compositional analysis of qualitative properties in Markov decision processes, Analyzing security protocols using time-bounded task-PIOAs, Bisimulations Meet PCTL Equivalences for Probabilistic Automata, A Spectrum of Behavioral Relations over LTSs on Probability Distributions, Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations, Probabilistic model of software approximate correctness, Branching bisimulation congruence for probabilistic systems, Probabilistic temporal logics via the modal mu-calculus, A theory of stochastic systems. I: Stochastic automata, Automated verification and synthesis of stochastic hybrid systems: a survey, Weak Probabilistic Anonymity, Probabilistic π-Calculus and Event Structures, Testing preorders for probabilistic processes can be characterized by simulations, Automatic verification of real-time systems with discrete probability distributions., A process algebra for probabilistic and nondeterministic processes, Stepwise refinement of sequence diagrams with soft real-time constraints, Stuttering for Abstract Probabilistic Automata, Symbolic model checking for probabilistic processes, Unnamed Item, Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement, A Probabilistic Applied Pi–Calculus, Interval probability for sessions types, Testing probabilistic automata, A Hemimetric Extension of Simulation for Semi-Markov Decision Processes, A basic compositional model for spiking neural networks, Back to the format: a survey on SOS for probabilistic processes, Deciding Simulations on Probabilistic Automata, Probabilistic CEGAR, Unnamed Item, Unnamed Item, Unnamed Item, A Space-Efficient Probabilistic Simulation Algorithm, Branching Bisimulation Congruence for Probabilistic Systems, The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata, Specification Theories for Probabilistic and Real-Time Systems, Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract), Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey, Unnamed Item, On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems, Unnamed Item, Unnamed Item, Process algebra for performance evaluation, Conditional Probabilities over Probabilistic and Nondeterministic Systems, Compositional Methods for Information-Hiding, Unnamed Item, Termination in Convex Sets of Distributions, Probabilistic Analysis of Binary Sessions, CoLoSS: The Coalgebraic Logic Satisfiability Solver, Compositional Abstraction for Stochastic Systems, Unnamed Item
