On the discriminating power of passivation and higher-order interaction

DOI10.1145/2603088.2603113MaRDI QIDQ4635597zbMATH OpenOpenAlexFDO

Authors Marco Bernardo, Davide Sangiorgi, Valeria Vignudelli

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603113

zbMATH Keywords

lambda-calculuscontextual equivalenceCCSprobabilistic processespassivationhigher-order pi-calculus

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Distinguishing and relating higher-order and first-order processes by expressiveness
• Characterizing contextual equivalence in calculi with passivation
• Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract)
• On the relative expressiveness of higher-order session processes
• First-order reasoning for higher-order concurrency

Cited in

(2)

• Towards general axiomatizations for bisimilarity and trace semantics
• A general SOS theory for the specification of probabilistic transition systems

This page was built for publication: On the discriminating power of passivation and higher-order interaction

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