504 search results - page 72 / 101 » The Complexity of Symmetry-Breaking Formulas |
MSV
2007
13 years 11 months ago
2007
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
CN
2006
13 years 10 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
ECCC
2010
13 years 8 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...