We present a framework for high-level descriptions of concurrent systems, including an arbitrary logic for formulating data structures, assertions and conditionals. It is general and expressive enough to subsume proposed extensions of the pi-calculus, such as the spi-calculus, the applied pi-calculus, the fusion calculus, the concurrent constraint pi-calculus, including structured (polyadic) communication channels and pattern matching.

Joint work with Jesper Bengtson, Magnus Johansson, Joachim Parrow and Björn Victor.