Sciweavers

104 search results - page 8 / 21
» Action Abstraction in Timed Process Algebra
Sort
View
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
14 years 1 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
AAMAS
2007
Springer
13 years 8 months ago
An algebra for commitment protocols
Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of pro...
Ashok U. Mallya, Munindar P. Singh
EWRL
2008
13 years 9 months ago
Markov Decision Processes with Arbitrary Reward Processes
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...
Jia Yuan Yu, Shie Mannor, Nahum Shimkin
MSCS
2010
84views more  MSCS 2010»
13 years 6 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi
FOSSACS
2004
Springer
14 years 1 months ago
Bisimulation on Speed: Lower Time Bounds
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...
Gerald Lüttgen, Walter Vogler