1716 search results - page 160 / 344 » Proving Conditional Termination |
89
Voted
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
94
Voted
FM
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
89
Voted
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
We show that CSMA is able to spontaneously synchronize transmissions in a wireless network with constant-size packets, and that this property can be used to devise efficient synch...
103
Voted
APN
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Petri nets are widely used for modeling and analyzing workflows. Using the token-game semantics, Petri net-based workflow models can be analyzed before the model is actua...
98
Voted
JANCL
2008
15 years 20 days ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...