Sciweavers

1032 search results - page 133 / 207
» Extended Computation Tree Logic
Sort
View
HYBRID
2010
Springer
15 years 4 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
CODES
2002
IEEE
15 years 2 months ago
Symbolic model checking of Dual Transition Petri Nets
This paper describes the formal verification of the recently introduced Dual Transition Petri Net (DTPN) models [12], using model checking techniques. The methodology presented a...
Mauricio Varea, Bashir M. Al-Hashimi, Luis Alejand...
FUZZIEEE
2007
IEEE
15 years 1 months ago
A System for Querying with Qualitative Distances in Networks
A central role of Geographic Information Systems (GIS) is to allow the identification and visualisation of relevant spatial features from typically large volumes of data. This requ...
Carl P. L. Schultz, Hans W. Guesgen, Robert Amor
IEEEHPCS
2010
14 years 8 months ago
Semantic model checking security requirements for web services
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
L. Boaro, E. Glorio, Francesco Pagliarecci, Luca S...
EJC
2008
14 years 10 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias