Pages that link to "Item:Q627133"
From MaRDI portal
The following pages link to On the expressiveness and decidability of higher-order process calculi (Q627133):
Displaying 28 items.
- More on bisimulations for higher order \(\pi\)-calculus (Q442289) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- On the computational power of BlenX (Q1044845) (← links)
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
- On the interactive power of higher-order processes extended with parameterization (Q2026374) (← links)
- Categorical specification and implementation of replicated data types (Q2072069) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- Using session types for reasoning about boundedness in the \(\pi\)-calculus (Q2216475) (← links)
- On the relative expressiveness of higher-order session processes (Q2272988) (← links)
- Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
- On the Relative Expressiveness of Higher-Order Session Processes (Q2802492) (← links)
- Decidability of Behavioral Equivalences in Process Calculi with Name Scoping (Q2894570) (← links)
- HOCore in Coq (Q2945640) (← links)
- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (Q3587459) (← links)
- Normal Bisimulations in Calculi with Passivation (Q3617734) (← links)
- An expressiveness study of priority in process calculi (Q3655761) (← links)
- (Q4409159) (← links)
- On parameterization of higher-order processes (Q4976336) (← links)
- (Q5014801) (← links)
- (Q5015359) (← links)
- Parameterizing higher-order processes on names and processes (Q5108373) (← links)
- (Q5377471) (← links)
- Automata, Languages and Programming (Q5466471) (← links)
- On decidability of the bisimilarity on higher-order processes with parameterization (Q6643749) (← links)
