Probabilistic Analysis of Binary Sessions

DOI10.4230/LIPICS.CONCUR.2020.14MaRDI QIDQ5089279zbMATH OpenOpenAlexFDO

Authors Omar Inverso, Hernan Melgratti, Luca Padovani, Catia Trubiani, Emilio Tuosto

Publication date 18 July 2022

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

zbMATH Keywords

session typesstatic analysisdeadlock freedomprobabilistic choices

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 1512615 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 1398002 (Why is no real title available?)
• scientific article; zbMATH DE number 1418454 (Why is no real title available?)
• scientific article; zbMATH DE number 7147446 (Why is no real title available?)
• A Probabilistic Applied Pi–Calculus
• A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
• A new linear logic for deadlock-free session-typed processes
• Analysis of probabilistic basic parallel processes
• Deadlock and lock freedom in the linear -calculus
• Distributing probability over non-determinism
• Fair subtyping for multi-party session types
• Fair subtyping for open session types
• Fair termination for parameterized probabilistic concurrent systems
• Fundamental properties of infinite trees
• Fuzzy sets
• Global progress for dynamically interleaved multiparty sessions
• Information-gap decision theory. Decisions under severe uncertainty
• Introduction to Interval Analysis
• Linear logic propositions as session types
• Manifest deadlock-freedom for shared session types
• Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
• Probabilistic -calculus and event structures
• Probabilistic and prioritized models of timed CSP
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Probabilistic termination by monadic affine sized typing
• Probabilistic termination: soundness, completeness, and compositionality
• Rate-Based Transition Systems for Stochastic Process Calculi
• Remarks on testing probabilistic processes
• Subtyping for session types in the pi calculus
• Taming confusion for modeling and implementing probabilistic concurrent systems
• Testing Finitary Probabilistic Processes
• Testing preorders for probabilistic processes.
• The Pairing of Contracts and Session Types
• The probabilistic model checking landscape
• True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
• Types and programing languages
• Using higher-order contracts to model session types
• Validation of Stochastic Systems
• Validation of Stochastic Systems
• Verified tail bounds for randomized programs

Cited in

(1)

• Interval probability for sessions types

This page was built for publication: Probabilistic Analysis of Binary Sessions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089279)