Generating Type Systems for Process Graphs


Barbara König. Generating type systems for process graphs. In Proc. of CONCUR '99, pages 352–367. Springer-Verlag, 1999. LNCS 1664.


We introduce a hypergraph-based process calculus with a generic type system. That is, a type system checking an invariant property of processes can be generated by instantiating the original type system. We demonstrate the key ideas behind the type system, namely that there exists a hypergraph morphism from each process graph into its type, and show how it can be used for the analysis of processes. Our examples are input/output-capabilities, secrecy conditions and avoiding vicious circles occurring in deadlocks. In order to specify the syntax and semantics of the process calculus and the type system, we introduce a method of hypergraph construction using concepts from category theory.

Suggested BibTeX entry:

    author = {Barbara K{\"o}nig},
    booktitle = {Proc. of CONCUR '99},
    note = {{LNCS} 1664},
    pages = {352--367},
    publisher = {{Springer-Verlag}},
    title = {Generating Type Systems for Process Graphs},
    year = {1999}

GZipped PostScript (193 kB)PDF (202 kB)
© University of Duisburg-Essen, Theoretical Computer Science group