Sciweavers

233 search results - page 27 / 47
» Equivalent Transformations of Automata by Using Behavioural ...
Sort
View
INFOCOM
2011
IEEE
13 years 15 days ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
TCS
2008
13 years 8 months ago
Temporal constraints in the logical analysis of regulatory networks
Starting from the logical description of gene regulatory networks developed by R. Thomas, we introduce an enhanced modelling approach based on timed automata. We obtain a refined ...
Heike Siebert, Alexander Bockmayr
EMSOFT
2006
Springer
14 years 14 days ago
Polychronous mode automata
Among related synchronous programming principles, the model of computation of the Polychrony workbench stands out by its capability to give high-level description of systems where...
Jean-Pierre Talpin, Christian Brunette, Thierry Ga...
ICFEM
2004
Springer
14 years 2 months ago
Timed Patterns: TCOZ to Timed Automata
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
ENTCS
2007
88views more  ENTCS 2007»
13 years 8 months ago
Keeping Secrets in Resource Aware Components
We present a powerful and flexible method for automatically checking the secrecy of values inside components. In our framework an attacker may monitor the external communication ...
Tom Chothia, Jun Pang, Muhammad Torabi Dashti