Sciweavers

58 search results - page 4 / 12
» Satisfiability and Computing van der Waerden Numbers
Sort
View
ACSD
1998
IEEE
113views Hardware» more  ACSD 1998»
13 years 10 months ago
Modeling and Analyzing Interorganizational Workflows
Today's corporations often must operate across organizational boundaries. Phenomena such as electronic commerce, extended enterprises, and the Internet stimulate cooperation ...
Wil M. P. van der Aalst
SYNTHESE
2008
114views more  SYNTHESE 2008»
13 years 5 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
FOSSACS
2010
Springer
14 years 14 days ago
The Complexity of Synchronous Notions of Information Flow Security
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
Franck Cassez, Ron van der Meyden, Chenyi Zhang
TCS
2010
13 years 11 days ago
A comparison of semantic models for noninterference
The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on st...
Ron van der Meyden, Chenyi Zhang
CPC
2006
69views more  CPC 2006»
13 years 5 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...