scientific article; zbMATH DE number 1437942
From MaRDI portal
Publication:4951112
zbMath0951.68049MaRDI QIDQ4951112
No author found.
Publication date: 1 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Related Items (76)
Behavioural logics for configuration structures ⋮ An Institution for Graph Transformation ⋮ Graph traversal and graph transformation ⋮ Preserving consistency in geometric modeling with graph transformations ⋮ Parallelism in AGREE Transformations ⋮ Adhesive and quasiadhesive categories ⋮ The complexity of tree automata and XPath on grammar-compressed trees ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). ⋮ Convergence in infinitary term graph rewriting systems is simple ⋮ Reachability in Graph Transformation Systems and Slice Languages ⋮ A hierarchy of dismantlings in graphs ⋮ A strict constrained superposition calculus for graphs ⋮ Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials ⋮ The generative power of delegation networks ⋮ Ugo Montanari and Graph Transformation ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Graph Transformation Units – An Overview ⋮ Linear-Ordered Graph Grammars: Applications to Distributed Systems Design ⋮ Polynomial graph transformability ⋮ A Graph Transformation View on the Specification of Applications using Mobile Code* *Research partially supported by project ForMOS (Métodos Formais para Código Móvelem Sistemas Abertos) - grant CNPq 520269/98-5, by the Research Training Network GET-GRATS (General Theory of Graph Transformation Systems), and by the MURST project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA). ⋮ Correct transformation: from object-based graph grammars to PROMELA ⋮ Verification of graph grammars using a logical approach ⋮ Term-Graph Rewriting Via Explicit Paths ⋮ From Tree-Based Generators to Delegation Networks ⋮ From Algebraic Graph Transformation to Adhesive HLR Categories and Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parallel rewriting of attributed graphs ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Inductively Sequential Term-Graph Rewrite Systems ⋮ Mobile Agents Implementing Local Computations in Graphs ⋮ Workshop on Petri Nets and Graph Transformations ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ A polynomial nominal unification algorithm ⋮ Parallel coherent graph transformations ⋮ Singular and plural functions for functional logic programming ⋮ Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”. ⋮ Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen. ⋮ On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH ⋮ Specifying and Implementing Visual Process Modeling Languages with DiaGen1 1Support by the Esprit Working Group AppliGraph is gratefully acknowledged. ⋮ GETGRATS ⋮ Graph Relabelling Systems ⋮ Basic Results for Two Types of High-Level Replacement Systems ⋮ Processes and Local Actions ⋮ A graph-based approach to the compositional specification of distributed systems ⋮ Structured Modeling with GRACE ⋮ Parameterized Transformation Units ⋮ An Abstract Module Concept for Graph Transformation Systems ⋮ Visual Modeling of Distributed Object Systems by Graph Transformation ⋮ -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation ⋮ Combining termination proofs in model transformation systems ⋮ Graph-based specification of access control policies ⋮ An algebraic semantics for MOF ⋮ Graph transformation through graph surfing in reaction systems ⋮ GRACE as a unifying approach to graph-transformation-based specification1 1This work was partially supported by the ESPRIT Working Group Applications of Graph Transformation (APPLIGRAPH) and the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems). ⋮ Proving Properties of Lazy Functional Programs with Sparkle ⋮ The Edge of Graph Transformation — Graphs for Behavioural Specification ⋮ Implementing conditional term rewriting by graph rewriting ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ A calculus of concurrent graph-rewriting processes ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ On the Complexity of Local Graph Transformations ⋮ Minimisation of event structures ⋮ Function simulation, graph grammars and colourings ⋮ Adhesive DPO Parallelism for Monic Matches ⋮ Verification of Random Graph Transformation Systems ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting ⋮ Modelling Calculi with Name Mobility using Graphs with Equivalences ⋮ Term-graph Rewriting in Tom Using Relative Positions ⋮ Universal Boolean Systems ⋮ Undecidable Control Conditions in Graph Transformation Units ⋮ On Term-Graph Rewrite Strategies ⋮ Formal software specification with refinements and modules of typed graph transformation systems ⋮ Hierarchical graph transformation ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
This page was built for publication:
