On the public citation graph
Probabilistic simulations for probabilistic processes
0 signed · 496 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-50302-1_11openalex-snapshot
Reasoning about uncertainty in fault-tolerant distributed systems
inferredcites →https://doi.org/10.1007/3-540-54430-5_99openalex-snapshot
Simulations between specifications of distributed systems
inferredcites →https://doi.org/10.1007/3-540-57529-4_72openalex-snapshot
Time optimal self-stabilizing spanning tree algorithms
inferredcites →https://doi.org/10.1007/bf01843570openalex-snapshot
Verification of multiprocess probabilistic protocols
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(94)00286-0openalex-snapshot
Probabilistic communicating processes
inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot
Bisimulation through probabilistic testing
inferredcites →https://doi.org/10.1109/lics.1990.113740openalex-snapshot
Reactive, generative, and stratified models of probabilistic processes
inferredcites →https://doi.org/10.1109/lics.1991.151651openalex-snapshot
Specification and refinement of probabilistic processes
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1145/135419.135468openalex-snapshot
Randomized mutual exclusion algorithms revisited
inferredcites →https://doi.org/10.1145/197917.198117openalex-snapshot
Proving time bounds for randomized distributed algorithms
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.1145/800221.806707openalex-snapshot
Another advantage of free choice (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611012.ch8openalex-snapshot
Verification of Real‐Time Probabilistic Systems
inferred← citeshttps://doi.org/10.1002/9781118459898.ch7openalex-snapshot
Practical Applications of Probabilistic Model Checking to Communication Protocols
inferred← citeshttps://doi.org/10.1007/11513988_24openalex-snapshot
Improved Probabilistic Models for 802.11 Protocol Verification
inferred← citeshttps://doi.org/10.1007/11580850_9openalex-snapshot
A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange
inferred← citeshttps://doi.org/10.1007/11590156_44openalex-snapshot
On the Controller Synthesis for Finite-State Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/11601548_17openalex-snapshot
Compositional Reasoning for Probabilistic Finite-State Behaviors
inferred← citeshttps://doi.org/10.1007/11817949_22openalex-snapshot
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
inferred← citeshttps://doi.org/10.1007/11817949_27openalex-snapshot
Generic Forward and Backward Simulations
inferred← citeshttps://doi.org/10.1007/11817949_5openalex-snapshot
Probability and Nondeterminism in Operational Models of Concurrency
inferred← citeshttps://doi.org/10.1007/11817963_23openalex-snapshot
Symmetry Reduction for Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/11863908_15openalex-snapshot
A Formal Framework for Confidentiality-Preserving Refinement
inferred← citeshttps://doi.org/10.1007/11864219_17openalex-snapshot
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
inferred← citeshttps://doi.org/10.1007/11875567_11openalex-snapshot
Stepwise Development of Secure Systems
inferred← citeshttps://doi.org/10.1007/11881070_118openalex-snapshot
Simulation for Interactive Markov Chains
inferred← citeshttps://doi.org/10.1007/11901914_4openalex-snapshot
Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
inferred← citeshttps://doi.org/10.1007/11944836_29openalex-snapshot
On Reduction Criteria for Probabilistic Reward Models
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_25openalex-snapshot
Weak Bisimulation for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_11openalex-snapshot
General Distributions in Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_6openalex-snapshot
Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_67openalex-snapshot
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_38openalex-snapshot
A Testing Scenario for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_79openalex-snapshot
Discounting the Future in Systems Theory
inferred← citeshttps://doi.org/10.1007/3-540-45352-0_5openalex-snapshot
Decidable Model Checking of Probabilistic Hybrid Automata
inferred← citeshttps://doi.org/10.1007/3-540-45605-8_11openalex-snapshot
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
inferred← citeshttps://doi.org/10.1007/3-540-45605-8_3openalex-snapshot
Security Analysis of a Probabilistic Non-repudiation Protocol
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_23openalex-snapshot
Simulation for Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_24openalex-snapshot
Weak Bisimulation is Sound and Complete for PCTL*
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_25openalex-snapshot
Decision Algorithms for Probabilistic Bisimulation*
inferred← citeshttps://doi.org/10.1007/3-540-45739-9openalex-snapshot
Formal Techniques in Real-Time and Fault-Tolerant Systems
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_21openalex-snapshot
A Probabilistic Extension of UML Statecharts
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_1openalex-snapshot
Norm Functions for Probabilistic Bisimulations with Delays
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_10openalex-snapshot
Probabilistic Asynchronous π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_31openalex-snapshot
Axiomatizations for Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_1openalex-snapshot
Fully Abstract Characterization of Probabilistic May Testing
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_20openalex-snapshot
Compositional Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_17openalex-snapshot
A compositional trace-based semantics for probabilistic automata
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_62openalex-snapshot
Testing probabilistic automata
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_14openalex-snapshot
Weak bisimulation for fully probabilistic processes
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_1openalex-snapshot
Proving Performance Properties (even Probabilistic Ones)
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_12openalex-snapshot
An Algebraic Approach to the Specification of Stochastic Systems (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_18openalex-snapshot
Comparing CTL and PCTL on Labeled Markov Chains
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_15openalex-snapshot
Randomized Dining Philosophers without Fairness Assumption
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_44openalex-snapshot
A Randomized Distributed Encoding of the π-Calculus with Mixed Choice
inferred← citeshttps://doi.org/10.1007/978-3-030-20521-8_58openalex-snapshot
Security Testing for Multi-Agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-28423-7_7openalex-snapshot
Approximate Probabilistic Relations for Compositional Abstractions of Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_17openalex-snapshot
Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics
inferred← citeshttps://doi.org/10.1007/978-3-030-61362-4_14openalex-snapshot
Behavioral Specification Theories: An Algebraic Taxonomy
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_28openalex-snapshot
(Towards a) Statistical Probabilistic Lazy Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_14openalex-snapshot
Generalized Quantitative Analysis of Metric Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-05119-2_18openalex-snapshot
Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_10openalex-snapshot
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_3openalex-snapshot
Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_31openalex-snapshot
CEGAR for Qualitative Analysis of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11737-9_9openalex-snapshot
Modal Characterisations of Probabilistic and Fuzzy Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_11openalex-snapshot
Fast Debugging of PRISM Models
inferred← citeshttps://doi.org/10.1007/978-3-319-31559-1_8openalex-snapshot
PSTeC: A Location-Time Driven Modelling Formalism for Probabilistic Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-57685-5_3openalex-snapshot
Probabilistic Model Checking: Advances and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-60225-7_10openalex-snapshot
Weak Simulation Quasimetric in a Gossip Scenario
inferred← citeshttps://doi.org/10.1007/978-3-319-65765-3_10openalex-snapshot
Distribution-Based Bisimulation for Labelled Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_12openalex-snapshot
Trace Relations and Logical Preservation for Continuous-Time Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-74183-3_8openalex-snapshot
Using Runtime Quantitative Verification to Provide Assurance Evidence for Self-Adaptive Software
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_21openalex-snapshot
The 10,000 Facets of MDP Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-99154-2_21openalex-snapshot
A Hemimetric Extension of Simulation for Semi-Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_1openalex-snapshot
Probabilistic Automata: System Types, Parallel Composition and Comparison
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_11openalex-snapshot
Analysing Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_12openalex-snapshot
An Abstraction Framework for Mixed Non-deterministic and Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_3openalex-snapshot
An Overview of Probabilistic Process Algebras and Their Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_5openalex-snapshot
On Probabilistic Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_6openalex-snapshot
Model Checking for Probabilistic Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_13openalex-snapshot
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_9openalex-snapshot
Embedded Software Analysis with MOTOR
inferred← citeshttps://doi.org/10.1007/978-3-540-30233-9_12openalex-snapshot
Branching Time Equivalences for Interactive Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_16openalex-snapshot
Bounded Probabilistic Model Checking with the Murφ Verifier
inferred← citeshttps://doi.org/10.1007/978-3-540-31862-0_35openalex-snapshot
Switched Probabilistic I/O Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_18openalex-snapshot
Monte Carlo Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_7openalex-snapshot
Axiomatizations for Probabilistic Finite-State Behaviors
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_8openalex-snapshot
Stochastic Transition Systems for Continuous State Spaces and Non-determinism
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_24openalex-snapshot
Proving Positive Almost-Sure Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_34openalex-snapshot
Finite Horizon Analysis of Markov Chains with the Murϕ Verifier
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_9openalex-snapshot
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_14openalex-snapshot
Compositionality for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_23openalex-snapshot
Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_32openalex-snapshot
Comparative Branching-Time Semantics for Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_6openalex-snapshot
Finite Horizon Analysis of Stochastic Systems with the Murφ Verifier
inferred← citeshttps://doi.org/10.1007/978-3-540-45221-8_7openalex-snapshot
A QoS-Oriented Extension of UML Statecharts
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_6openalex-snapshot
All k-Bounded Policies Are Equivalent for Self-stabilization
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_18openalex-snapshot
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_3openalex-snapshot
An Experimental Evaluation of Probabilistic Simulation
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_14openalex-snapshot
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_15openalex-snapshot
Model Checking Probabilistic Timed Automata with One or Two Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_25openalex-snapshot
Scalar Outcomes Suffice for Finitary Probabilistic Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_26openalex-snapshot
Probabilistic Anonymity Via Coalgebraic Simulations
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_21openalex-snapshot
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_6openalex-snapshot
Stochastic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-72685-2_11openalex-snapshot
Theory and Practice of Probabilistic Timed Game for Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_38openalex-snapshot
Magnifying-Lens Abstraction for Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_66openalex-snapshot
Continuous Capacities on Continuous State Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_28openalex-snapshot
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_4openalex-snapshot
Making Random Choices Invisible to the Scheduler
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_16openalex-snapshot
Deciding Simulations on Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_12openalex-snapshot
A Probabilistic Applied Pi–Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_31openalex-snapshot
Compositional Methods for Information-Hiding
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_12openalex-snapshot
Conditional Probabilities over Probabilistic and Nondeterministic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_27openalex-snapshot
Non Expansive ε-Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_7openalex-snapshot
Generating Compact MTBDD-Representations from Probmela Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_12openalex-snapshot
Modeling Computational Security in Long-Lived Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_22openalex-snapshot
A Space-Efficient Probabilistic Simulation Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_10openalex-snapshot
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-01702-5_15openalex-snapshot
Significant Diagnostic Counterexamples in Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-02053-7_15openalex-snapshot
A Process Algebra Approach to Fuzzy Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-03741-2_11openalex-snapshot
Approximating Labelled Markov Processes Again!
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_11openalex-snapshot
Deriving Syntax and Axioms for Quantitative Regular Behaviours
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_20openalex-snapshot
A Demonic Approach to Information in Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_16openalex-snapshot
Compositional Abstraction for Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_30openalex-snapshot
Unifying Probability with Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-642-10373-5_10openalex-snapshot
A Statistical Approach to Test Stochastic and Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_3openalex-snapshot
Assume-Guarantee Verification for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_21openalex-snapshot
Safety Verification for Probabilistic Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_5openalex-snapshot
Safe Equivalences for Security Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_6openalex-snapshot
On Probabilistic Alternating Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_7openalex-snapshot
Probabilistic Mobility Models for Mobile and Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_17openalex-snapshot
Simulation and Bisimulation for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_3openalex-snapshot
Concurrency and Composition in a Stochastic World
inferred← citeshttps://doi.org/10.1007/978-3-642-16074-5_2openalex-snapshot
Reasoning about Probabilistic Security Using Task-PIOAs
inferred← citeshttps://doi.org/10.1007/978-3-642-16265-7_20openalex-snapshot
Towards Probabilistic Modelling in Event-B
inferred← citeshttps://doi.org/10.1007/978-3-642-19811-3_2openalex-snapshot
Automated Learning of Probabilistic Assumptions for Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_29openalex-snapshot
Confluence Reduction for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_21openalex-snapshot
Decision Problems for Interval Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-21455-4_3openalex-snapshot
Automated Verification Techniques for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21713-5_23openalex-snapshot
A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_23openalex-snapshot
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_24openalex-snapshot
On the Semantics of Markov Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_8openalex-snapshot
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_9openalex-snapshot
A Spectrum of Behavioral Relations over LTSs on Probability Distributions
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_35openalex-snapshot
An Algorithm for Probabilistic Alternating Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_26openalex-snapshot
A General Framework for Probabilistic Characterizing Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-30793-5_9openalex-snapshot
Modelling Probabilistic Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_25openalex-snapshot
Assume-Guarantee Abstraction Refinement for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_23openalex-snapshot
Computing Game Metrics on Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_7openalex-snapshot
Trace Semantics via Determinization
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_28openalex-snapshot
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_23openalex-snapshot
Compositional Abstraction Techniques for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_24openalex-snapshot
Broadcast Abstraction in a Stochastic Calculus for Mobile Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_7openalex-snapshot
Weak Bisimulations for Coalgebras over Ordered Functors
inferred← citeshttps://doi.org/10.1007/978-3-642-34059-8_16openalex-snapshot
Compositional Reverification of Probabilistic Safety Properties for Large-Scale Complex IT Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_11openalex-snapshot
Stuttering for Abstract Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-35743-5_3openalex-snapshot
A Denotational Model for Component-Based Risk Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_2openalex-snapshot
The Quest for Minimal Quotients for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_23openalex-snapshot
Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_1openalex-snapshot
Stochastic Pi-calculus Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_3openalex-snapshot
Refinement and Difference for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_4openalex-snapshot
High-Level Counterexamples for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-40480-1_16openalex-snapshot
Towards Many Gestures to One Command: A User Study for Tabletops
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_6openalex-snapshot
Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_22openalex-snapshot
Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_7openalex-snapshot
Specification Theories for Probabilistic and Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_10openalex-snapshot
Probabilistic Model Checking: Formalisms and Algorithms for Discrete and Real-time Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_17openalex-snapshot
Coalgebraic Weak Bisimulation from Recursive Equations over Monads
inferred← citeshttps://doi.org/10.1007/978-3-662-44124-4_5openalex-snapshot
On Coalgebras with Internal Moves
inferred← citeshttps://doi.org/10.1007/978-3-662-44124-4_6openalex-snapshot
A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_18openalex-snapshot
Probabilistic Bisimulation: Naturally on Distributions
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_21openalex-snapshot
Towards a Coalgebraic Chomsky Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3_2openalex-snapshot
A Tutorial on Interactive Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3_4openalex-snapshot
On Abstraction of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3_5openalex-snapshot
Computing Behavioral Relations for Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-46734-3_5openalex-snapshot
Probabilistic Model Checking for Feature-Oriented Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_17openalex-snapshot
Reward-Bounded Reachability Probability for Uncertain Weighted MDPs
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_19openalex-snapshot
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
inferred← citeshttps://doi.org/10.1007/bfb0027243openalex-snapshot
Proving safety properties of the steam boiler controller
inferred← citeshttps://doi.org/10.1007/bfb0055637openalex-snapshot
Probabilistic resource failure in real-time process algebra
inferred← citeshttps://doi.org/10.1007/s00165-012-0231-xopenalex-snapshot
Layered reasoning for randomized distributed algorithms
inferred← citeshttps://doi.org/10.1007/s00165-012-0242-7openalex-snapshot
Exploring probabilistic bisimulations, part I
inferred← citeshttps://doi.org/10.1007/s00165-012-0244-5openalex-snapshot
Using schedulers to test probabilistic distributed systems
inferred← citeshttps://doi.org/10.1007/s00165-014-0305-zopenalex-snapshot
Integrating stochastic reasoning into Event-B development
inferred← citeshttps://doi.org/10.1007/s00165-016-0356-4openalex-snapshot
Deciding probabilistic automata weak bisimulation: theory and practice
inferred← citeshttps://doi.org/10.1007/s00165-021-00536-5openalex-snapshot
L∗-based learning of Markov decision processes (extended version)
inferred← citeshttps://doi.org/10.1007/s001650300007openalex-snapshot
Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol
inferred← citeshttps://doi.org/10.1007/s001650300009openalex-snapshot
Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol
inferred← citeshttps://doi.org/10.1007/s00236-007-0052-1openalex-snapshot
Distributed Consensus, revisited
inferred← citeshttps://doi.org/10.1007/s00236-007-0066-8openalex-snapshot
Deciding probabilistic bisimilarity over infinite-state probabilistic systems
inferred← citeshttps://doi.org/10.1007/s00446-003-0102-zopenalex-snapshot
Randomized dining philosophers without fairness assumption
inferred← citeshttps://doi.org/10.1007/s10009-003-0118-5openalex-snapshot
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM
inferred← citeshttps://doi.org/10.1007/s10009-005-0216-7openalex-snapshot
Finite horizon analysis of Markov Chains with the Murϕ verifier
inferred← citeshttps://doi.org/10.1007/s10009-014-0344-zopenalex-snapshot
Approximate planning and verification for large Markov decision processes
inferred← citeshttps://doi.org/10.1007/s10009-021-00633-zopenalex-snapshot
The probabilistic model checker Storm
inferred← citeshttps://doi.org/10.1007/s10207-007-0050-xopenalex-snapshot
Estimating the maximum information leakage
inferred← citeshttps://doi.org/10.1007/s10270-021-00916-8openalex-snapshot
Probabilistic modelling and verification using RoboChart and PRISM
inferred← citeshttps://doi.org/10.1007/s10626-007-0032-1openalex-snapshot
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
inferred← citeshttps://doi.org/10.1007/s10703-006-0005-2openalex-snapshot
Performance analysis of probabilistic timed automata using digital clocks
inferred← citeshttps://doi.org/10.1007/s10703-012-0147-3openalex-snapshot
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
inferred← citeshttps://doi.org/10.1007/s10703-012-0167-zopenalex-snapshot
A compositional modelling and analysis framework for stochastic hybrid systems
inferred← citeshttps://doi.org/10.1007/s10703-012-0177-xopenalex-snapshot
Model checking for probabilistic timed automata
showing the first 200 of 477 · page through all 477
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.