Pages that link to "Item:Q3651244"
From MaRDI portal
The following pages link to On Bisimulation Theory in Linear Higher-Order π-Calculus (Q3651244):
Displaying 16 items.
- More on bisimulations for higher order \(\pi\)-calculus (Q442289) (← links)
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Linearity and bisimulation (Q997996) (← links)
- A complete symbolic bisimulation for full applied pi calculus (Q1758155) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) (Q2942772) (← links)
- Bisimulation Congruences in the Calculus of Looping Sequences (Q3525142) (← links)
- Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus (Q3584942) (← links)
- (Q4219048) (← links)
- On parameterization of higher-order processes (Q4976336) (← links)
- (Q5257122) (← links)
- Small bisimulations for reasoning about higher-order imperative programs (Q5348920) (← links)
- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus (Q5428855) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897764) (← links)
- On bisimulations for the asynchronous π-calculus (Q6104371) (← links)