254 search results - page 11 / 51 » Model Checking Branching Time Logics |
WABI
2007
Springer
15 years 5 months ago
2007
Springer
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
ENTCS
2006
14 years 11 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...
108
click to vote
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
118
click to vote
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
95
Voted
FM
2001
Springer
15 years 4 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...