Relating State-Based and Process-Based Concurrency through Linear Logic

DOI10.1016/j.entcs.2006.05.043zbMath1262.68136OpenAlexW2086165437MaRDI QIDQ4917995

Iliano Cervesato, Andrej 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

process algebralinear logicmultiset rewriting

Mathematics Subject Classification ID

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

Related Items

Collaborative planning with confidentiality

Uses Software

• Maude
• Pict
• NRL
• Lolli

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Forum: A multiple-conclusion specification logic
• Conditional rewriting logic as a unified model of concurrency
• Linear logic as a logic of computations
• Logic programming in a fragment of intuitionistic linear logic
• Proofs as processes
• On the \(\pi\)-calculus and linear logic
• Encoding transition systems in sequent calculus
• Maude: specification and programming in rewriting logic
• Linear concurrent constraint programming: Operational and phase semantics
• A categorical linear framework for Petri nets
• Uniform proofs as a foundation for logic programming
• The NRL Protocol Analyzer: An Overview
• Communicating sequential processes
• From Petri nets to linear logic
• Encryption as an abstract data-type
• From petri nets to linear logic
• A proof theory for generic judgments
• Types for Proofs and Programs
• Perspectives of System Informatics