777 search results - page 42 / 156 » Model Checking with Formula-Dependent Abstract Models |
ADVIS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In many practical business process modelling scenarios using Petri nets, the resultant model does not have a single input place and a single output place. In particular, ...
ICTAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
AAMAS
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-b...
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
TACAS
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...