On the existence and decidability of unique decompositions of processes in the applied -calculus

DOI10.1016/J.TCS.2015.11.033MaRDI QIDQ896922zbMATH OpenOpenAlexFDO

Authors Jannik Dreier, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech

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 formcancellationdecidabilityword problemprocess calculusbehavioral equivalenceequational theoryunique decompositionapplied \(\pi\)-calculusstrong bisimilarityweak bisimilarity

Mathematics Subject Classification ID

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

Recommendations

• On unique decomposition of processes in the applied \(\pi\)-calculus
• Unique parallel decomposition for the \(\pi\)-calculus
• Unique decomposition of processes
• Effective decomposability of sequential behaviours
• scientific article; zbMATH DE number 4777

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A calculus of mobile processes. I
• A complete symbolic bisimulation for full applied pi calculus
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• A variant of a recursively unsolvable problem
• Deciding equivalence-based properties using constraint solving
• Decoding choice encodings
• Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
• Mobile values, new names, and secure communication
• On Bisimilarity and Substitution in Presence of Replication
• On unique decomposition of processes in the applied \(\pi\)-calculus
• Proof system for applied pi calculus
• THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE
• Unique decomposition of processes
• Unique parallel decomposition in branching and weak bisimulation semantics

Cited in

(8)

• Mathematical Foundations of Computer Science 2003
• Unique parallel decomposition in branching and weak bisimulation semantics
• Unique parallel decomposition in branching and weak bisimulation semantics
• Unique decomposition of processes
• Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
• A geometric approach to the problem of unique decomposition of processes
• On unique decomposition of processes in the applied \(\pi\)-calculus
• Unique parallel decomposition for the \(\pi\)-calculus

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

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