Sciweavers

371 search results - page 58 / 75
» Pushdown Automata Simulator
Sort
View
165
Voted
ANCS
2009
ACM
14 years 11 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
TACS
2001
Springer
15 years 6 months ago
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
Ph. Schnoebelen
ENTCS
2006
105views more  ENTCS 2006»
15 years 1 months ago
Monte Carlo Methods for Process Algebra
We review the recently developed technique of Monte Carlo model checking and show how it can be applied to the implementation problem for I/O Automata. We then consider some open ...
Radu Grosu, Scott A. Smolka
VIS
2007
IEEE
123views Visualization» more  VIS 2007»
16 years 3 months ago
Multifield Visualization Using Local Statistical Complexity
Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be ext...
Heike Jänicke, Alexander Wiebel, Gerik Scheuerm...
ECOWS
2008
Springer
15 years 3 months ago
Automatic Timed Test Case Generation for Web Services Composition
In order to specify the composition of Web services, WSBPEL was defined as an orchestrating language by an international standards consortium. In this paper, we propose a method t...
Mounir Lallali, Fatiha Zaïdi, Ana R. Cavalli,...