Name
Abstract | ||
|---|---|---|
This paper studies several formalisms to specify quantitative properties of finite nested words (or equivalently finite unranked trees). These can be used for XML documents or recursive programs: for instance, counting how often a given entry occurs in an XML document, or computing the memory required for a recursive program execution. Our main interest is to translate these properties, as efficiently as possible, into an automaton, and to use this computational device to decide problems related to the properties (e.g., emptiness, model checking, simulation) or to compute the value of a quantitative specification over a given nested word. The specification formalisms are weighted regular expressions (with forward and backward moves following linear edges or call-return edges), weighted first-order logic, and weighted temporal logics. We introduce weighted automata walking in nested words, possibly dropping/lifting (reusable) pebbles during the traversal. We prove that the evaluation problem for such automata can be done very efficiently if the number of pebble names is small, and we also consider the emptiness problem. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-37075-5_25 | FoSSaCS |
Keywords | Field | DocType |
weighted specification,evaluation problem,emptiness problem,weighted first-order logic,weighted temporal logic,weighted automaton,equivalently finite unranked tree,quantitative property,finite nested word,xml document,nested word,nested words | Discrete mathematics,Regular expression,Model checking,Tree traversal,Nested word,Computer science,Automaton,Algorithm,Theoretical computer science,Tree automaton,Temporal logic,Recursion | Conference |
Volume | ISSN | Citations |
7794 | 0302-9743 | 2 |
PageRank | References | Authors |
0.37 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benedikt Bollig | 1 | 427 | 35.02 |
| Paul Gastin | 2 | 1165 | 75.66 |
| Benjamin Monmege | 3 | 77 | 11.97 |