Linearity and bisimulation

DOI10.1016/J.JLAP.2007.02.011MaRDI QIDQ997996zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cites work

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

Cited in

(8)

• Program equivalence in linear contexts
• Linear logic propositions as session types
• scientific article; zbMATH DE number 2087446 (Why is no real title available?)
• 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)