Relating state-based and process-based concurrency through linear logic

DOI10.1016/J.ENTCS.2006.05.043MaRDI QIDQ4917995zbMATH OpenOpenAlexFDO

Authors Iliano Cervesato, Andre Scedrov

Publication date 3 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2006.05.043

zbMATH Keywords

linear logicprocess algebramultiset rewriting

Mathematics Subject Classification ID

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

• Relating state-based and process-based concurrency through linear logic (full-version)
• From Petri nets to linear logic
• scientific article; zbMATH DE number 517089
• scientific article; zbMATH DE number 1361538
• scientific article; zbMATH DE number 125887

Cites work

• scientific article; zbMATH DE number 4209572 (Why is no real title available?)
• scientific article; zbMATH DE number 4028914 (Why is no real title available?)
• scientific article; zbMATH DE number 4069945 (Why is no real title available?)
• scientific article; zbMATH DE number 4103051 (Why is no real title available?)
• scientific article; zbMATH DE number 125887 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 1337887 (Why is no real title available?)
• scientific article; zbMATH DE number 515728 (Why is no real title available?)
• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 1531624 (Why is no real title available?)
• scientific article; zbMATH DE number 1746674 (Why is no real title available?)
• scientific article; zbMATH DE number 2090322 (Why is no real title available?)
• A categorical linear framework for Petri nets
• A proof search specification of the \(\pi\)-calculus
• A proof theory for generic judgments
• Communicating sequential processes
• Conditional rewriting logic as a unified model of concurrency
• Dynamic modification of system structures using LLPNs
• Encoding transition systems in sequent calculus
• Encryption as an abstract data-type (extended abstract)
• Forum: A multiple-conclusion specification logic
• From Petri nets to linear logic
• From Petri nets to linear logic
• Linear concurrent constraint programming: Operational and phase semantics
• Linear logic
• Linear logic as a logic of computations
• Logic programming in a fragment of intuitionistic linear logic
• Maude: specification and programming in rewriting logic
• On the \(\pi\)-calculus and linear logic
• Process realizability
• Proofs as processes
• The NRL Protocol Analyzer: An Overview
• The \(\pi\)-calculus: A theory of mobile processes
• Types for Proofs and Programs
• Uniform proofs as a foundation for logic programming

Cited in

(5)

• A language for the logical specification of processes and relations
• A new linear logic for deadlock-free session-typed processes
• Collaborative planning with confidentiality
• Relating state-based and process-based concurrency through linear logic (full-version)
• Linear logical relations and observational equivalences for session-based concurrency

Describes a project that uses

Uses Software

• Maude
• Pict
• NRL
• Lolli

This page was built for publication: Relating state-based and process-based concurrency through linear logic

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