Name
Abstract | ||
|---|---|---|
•We propose a new context-sensitive graph grammar formalism called TEGG in short.•TEGGs introduce some temporal mechanisms in order to tackle time-related issues.•A parsing algorithm for graphs’ structure and temporal sequence is presented.•The decidability and complexity of the parsing algorithm are proven.•A case study on an application with temporal requirements is provided. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jvlc.2018.06.003 | Journal of Visual Languages & Computing |
Keywords | Field | DocType |
Graphical language,Graph grammar,Temporal specification,Parsing algorithm,Simulation | Rule-based machine translation,Graph,Grammar formalism,Computer science,Correctness,Decidability,Theoretical computer science,Grammar,Formalism (philosophy),Parsing | Journal |
Volume | ISSN | Citations |
47 | 1045-926X | 1 |
PageRank | References | Authors |
0.37 | 25 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhan Shi | 1 | 7 | 2.18 |
| Xiaoqin Zeng | 2 | 407 | 32.97 |
| Yang Zou | 3 | 17 | 4.99 |
| Song Huang | 4 | 12 | 10.42 |
| Hui Li | 5 | 11 | 17.11 |
| Bin Hu | 6 | 1 | 1.05 |
| Yi Yao | 7 | 410 | 34.59 |