A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)

DOI10.1007/978-3-319-05119-2_7zbMath1348.68158arXiv1510.01044OpenAlexW1794259958MaRDI QIDQ2830029

Johannes Åman Pohjola, Joachim Parrow, Björn Victor, Ramūnas Gutkovas, Johannes Borgström

Publication date: 9 November 2016

Published in: Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.01044

Mathematics Subject Classification ID

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

Related Items (4)

Declarative event based models of concurrency and refinement in psi-calculi ⋮ Binary Session Types for Psi-Calculi ⋮ Expressiveness of concurrent intensionality ⋮ Psi-calculi in Isabelle

Uses Software

• Linda

Cites Work

• Unnamed Item
• Unnamed Item
• Computing strong and weak bisimulations for psi-calculi
• A new approach to abstract syntax with variable binding
• Nominal logic, a first order theory of names and binding
• Pattern-matching spi-calculus
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Typed ψ-calculi
• Concurrent Pattern Calculus
• On the security of public key protocols
• Mobile values, new names, and secure communication
• Generative communication in Linda
• Programming Languages and Systems
• Global Computing
• Higher-order psi-calculi

This page was built for publication: A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)