3229 search results - page 209 / 646 » The Theory of Timed Automata |
188
click to vote
MFCS
2007
Springer
16 years 22 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
167
click to vote
UML
2001
Springer
15 years 11 months ago
2001
Springer
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
154
click to vote
SIGACT
2010
15 years 5 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
171
click to vote
SPIN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a new decision procedure for detecting property violations in pushdown models for concurrent programs that use lock-based synchronization, where each thread’...
192
click to vote
DEBS
2009
ACM
16 years 1 months ago
2009
ACM
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...