208 search results - page 19 / 42 » Fair Model Checking with Process Counter Abstraction |
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
112
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
68
Voted
SPIN
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We describe a translation from a dialect of SDL-88 to PROMELA, the input language of the SPIN model checker. The fairly straightforward translation covers data types as w...
FAC
2008
14 years 9 months ago
2008
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
CAISE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Contemporary information systems struggle with the requirement to provide flexibility and process support while still enforcing some degree of control. Workflow managemen...