2873 search results - page 316 / 575 » Model Checking and the Mu-calculus |
124
click to vote
CSFW
2006
IEEE
15 years 7 months ago
2006
IEEE
A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security co...
122
click to vote
FCS
2006
15 years 5 months ago
2006
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
134
click to vote
FUIN
2008
15 years 4 months ago
2008
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...
118
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
133
click to vote
IPL
2007
15 years 4 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...