On the existence and decidability of unique decompositions of processes in the applied -calculus
DOI10.1016/J.TCS.2015.11.033zbMATH Open1333.68197OpenAlexW2182201061MaRDI QIDQ896922FDOQ896922
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
Recommendations
normal formcancellationdecidabilityword problemprocess calculusbehavioral equivalenceequational theoryunique decompositionapplied \(\pi\)-calculusstrong bisimilarityweak bisimilarity
Cites Work
- Title not available (Why is that?)
- A calculus of mobile processes. I
- Mobile values, new names, and secure communication
- A variant of a recursively unsolvable problem
- Proof system for applied pi calculus
- Deciding equivalence-based properties using constraint solving
- Decoding choice encodings
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Unique decomposition of processes
- A complete symbolic bisimulation for full applied pi calculus
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
- Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
- 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
Cited In (5)
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)