Parameterizing higher-order processes on names and processes

DOI10.1051/ITA/2019005MaRDI QIDQ5108373zbMATH OpenOpenAlexFDO

Publication date 4 May 2020

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2019005

parameterization encoding first-order process higher-order process context bisimulation normal bisimulation

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

Higher-order processes with parameterization over names and processes
On parameterization of higher-order processes
scientific article; zbMATH DE number 7167779
On context bisimulation for parameterized higher-order processes
On the interactive power of higher-order processes extended with parameterization

Cites work

scientific article; zbMATH DE number 6115908 (Why is no real title available?)
scientific article; zbMATH DE number 42752 (Why is no real title available?)
scientific article; zbMATH DE number 7167779 (Why is no real title available?)
A CPS encoding of name-passing in higher-order mobile embedded resources
A calculus of mobile processes. II
Bisimulation congruences in safe ambients
Bisimulation for higher-order process calculi
Bisimulations up-to: beyond first-order transition systems
Characterizing contextual equivalence in calculi with passivation
Distinguishing and relating higher-order and first-order processes by expressiveness
Enhancements of the bisimulation proof method
Fair ambients
Full abstraction for expressiveness: history, myths and facts
General conditions for full abstraction
Higher-order processes with parameterization over names and processes
Introduction to bisimulation and coinduction
Logical Bisimulations and Functional Languages
Normal Bisimulations in Calculi with Passivation
On context bisimulation for parameterized higher-order processes
On parameterization of higher-order processes
On quasi-open bisimulation
On the bisimulation proof method
On the expressiveness and decidability of higher-order process calculi
On the expressiveness of interaction
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
On the relative expressive power of calculi for mobility
On the relative expressiveness of higher-order session processes
Plain CHOCS. A second generation calculus for higher order processes
The -calculus: A theory of mobile processes
Theory of interaction
Towards `up to context' reasoning about higher-order processes
Towards a Unified Approach to Encodability and Separation Results for Process Calculi

Cited in

(6)

scientific article; zbMATH DE number 7167779 (Why is no real title available?)
On parameterization of higher-order processes
On context bisimulation for parameterized higher-order processes
On the interactive power of higher-order processes extended with parameterization
On decidability of the bisimilarity on higher-order processes with parameterization
Higher-order processes with parameterization over names and processes

This page was built for publication: Parameterizing higher-order processes on names and processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108373)