55 search results - page 3 / 11 » A New Approach to Bounded Model Checking for Branching Time ... |
CONCUR
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
FORTE
2009
13 years 3 months ago
2009
We present a strategy for model-checking the correctness of service composition. We do so in the context of SRML, a formal modelling framework for service-oriented computing being ...
FMSD
2006
13 years 5 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
LOGCOM
2007
13 years 5 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...