2661 search results - page 57 / 533 » Model Checking Performability Properties |
ASIAN
2003
Springer
14 years 2 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
ICWS
2007
IEEE
13 years 11 months ago
2007
IEEE
In order to find suitable web services in a large market of web services, automatic support is needed to filter out web services semantically. Existing matchmaking approaches ma...
SIGPLAN
2002
13 years 9 months ago
2002
Future Interval Logic (FIL) and its intuitive graphical representation, Graphical Interval Logic (GIL), can be used as the formal description language of model checking tools to v...
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
FMCAD
2004
Springer
14 years 3 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...