We study the behavioural theory of a higher-order distributed calculus with private names and locations that can be passivated. For this language, we present a novel Labelled Transition System where higher-order inputs are symbolic agents that can perform a limited number of transitions, capturing the nature of passivation. Standard first-order weak bisimulation over this LTS coincides with contextual equivalence, and provides the first useful proof technique without a universal quantification over contexts for an intricate distributed language. © 2013 Springer-Verlag.
CITATION STYLE
Koutavas, V., & Hennessy, M. (2013). Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8052 LNCS, pp. 167–181). https://doi.org/10.1007/978-3-642-40184-8_13
Mendeley helps you to discover research relevant for your work.