322 search results - page 41 / 65 » Symbolic model checking of institutions |
MMB
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We explore the problem of specification and verification of compliance in agent based Web service compositions. We use the formalism of temporal-epistemic logic suitably extended ...
CHARME
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...