361 search results - page 18 / 73 » Parallel Model Checking for Temporal Epistemic Logic |
141
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
121
Voted
WSFM
2007
Springer
15 years 9 months ago
2007
Springer
A “data-aware” web service property is a constraint on the pattern of message exchanges of a workflow where the order of messages and their data content are interdependent. Th...
160
Voted
FM
2003
Springer
15 years 8 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
143
click to vote
LFCS
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
119
Voted
ENTCS
2006
15 years 3 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...