585 search results - page 30 / 117 » Better Abstractions for Timed Automata |
121
click to vote
INFOCOM
2011
IEEE
14 years 4 months 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....
88
Voted
FSEN
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Groote, Pang and Wouters (2001) analyzed an existing distributed lift system using the process algebraic toolset µCRL. Pang, Karstens and Fokkink (2003) analyzed a redes...
88
Voted
CAV
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...
107
Voted
SERVICES
2008
15 years 1 months ago
2008
an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via chan...
CORR
2010
Springer
15 years 16 days ago
2010
Springer
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...