942 search results - page 114 / 189 » Interrupt Timed Automata |
WWW
2007
ACM
14 years 9 months ago
2007
ACM
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 ...
QEST
2008
IEEE
14 years 3 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
RTAS
2003
IEEE
14 years 2 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
INFOCOM
2011
IEEE
13 years 19 days ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
ETFA
2006
IEEE
14 years 3 months ago
2006
IEEE
New technological trends lead to the increasing use of network technologies in automation. Especially the Ethernet with TCP/IP and wireless networks find growing acceptance. The r...