Matching systems for concurrent calculi
From MaRDI portal
Recommendations
Cites work
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 2059568 (Why is no real title available?)
- Leader election in rings of ambient processes
- Mobile ambients
- On asynchrony in name-passing calculi
- On the expressiveness of internal mobility in name-passing calculi
- Testing equivalences for processes
Cited in
(8)- On the validity of encodings of the synchronous in the asynchronous -calculus
- Towards a unified approach to encodability and separation results for process calculi
- Expressiveness of concurrent intensionality
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- scientific article; zbMATH DE number 4047161 (Why is no real title available?)
- Matching in the pi-calculus
- Full abstraction for expressiveness: history, myths and facts
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
This page was built for publication: Matching systems for concurrent calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864374)