524 search results - page 19 / 105 » Temporal reachability graphs |
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
GG
2010
Springer
13 years 10 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
DEXA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we propose the Graphical sEmistructured teMporal data model (GEM), which is based on labeled graphs and allows one to represent in a uniform way semistructu...
APWEB
2005
Springer
14 years 3 months ago
2005
Springer
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...
HICSS
2006
IEEE
14 years 3 months ago
2006
IEEE
A new model for representing temporal access control policies is introduced. In this model, temporal authorizations are represented by time attributes associated with subjects and...