scholarly journals Local Model Checking of Weighted CTL with Upper-Bound Constraints

2013 ◽  
pp. 178-195 ◽  
Author(s):  
Jonas Finnemann Jensen ◽  
Kim Guldstrand Larsen ◽  
Jiří Srba ◽  
Lars Kaerlund Oestergaard
Keyword(s):  
Model Checking ◽  
Upper Bound ◽  
Local Model ◽  
Bound Constraints ◽  
Weighted Ctl ◽  
Local Model Checking

Efficient model-checking of weighted CTL with upper-bound constraints

2014 ◽  
Vol 18 (4) ◽  
pp. 409-426 ◽  
Author(s):  
Jonas Finnemann Jensen ◽  
Kim Guldstrand Larsen ◽  
Jiří Srba ◽  
Lars Kaerlund Oestergaard
Keyword(s):  
Model Checking ◽  
Upper Bound ◽  
Bound Constraints ◽  
Weighted Ctl

scholarly journals Local model checking for infinite state spaces

1992 ◽  
Vol 96 (1) ◽  
pp. 157-174 ◽  
Author(s):  
Julian Bradfield ◽  
Colin Stirling
Keyword(s):  
Model Checking ◽  
Local Model ◽  
State Spaces ◽  
Infinite State ◽  
Local Model Checking

scholarly journals A Compositional Proof System for the Modal mu-Calculus

1998 ◽  
Vol 5 (40) ◽  
Author(s):  
Henrik Reif Andersen ◽  
Colin Stirling ◽  
Glynn Winskel
Keyword(s):  
Model Checking ◽  
Process Algebra ◽  
Local Model ◽  
Proof System ◽  
Compositional Reasoning ◽  
General Process ◽  
Finite State ◽  
Local Model Checking

We present a proof system for determining satisfaction between<br />processes in a fairly general process algebra and assertions of the modal mu-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal mu-calculus and combines it with techniques from work on local model checking. The proof system is sound for all processes and complete for a class of finite-state processes.

Sign in / Sign up

Export Citation Format

Share Document