On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus

DOI10.1016/J.TCS.2015.11.033zbMath1333.68197OpenAlexW2182201061MaRDI QIDQ896922

Pascal Lafourcade, Jannik Dreier, Cristian Ene, Yassine Lakhneche

Publication date: 15 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.033

zbMATH Keywords

normal formcancellationword problemdecidabilityequational theoryprocess calculusbehavioral equivalenceunique decompositionweak bisimilarityapplied \(\pi\)-calculusstrong bisimilarity

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Deciding equivalence-based properties using constraint solving
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• A calculus of mobile processes. I
• Unique decomposition of processes
• A complete symbolic bisimulation for full applied pi calculus
• Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
• Decoding choice encodings
• Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
• Proof System for Applied Pi Calculus
• On Bisimilarity and Substitution in Presence of Replication
• THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE
• On Unique Decomposition of Processes in the Applied π-Calculus
• Mobile values, new names, and secure communication
• A variant of a recursively unsolvable problem

This page was built for publication: On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus