A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Generalized LR parsing and the shuffle operator
[article]
2016
arXiv
pre-print
Preserved Fulltext
Our system is motivated by an application from artificial intelligence plan recognition. We argue for the correctness of the system, and discuss future extensions of this work. ...
Tomita dubbed this construction the graph-structured stack [12] . We adopt the graph-structured stack for GLR-S, but the midstack mutation performed at Step 1. ...
So essentially the controllers form a linked tree of stacks from the lower graph, which taken together assemble the cactus stacks of the nondeterministic algorithm. ...
arXiv:1611.05831v1
fatcat:gqfvdlzninhb7p3cx33ctjitji
Page 6555 of Mathematical Reviews Vol. , Issue 87k
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In a rewriting rule in a node-labeled controlled (NLC) graph grammar a single node is replaced with a graph along with a specification of the edges between the neighbors of the rewritten node and the nodes ...
Caza&nescu, Virgil Emil (R-BUCH) 87k:68086 The leftmost derivations of a rewriting system form a free algebraic structure.
Rev. Roumaine Math. Pures Appl. 31 (1986), no. 1, 1-8. ...
Page 3597 of Mathematical Reviews Vol. , Issue 90F
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In this paper, we introduce a bounded nondeterministic choice operator ‘U’ into algebraic specifi- cations and related term-rewriting systems. ...
, Stéphane
Rewriting with a nondeterministic choice operator. ...
Issues in the practical use of graph rewriting
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notation. ...
Also, graph-rewriting is not convenient for solving all aspects of a problem: better mechanisms are needed for interfacing graph rewriting with other styles of computation. ...
Modular control specification In an ordered graph-rewriting system, the control specification can be structured in a modular way. ...
doi:10.1007/3-540-61228-9_78
fatcat:pgenioqkgbebjk4bpjvhzltham
Abstraction and Control for Shapely Nested Graph Transformation
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
It supports nested structuring of graphs, structural graph types (shapes), and graph variables. ...
Shapely nested graph transformation is the computational model for DiaPlan, a language for programming with graphs that represent diagrams. ...
Agg [7] is a prototyping rather than a programming system; it does not provide abstraction, and only rudimentary control structures. ...
doi:10.1007/3-540-45832-8_15
fatcat:tzd4fg6gxrhh3hrijvvfshxaci
The esprit basic research working group compugraph "computing by graph transformation": a survey
1993
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The system contains a very flexible editor for graphical structures and the basic functionality for the performance of direct (i.e. one-step) graph transformations. ...
They generalize the theory from graphs to general mathematical structures and subsume also rewriting, for example, on Petri nets and algebraic specifications. ...
doi:10.1016/0304-3975(93)90062-x
fatcat:ae5x4dsjy5cl5dvnbscakgbxeq
Page 3264 of Mathematical Reviews Vol. , Issue 87f
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In the second part an operational model for concurrent dis- tributed systems is described. This model, grammars for dis- tributed systems, is based on graphs and graph rewriting systems. ...
J. (1-BOST) 87f:68064 Definability by deterministic and nondeterministic programs (with applications to first-order dynamic logic).
Inform. and Control 65 (1985), no. 2-3, 98-121. ...
Garp: Graph abstractions for concurrent programming
[chapter]
1988
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose the use of a graph-grammar based formalism to control the complexities arising from trying to program such dynamic networks. ...
There is a growing need for effective ways to organize.., distributed programs [14] . ...
Acknowledgements Thanks to Roy Campbell and Steve Costing for frequent discussions on the CARP system and the theory underlying it, as well as their comments on earlier drafts of this paper. ...
doi:10.1007/3-540-19027-9_13
fatcat:wanxnb5pmfbcjmuxikgc5ktzo4
Page 5457 of Mathematical Reviews Vol. , Issue 88j
[page]
1988
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This result is obtained by reducing the problem of confluence for ground term-rewriting systems to the equivalence problem for nondeterministic root-to-frontier au- tomata. ...
Concurrent programs are usually modelled by labelled state-transition graphs in which some state is designated as the initial state. For historical reasons such graphs are called Kripke structures. ...
Some hierarchies for the communication complexity measures of cooperating grammar systems
1994
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider mostly the following graphs as communication structures: linear arrays, rings, trees and directed acyclic graphs. ...
PCGS with acyclic communication structure can be simulated in linear time by nondeterministic off-line multitape Turing machines. ...
PCGS with other communication structures (planar graphs, hypercubes, etc.) remains open. ...
doi:10.1016/0304-3975(94)90103-1
fatcat:v3lrr54fdfetbksakgnv2v4x64
Some hierarchies for the communication complexity measures of cooperating grammar systems
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here we consider mostly the following graphs as communication structures: linear arrays, rings, trees and directed acyclic graphs. ...
PCGS with acyclic communication structure can be simulated in linear time by nondeterministic off-line multitape Turing machines. ...
The study of hierarchies on the number of grammars for PCGS with other communication structures (planar graphs, hypercubes, etc) remains open. ...
doi:10.1007/3-540-57182-5_41
fatcat:qqyymywmdfgytjdyzvtgblhlxi
Pushdown Specifications
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
They proceed to restrict the logics to fragments for which model-checking over finite-state systems and context-free systems is decidable. ...
We show that the model-checking problem for regular systems and PD-NPT specifications can be solved in time exponential in the system and the specification. ...
It follows that the model checking problem for context-free systems and PD-NPT is also undecidable. ...
doi:10.1007/3-540-36078-6_18
fatcat:3bc5ru6sp5e2vbw2tbvs5r3jru
Subject index volumes 1–200
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
,
11.53
graph-oriented object data model, 3030
graph-rewrite systems, 1149
graph-rewriting
formalism, 2126
graphs,
set-inclusion ordering, 2008 set-Levenshtein distance, 3340 set-models, classical ...
, 3099
streams of substitutions, 1604
finite string-rewriting system, 2549
finite string-rewriting systems, 1274
module partial commutativity, confluence of -,
1263
finite structures, 2002, 2222, ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
REM (Reduce Elan Machine): Core of the New ELAN Compiler
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements: We sincerely thank Peter Borovanský, Horatiu Cirstea and Hélène Kirchner for helpful discussions and comments. ...
Introduction ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. ...
The second source of efficiency of the AC matching algorithm is the definition of restricted classes of patterns for which a refined data structure of compact bipartite graph is used. ...
doi:10.1007/10721975_19
fatcat:cbl7ef7k5zbj3lirzv74yefsxm
Global Model-Checking of Infinite-State Systems
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In order to solve the global modelchecking problem we show that for both types of automata, given a regular tree, we can construct a nondeterministic word automaton that accepts all the nodes in the tree ...
In this paper we extend the automata-theoretic framework for reasoning about infinite-state sequential systems to handle also the global modelchecking problem. ...
We believe that our algorithms generalize also to micro-macro stack systems [PV03] and to high order pushdown systems [KNU03, Cac03] as the algorithms for local modelchecking over these types of systems ...
doi:10.1007/978-3-540-27813-9_30
fatcat:h4jfze3ymrb27m2xg5jknurlpq
« Previous
Showing results 1 — 15 out of 3,203 results