Barbara König  Home/Search
Context
Related
| wwweickel.informatik.tumu...diss.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: wwweickel.informa...publikationen (more) Homepages: B.Konig |
Rate this article:      (best)Comment on this article |
Abstract: The aim of this thesis is to describe the semantics of a process calculus by means of hypergraph rewriting, creating a specification mechanism combining modularity of process calculi and locality of graph transformation. Verification of processes is addressed by presenting two methods: barbed congruence for relating processes displaying the same behaviour and generic type systems, forming a central part of this work. Based on existing work in graph rewriting... (Update)
Active bibliography (related documents): More All
0.6: Observational Equivalence for Synchronized Graph Rewriting.. - König, Montanari (2001) (Correct)
0.5: Hypergraph Construction and Its Application to the Compositional.. - König (2000) (Correct)
0.5: Generating Type Systems for Process Graphs - König (1999) (Correct)
Similar documents based on text: More All
0.4: Partial Transposition in Quantum Information Theory - Wolf (Correct)
0.2: Refinements in HOLCF: Implementation of Interactive Systems - Slotosch (1997) (Correct)
0.1: A Verification Environment for I/O Automata - Müller (1998) (Correct)
BibTeX entry: (Update)
@phdthesis{ konig-description,
author = "Barbara K{\"o}nig",
title = "Description and Verification of Mobile Processes with Graph Rewriting Techniques",
url = "citeseer.ist.psu.edu/617164.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
951 Computational Complexity (context) - Papadimitriou - 1994
906 A structural approach to operational semantics - Plotkin - 1981
484 A Calculus of Communicating Systems (context) - Milner - 1980
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
343 Principal type-schemes for functional programs (context) - Damas, Milner - 1982
291 A calculus of mobile agents - Fournet, Gonthier et al. - 1996
254 Theoretical Computer Science (context) - Berry, Boudol et al. - 1992
248 Expressing Mobility (context) - Sangiorgi - 1992
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967
197 Barbed bisimulation - Milner, Sangiorgi - 1992
192 Logic programming (context) - Apt - 1990
158 Secrecy by typing in security protocols - Abadi - 1997
146 EATCS Monographs on Theoretical Computer Science (context) - Reisig, An - 1985
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
137 Laboratory for Foundations of Computer Science (context) - Milner, Parrow et al. - 1989
134 A Theory of Objects (context) - Abadi, Cardelli - 1996
125 American Mathematical Society (context) - Birkhoff - 1967
116 A typed language for distributed mobile processes - Riely, Hennessy - 1998
114 The Polymorphic Pi-Calculus: Theory and Implementation - Turner - 1995
109 Interaction nets (context) - Lafont - 1990
97 Mathematical Structures in Computer Science (context) - Milner, processes - 1992
89 Calculi for interaction - Milner - 1996
86 A partially deadlock-free typed process calculus - Kobayashi - 1997
66 Graph types for monadic mobile processes - Yoshida - 1996
64 Cambridge University Press (context) - Crole, Types - 1993
62 A calculus of higher order communicating systems (context) - Thomsen - 1989
61 The fusion calculus: Expressiveness and symmetry in mobile p.. - Parrow, Victor - 1998
52 Towards a lambda-calculus for concurrent and communicating s.. (context) - Boudol - 1989
48 Reasoning about cryptographic protocols in the spi calculus - Abadi, Gordon - 1997
47 On bisimulations for the asynchronous -calculus - Amadio, Castellani et al. - 1996
43 Hyperedge Replacement: Grammars and Languages (context) - Habel - 1992
42 Distributed processes and location failures - Riely, Hennessy - 1997
40 The Lambda Calculus---its Syntax and Semantics (context) - Barendregt - 1984
39 The reflexive chemical abstract machine and the join-calculu.. (context) - Fournet, Gonthier - 1996
36 Interaction categories and foundations of typed concurrent p.. - Abramsky, Gay et al. - 1995
36 The pi-calculus in direct style - Boudol - 1997
34 Bisimulation for higher-order process calculi - Sangiorgi - 1996
26 Mathematical Systems Theory (context) - Bauderon, Courcelle et al. - 1987
25 Parallel and Distributed Graph Transformation: Formal Descri.. (context) - Taentzer - 1996
22 A sort inference algorithm for the polyadic - calculus (context) - Gay - 1993
22 Behavioural types for a calculus of concurrent objects - Ravara, Vasconcelos - 1997
22 Graph notation for concurrent combinators - Yoshida - 1994
22 Functional programming and lambda calculus (context) - Barendregt - 1990
16 EATCS Monographs on Theoretical Computer Science (context) - Balc'azar, D'iaz et al. - 1988
14 Operational and algebraic semantics of concurrent processes (context) - Milner - 1990
14 Specifying concurrent languages and systems with \Delta-gram.. (context) - Kaplan, Loyall et al. - 1993
14 A theory of higher order communicating systems (context) - Thomsen - 1995
10 Introduction to the algebraic theory of graphs (context) - Ehrig - 1979
10 Principal typing-schemes in a polyadic -calculus (context) - Vasconcelos, Honda - 1993
9 Positive recursive type assignment (context) - Urzyczyn - 1995
8 London Mathematical Society (context) - Hindley, Seldin et al. - 1986
7 Typing confluence - Nestmann, Steffen - 1997
6 Predicative polymorphism in -calculus (context) - Vasconcelos - 1994
6 Pi-nets: a graphical form of pi-calculus (context) - Milner - 1994
5 Higher-order action calculi (context) - Milner - 1993
5 Interpreting functions as picalculus processes: a tutorial - Sangiorgi, Walker - 1998
3 Graph-grammar semantics of a higher-order programming langua.. - Barthelmann, Schied - 1993
3 A graph grammar representation of nonsequential processes (context) - Reisig - 1980
2 Specification of Concurrent Systems Using Graph Grammars (context) - Loyall - 1992
2 Graph grammar-based description of object-based systems (context) - Janssens, Rozenberg - 1990
2 Techniques of weak bisimulation upto - Milner, Sangiorgi - 1992
1 Verteilte Auswertung attributierter Graphersetzungssysteme z.. (context) - Reichel - 1998
1 Accepted for publication in Information and Computation (context) - Lafont, Information - 1997
1 Imperial College London (context) - Thomsen, Tech et al. - 1989
Documents on the same site (http://wwweickel.informatik.tu-muenchen.de/info/publikationen.html): More
Proving the Correctness of Formal User Interface Specifications - Bauer (Correct)
Proving the Correctness of Formal User Interface Specifications - Bauer (Correct)
Proving the Correctness of Formal User Interface Specifications - Bauer (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