Probabilistic Analysis of Binary Sessions

DOI10.4230/LIPIcs.CONCUR.2020.14MaRDI QIDQ5089279

Catia Trubiani, Luca Padovani, Hernán Melgratti, Omar Inverso, Emilio Tuosto

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2007.11832

zbMATH Keywords

static analysis; session types; deadlock freedom; probabilistic choices

Mathematics Subject Classification ID

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

Related Items

Interval probability for sessions types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic and prioritized models of timed CSP
• Fundamental properties of infinite trees
• A new linear logic for deadlock-free session-typed processes
• Verified tail bounds for randomized programs
• Testing preorders for probabilistic processes.
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
• Subtyping for session types in the pi calculus
• Probabilistic Termination
• Remarks on Testing Probabilistic Processes
• Probabilistic π-Calculus and Event Structures
• Probabilistic Termination by Monadic Affine Sized Typing
• Testing Finitary Probabilistic Processes
• Fair Termination for Parameterized Probabilistic Concurrent Systems
• A Probabilistic Applied Pi–Calculus
• The Pairing of Contracts and Session Types
• Introduction to Interval Analysis
• Deadlock and lock freedom in the linear π-calculus
• The Probabilistic Model Checking Landscape
• Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
• A deterministic rewrite system for the probabilistic λ-calculus
• Rate-Based Transition Systems for Stochastic Process Calculi
• Validation of Stochastic Systems
• Validation of Stochastic Systems
• Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems
• Fair Subtyping for Open Session Types
• Analysis of Probabilistic Basic Parallel Processes
• Distributing probability over non-determinism
• Fuzzy sets
• Using higher-order contracts to model session types
• Global progress for dynamically interleaved multiparty sessions
• Linear logic propositions as session types
• Fair subtyping for multi-party session types
• Manifest deadlock-freedom for shared session types