scientific article; zbMATH DE number 7559289
From MaRDI portal
Publication:5089025
DOI10.4230/LIPIcs.FSCD.2019.23MaRDI QIDQ5089025
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
An Analytic Propositional Proof System on Graphs ⋮ On counting propositional logic and Wagner's hierarchy ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Linear logic
- Nominal abstraction
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Bisimulation through probabilistic testing
- A calculus of mobile processes. I
- Nominal logic, a first order theory of names and binding
- True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
- Probabilistic operational semantics for the lambda calculus
- A system of interaction and structure IV
- A system of interaction and structure V: the exponentials and splitting
- Behavioural Analysis of Sessions Using the Calculus of Structures
- Normalisation Control in Deep Inference via Atomic Flows
- Characterising Testing Preorders for Finite Probabilistic Processes
- Semantics for Specialising Attack Trees based on Linear Logic
- The Consistency and Complexity of Multiplicative Additive System Virtual
- Abstraction, Refinement and Proof for Probabilistic Systems
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic
- Constructing weak simulations from linear implications for processes with private names
- A system of interaction and structure
- CONCUR 2004 - Concurrency Theory
- The geometry of parallelism: classical, probabilistic, and quantum effects
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Distributing probability over non-determinism
- Semantics of Probabilistic Processes
- Probabilistic game semantics
- A deep inference system with a self-dual binder which is complete for linear lambda calculus
- Refinement of actions and equivalence notions for concurrent systems
This page was built for publication: