Placement Inference for a Client-Server Calculus

DOI10.1007/978-3-540-70583-3_7zbMath1155.68338OpenAlexW1547991054MaRDI QIDQ3520305

Matthias Neubauer, Peter Thiemann

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_7

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Characterising tractable constraints
• A theory of timed automata
• Performance evaluation of (max,+) automata
• The first-order theory of subtyping constraints
• From sequential programs to multi-tier applications by program transformation
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Placement Inference for a Client-Server Calculus