Sciweavers

415 search results - page 17 / 83
» Regular Processes and Timed Automata
Sort
View
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 11 months ago
Rewriting Regular XPath Queries on XML Views
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios K...
QEST
2010
IEEE
13 years 7 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
JALC
2007
90views more  JALC 2007»
13 years 9 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
MEMOCODE
2006
IEEE
14 years 3 months ago
Specifying and proving properties of timed I/O automata in the TIOA toolkit
Timed I/O Automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for exa...
Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan M...
ACSD
2006
IEEE
109views Hardware» more  ACSD 2006»
13 years 11 months ago
Synthesis of Synchronous Interfaces
Reuse of IP blocks has been advocated as a means to conquer the complexity of today's system-on-chip (SoC) designs. Component integration and verification in such systems is ...
Purandar Bhaduri, S. Ramesh