1472 search results - page 76 / 295 » On Model Checking Infinite-State Systems |
134
Voted
EDOC
2000
IEEE
15 years 8 months ago
2000
IEEE
Practical experience indicates that the definition of realworld workflow applications is a complex and error-prone process. Existing workflow management systems provide the means,...
140
Voted
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
129
Voted
TACAS
1997
Springer
15 years 8 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 ...
137
Voted
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
155
Voted
FASE
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. ...