Local Model Checking in a Logic for True Concurrency

Author(s):  
Paolo Baldan ◽  
Tommaso Padoan
1992 ◽  
Vol 96 (1) ◽  
pp. 157-174 ◽  
Author(s):  
Julian Bradfield ◽  
Colin Stirling

1998 ◽  
Vol 5 (40) ◽  
Author(s):  
Henrik Reif Andersen ◽  
Colin Stirling ◽  
Glynn Winskel

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.


Author(s):  
Jonas Finnemann Jensen ◽  
Kim Guldstrand Larsen ◽  
Jiří Srba ◽  
Lars Kaerlund Oestergaard

1999 ◽  
Vol 2 (3) ◽  
pp. 219-241 ◽  
Author(s):  
Xiaoqun Du ◽  
Scott A. Smolka ◽  
Rance Cleaveland

Sign in / Sign up

Export Citation Format

Share Document