Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion

DOI10.2168/LMCS-12(1:1)2016zbMath1448.68338arXiv1510.06658OpenAlexW2799783906MaRDI QIDQ2790164

Nobuko Yoshida, Tijs Slaats, Søren Debois, Thomas Troels Hildebrandt

Publication date: 3 March 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

livenessprocess algebrasession typesbusiness processestyping systembounded recursion

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Replication, refinement \& reachability: complexity in dynamic condition-response graphs ⋮ Declarative choreographies and liveness

This page was built for publication: Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion