144 search results - page 27 / 29 » Towards EPC Semantics based on State and Context |
LOGCOM
1998
13 years 7 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
XPU
2005
Springer
14 years 1 months ago
2005
Springer
The main goal to be answered by this Ph.D. thesis is whether there is a potential for a successful and powerful application of agile methods and related techniques to embedded syst...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
CONCUR
2004
Springer
14 years 28 days ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
VLDB
2004
ACM
14 years 27 days ago
2004
ACM
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q if the answer for Q is always a subset of...