Linearity and bisimulation

DOI10.1016/J.JLAP.2007.02.011zbMATH Open1119.68131OpenAlexW1986229147MaRDI QIDQ997996FDOQ997996

Authors: Nobuko Yoshida, Kohei Honda, Martin Berger 

Publication date: 10 August 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2007.02.011

Recommendations

• scientific article; zbMATH DE number 2087446
• A theory of bisimulation for the \(\pi\)-calculus
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• Constructing weak simulations from linear implications for processes with private names
• Trustworthy Global Computing

zbMATH Keywords

\(\pi\)-calculusbisimulationlinearitysecure information flow analysistyped processes

Mathematics Subject Classification ID

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

Cites Work

• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Functions as processes
• Linear logic
• A calculus of mobile processes. II
• Title not available (Why is that?)
• On reduction-based process semantics
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Game-theoretic analysis of call-by-value computation
• The name discipline of uniform receptiveness
• Title not available (Why is that?)
• Small bisimulations for reasoning about higher-order imperative programs
• A per model of secure information flow in sequential programs
• Noninterference for concurrent programs and thread systems
• Title not available (Why is that?)
• A uniform type structure for secure information flow
• Title not available (Why is that?)
• On confluence in the \(\pi\)-calculus
• Typed behavioural equivalences for processes in the presence of subtyping
• Strong normalisation in the \(\pi\)-calculus
• Secrecy by typing in security protocols
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Software Science and Computational Structures
• Authentication primitives and their compilation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elementary structures in process theory (1): Sets with renaming
• Noninterference through flow analysis

Cited In (8)

• Program equivalence in linear contexts
• Linear logic propositions as session types
• Title not available (Why is that?)
• Trees from functions as processes
• Fairness and communication-based semantics for session-typed languages
• Linear logical relations and observational equivalences for session-based concurrency
• Hide and new in the \(\pi\)-calculus
• Constructing weak simulations from linear implications for processes with private names

This page was built for publication: Linearity and bisimulation

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