The following pages link to Unique decomposition of processes (Q1208422):
Displaying 21 items.
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- Effective decomposability of sequential behaviours (Q1575536) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic (Q1781996) (← links)
- Timing and causality in process algebra (Q1924998) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- HOCore in Coq (Q2945640) (← links)
- (Q3385650) (← links)
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674) (← links)
- (Q5015359) (← links)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- How to Parallelize sequential processes (Q6044125) (← links)
- Compositional learning for interleaving parallel automata (Q6091209) (← links)
- Infinite results (Q6104374) (← links)
- Decidability results in automata and process theory (Q6560390) (← links)
- Realisability of global models of interaction (Q6605359) (← links)
- On decidability of the bisimilarity on higher-order processes with parameterization (Q6643749) (← links)
