Deriving bisimulation congruences in the DPO approach to graph rewriting. Long version
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik (früher: Bericht / Universität Stuttgart, Fakultät Informatik) ; 2004,1
- Classification
-
Mathematik
- Keyword
-
Bisimulation ; Transitionssystem ; Graphersetzungssystem
- Event
-
Veröffentlichung
- (where)
-
Stuttgart
- (who)
-
Universitätsbibliothek der Universität Stuttgart
- (when)
-
2004
- Creator
- URN
-
urn:nbn:de:bsz:93-opus-18579
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 11:00 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ehrig, Hartmut
- König, Barbara
- Universitätsbibliothek der Universität Stuttgart
Time of origin
- 2004
Other Objects (12)
Deriving inference rules for description logics : a rewriting approach into sequent calculi
Infinite graphs generated by tree rewriting
Efficient graph rewriting and its implementation
A Compass to Controlled Graph Rewriting
Infinite graphs generated by tree rewriting
On termination of single pushout graph rewriting
A term rewriting technique for decision graphs
Learning and Rewriting in Fuzzy Rule Graphs
Deriving general schemes for classes of graph algorithms
Minimality of derived rules in single pushout graph rewriting
Description and verification of mobile processes with graph rewriting techniques
Three papers on graph rewriting systems and their applications, [1].
Deriving inference rules for description logics : a rewriting approach into sequent calculi
Infinite graphs generated by tree rewriting
Efficient graph rewriting and its implementation
A Compass to Controlled Graph Rewriting
Infinite graphs generated by tree rewriting
On termination of single pushout graph rewriting
A term rewriting technique for decision graphs
Learning and Rewriting in Fuzzy Rule Graphs
Deriving general schemes for classes of graph algorithms
Minimality of derived rules in single pushout graph rewriting
Description and verification of mobile processes with graph rewriting techniques
Three papers on graph rewriting systems and their applications, [1].
Deriving inference rules for description logics : a rewriting approach into sequent calculi
Infinite graphs generated by tree rewriting
Efficient graph rewriting and its implementation
A Compass to Controlled Graph Rewriting
Infinite graphs generated by tree rewriting
On termination of single pushout graph rewriting
A term rewriting technique for decision graphs
Learning and Rewriting in Fuzzy Rule Graphs
Deriving general schemes for classes of graph algorithms
Minimality of derived rules in single pushout graph rewriting
Description and verification of mobile processes with graph rewriting techniques