5863 search results - page 226 / 1173 » On Model-Checking of P Systems |
148
click to vote
CAISE
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this paper we present our approach to model and verify workflowintensive systems. Besides the functional properties (given by the temporal workflow description) we aug...
206
click to vote
LICS
2006
IEEE
16 years 1 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
172
click to vote
ICTAI
2005
IEEE
16 years 23 days ago
2005
IEEE
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
161
click to vote
IPPS
2003
IEEE
16 years 13 days ago
2003
IEEE
The standardisation procedure of the IEEE P1394.1 Draft Standard for High Performance Serial Bus Bridges is supported through the use of the state-of-the-art model checker Spin, w...
198
click to vote
CAV
2008
Springer
15 years 9 months ago
2008
Springer
We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space...