Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion
From MaRDI portal
Publication:2790164
DOI10.2168/LMCS-12(1:1)2016zbMath1448.68338arXiv1510.06658MaRDI 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
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Declarative choreographies and liveness, Replication, refinement \& reachability: complexity in dynamic condition-response graphs