Barbara König  Home/Search
Context Related
| flop.informatik.tumue...concur99.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wwwbrauer.in.tum.de/gruppen/th... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Context of citations to this paper: More
...the asynchronous polyadic calculus [13] by so called process graphs. There is an encoding from the calculus into process graphs [9, 8]. On the other hand there is a straightforward encoding of process graphs into closed action calculi [6] and a close relation of our...
.... elements (via morphisms and categorical functors) 10] A graph based type system with lattices instead of monoids was presented in [11]. For lattices or positive cones of l monoids, generic type systems are much easier to present. The main complication arises from non...
Cited by: More
A General Framework for Types in Graph Rewriting - König (2000) (Correct)
Hypergraph Construction and Its Application to the Compositional.. - König (2000) (Correct)
Analysing Input/Output-Capabilities of Mobile Processes with a.. - König (Correct)
Active bibliography (related documents): More All
0.5: Description and Verification of Mobile Processes with Graph.. - König (Correct)
0.5: On Encoding pπ in mπ - Quaglia, Walker (1998) (Correct)
0.4: Categorical Structure of Continuation Passing Style - Thielecke (1997) (Correct)
Similar documents based on text: More All
0.0: Dr. Luise Unger - Fb Mathematik Fernuniversitt (2000) (Correct)
0.0: An Efficient Integration Scheme for Highly Oscillatory DAEs.. - Denk, Penski (1996) (Correct)
0.0: Tropyc: A Pattern Language for Cryptographic Software - Braga, Rubira, Dahab (1999) (Correct)
Related documents from co-citation: More All
8: calculus: A tutorial (context) - Milner, ss- - 1993
6: Introduction to the algebraic theory of graphs (context) - Ehrig - 1979
6: Hypergraph construction and its application to the compositional modelling of co.. - onig - 2000
BibTeX entry: (Update)
Barbara Konig. Generating type systems for process graphs. In Proc. of CONCUR '99, pages 352--367. Springer-Verlag, 1999. LNCS 1664. http://citeseer.ist.psu.edu/konig99generating.html More
@inproceedings{ konig99generating,
author = "Barbara K{\"o}nig",
title = "Generating Type Systems for Process Graphs",
booktitle = "International Conference on Concurrency Theory",
pages = "352--367",
year = "1999",
url = "citeseer.ist.psu.edu/konig99generating.html" }
Citations (may not include all citations):254 Theoretical Computer Science (context) - erard, erard et al. - 1992
146 Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1993
137 Laboratory for Foundations of Computer Science (context) - Milner, -calculus et al. - 1991
137 Laboratory for Foundations of Computer Science (context) - Milner, Parrow et al. - 1989
114 The Polymorphic Pi-Calculus: Theory and Implementation - Turner - 1995
109 Interaction nets (context) - Lafont - 1990
108 Linearity and the pi-calculus - Kobayashi, Pierce et al. - 1996
86 A partially deadlock-free typed process calculus - Kobayashi - 1997
82 Operational and algebraic semantics of concurrent processes (context) - Milner - 1990
67 Composing processes - Honda - 1996
64 Cambridge University Press (context) - Crole, Types - 1993
43 Hyperedge Replacement: Grammars and Languages (context) - Habel - 1992
35 Combinatory representation of mobile processes - Honda, Yoshida - 1994
26 Mathematical Systems Theory (context) - Bauderon, Courcelle et al. - 1987
24 Secrecy by typing in security protocols (context) - Abadi - 1997
22 Behavioural types for a calculus of concurrent objects - Ravara, Vasconcelos - 1997
10 Introduction to the algebraic theory of graphs (context) - Ehrig - 1979
9 Positive recursive type assignment (context) - Urzyczyn - 1995
6 Pi-nets: a graphical form of pi-calculus (context) - Milner - 1994
4 Nordic Journal of Computing (context) - Parrow - 1995
3 Control ow analysis for the pi-calculus (context) - Bodei, Degano et al. - 1998
2 Typing con uence (context) - Nestmann, Ste - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wwwbrauer.in.tum.de/gruppen/theorie/inf/): More
First-Order Proofs for Higher-Order Languages - Röckl (1999) (Correct)
Proof Tableaux For Basic Parallel Processes - Röckl (Correct)
A π-calculus Process Semantics of Concurrent Idealised ALGOL - Röckl, Sangiorgi (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC