A theory of name boundedness

DOI10.1007/978-3-642-40184-8_14MaRDI QIDQ2842106zbMATH OpenOpenAlexFDO

Authors Reiner Hüchting, Rupak Majumdar, Roland Meyer

Publication date 12 August 2013

Published in CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40184-8_14

Mathematics Subject Classification ID

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

Recommendations

• Bounds on mobility
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Accelerations for the coverability set of Petri nets with names
• Decidability and complexity of Petri nets with unordered data

Cited in

(10)

• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• On hierarchical communication topologies in the -calculus
• Freshness and Name-Restriction in Sets of Traces with Names
• Model checking Petri nets with names using data-centric dynamic systems
• Bounds on mobility
• Forward analysis of depth-bounded processes
• scientific article; zbMATH DE number 6174927 (Why is no real title available?)
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Multiset rewriting for the verification of depth-bounded processes with name binding
• On the rule of \(k\) names

This page was built for publication: A theory of name boundedness

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