188 search results - page 15 / 38 » Forgetting the Time in Timed Process Algebra |
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
ESAW
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
FOSSACS
2004
Springer
14 years 3 months ago
2004
Springer
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
FUIN
2008
13 years 10 months ago
2008
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
SAC
2006
ACM
14 years 3 months ago
2006
ACM
Most previous work on information flow in process algebras has been based on untimed models of concurrency. It is obvious, however, that an observer might well use time to gain i...