Constructing weak simulations from linear implications for processes with private names

DOI10.1017/S0960129518000452MaRDI QIDQ5236556zbMATH OpenOpenAlexFDO

Authors Ross Horne, Alwen Tiu

Publication date 9 October 2019

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129518000452

zbMATH Keywords

bisimulationlinear logicprocess algebraproof theory

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Linearity and bisimulation
• scientific article; zbMATH DE number 2087446
• scientific article; zbMATH DE number 6851953
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• On the \(\pi\)-calculus and linear logic

Cites work

• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• A calculus of mobile processes. II
• A characterisation of open bisimilarity using an intuitionistic modal logic
• A deep inference system with a self-dual binder which is complete for linear lambda calculus
• A Local System for Classical Logic
• A proof theory for generic judgments
• A system of interaction and structure
• A System of Interaction and Structure II: The Need for Deep Inference
• A system of interaction and structure. IV: The exponentials and decomposition
• A system of interaction and structure. V: The exponentials and splitting
• A theory of bisimulation for the -calculus
• Behavioural analysis of sessions using the calculus of structures
• Characterising Testing Preorders for Finite Probabilistic Processes
• De Morgan dual nominal quantifiers modelling private names in non-commutative logic
• Encoding transition systems in sequent calculus
• Formalising the pi-calculus using nominal logic
• scientific article; zbMATH DE number 2185722 (Why is no real title available?)
• scientific article; zbMATH DE number 4030999 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 6851953 (Why is no real title available?)
• scientific article; zbMATH DE number 1841813 (Why is no real title available?)
• scientific article; zbMATH DE number 2090535 (Why is no real title available?)
• Linear logic
• Linear logic propositions as session types
• Logic Programming with Focusing Proofs in Linear Logic
• Models for concurrency: Towards a classification
• Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
• Mutually testing processes (extended abstract)
• Nominal abstraction
• Nominal logic, a first order theory of names and binding
• On the \(\pi\)-calculus and linear logic
• Proof search specifications of bisimulation and modal logics for the \({\pi}\)-calculus
• Proofs as processes
• Refinement of actions and equivalence notions for concurrent systems
• Semantics for specialising attack trees based on linear logic
• The consistency and complexity of multiplicative additive system virtual
• The equational theory of pomsets
• The focused calculus of structures
• Uniform proofs as a foundation for logic programming

Cited in

(5)

• An Analytic Propositional Proof System on Graphs
• The sub-additives: a proof theory for probabilistic choice extending linear logic
• scientific article; zbMATH DE number 7559468 (Why is no real title available?)
• A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
• Linearity and bisimulation

This page was built for publication: Constructing weak simulations from linear implications for processes with private names

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