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...
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...
— 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 ...
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 ...
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 ...