Pages that link to "Item:Q1391099"
From MaRDI portal
The following pages link to On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099):
Displaying 12 items.
- Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
- A process calculus for mobile ad hoc networks (Q967528) (← links)
- On deciding trace equivalences for processes (Q1310916) (← links)
- Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus (Q1962485) (← links)
- On process rate semantics (Q2474433) (← links)
- Deciding framed bisimilarity (Q2842870) (← links)
- Decidability of Behavioral Equivalences in Process Calculi with Name Scoping (Q2894570) (← links)
- (Q3686025) (← links)
- Decidable Fragments of a Higher Order Calculus with Locations (Q5170669) (← links)
- Negative Results on Decidability and Small Model Property of Process Equations (Q5217303) (← links)
- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus (Q5428855) (← links)
- Programming Languages and Systems (Q5464037) (← links)