Sciweavers

500 search results - page 17 / 100
» Streaming tree automata
Sort
View
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
ASWEC
2007
IEEE
14 years 1 months ago
Timed Behavior Trees and Their Application to Verifying Real-Time Systems
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
Lars Grunske, Kirsten Winter, Robert Colvin
GLOBECOM
2008
IEEE
14 years 2 months ago
Adaptive Multicast Tree Construction for Elastic Data Streams
— In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for ...
Ying Zhu, Ken Q. Pu
WWW
2007
ACM
14 years 8 months ago
Visibly pushdown automata for streaming XML
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
ICDT
2003
ACM
106views Database» more  ICDT 2003»
14 years 24 days ago
Processing XML Streams with Deterministic Automata
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan ...