A Spectrum of Behavioral Relations over LTSs on Probability Distributions

DOI10.1007/978-3-642-23217-6_9zbMath1344.68162MaRDI QIDQ3090826

Silvia Crafa, Francesco Ranzato

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_9

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes, Trace semantics via determinization, Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logical characterization
• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
• Grammar Analysis and Parsing by Abstract Interpretation
• Characterising Testing Preorders for Finite Probabilistic Processes
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Characterising Probabilistic Processes Logically
• Systematic design of program transformation frameworks by abstract interpretation
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems