Process Algebra and Model Checking

2018 ◽  
pp. 1149-1195 ◽  
Author(s):  
Rance Cleaveland ◽  
A. W. Roscoe ◽  
Scott A. Smolka
Keyword(s):  
Model Checking ◽  
Process Algebra

scholarly journals Model Checking Process Algebra of Communicating Resources for Real-Time Systems

2014 ◽  
Author(s):  
A. Jalil Boudjadar ◽  
Jin Hyun Kim ◽  
Kim G. Larsen ◽  
Ulrik Nyman
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Process Algebra ◽  
Real Time Systems ◽  
Time Systems

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.

scholarly journals A Quantitative Partial Model-Checking Function and Its Optimisation

10.29007/rb2p ◽  
2018 ◽  
Author(s):  
Stefano Bistarelli ◽  
Fabio Martinelli ◽  
Ilaria Matteucci ◽  
Francesco Santini
Keyword(s):  
Model Checking ◽  
Modal Logic ◽  
Algebraic Structure ◽  
Process Algebra ◽  
Software Systems ◽  
Efficient Tool ◽  
Combinatorial Explosion ◽  
Loosely Coupled ◽  
Partial Model ◽  
Final Score

Partial Model-Checking (PMC) is an efficient tool to reduce the combinatorial explosion of a state-space, arising in the verification of loosely-coupled software systems. At the same time, it is useful to consider quantitative temporal-modalities. This allows for checking whether satisfying such a desired modality is too costly, by comparing the final score consisting of how much the system spends to satisfy the policy, to a given threshold. We stir these two ingredients together in order to provide a Quantitative PMC function (QPMC), based on the algebraic structure of semirings. We design a method to extract part of the weight during QPMC, with the purpose to avoid the evaluation of a modality as soon as the threshold is crossed. Moreover, we extend classical heuristics to be quantitative, and we investigate the complexity of QPMC.Keyword: Partial Model Checking, Semirings, Optimisation, Quantitative Modal Logic Quantitative Process Algebra, Quantitative Evaluation of Systems.

Towards Model Checking Stochastic Process Algebra

2000 ◽  
pp. 420-439 ◽  
Author(s):  
Holger Hermanns ◽  
Joost-Pieter Katoen ◽  
Joachim Meyer-Kayser ◽  
Markus Siegle
Keyword(s):  
Stochastic Process ◽  
Model Checking ◽  
Process Algebra ◽  
Stochastic Process Algebra

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

1994 ◽  
Vol 1 (34) ◽  
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 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.

From UML to Process Algebra and Back: An Automated Approach to Model-Checking Software Design Artifacts of Concurrent Systems

2013 ◽  
pp. 244-260 ◽  
Author(s):  
Daniela Remenska ◽  
Jeff Templon ◽  
Tim A. C. Willemse ◽  
Philip Homburg ◽  
Kees Verstoep ◽  
...  
Keyword(s):  
Model Checking ◽  
Software Design ◽  
Process Algebra ◽  
Concurrent Systems

Model Checking of Real-Time Properties of Resource-Bound Process Algebra

2009 ◽  
Vol E92-A (11) ◽  
pp. 2781-2789 ◽  
Author(s):  
Junkil PARK ◽  
Jungjae LEE ◽  
Jin-Young CHOI ◽  
Insup LEE
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Process Algebra ◽  
Resource Bound

scholarly journals Analysis of DIRAC's behavior using model checking with process algebra

2012 ◽  
Vol 396 (5) ◽  
pp. 052061
Author(s):  
Daniela Remenska ◽  
Jeff Templon ◽  
Tim Willemse ◽  
Henri Bal ◽  
Kees Verstoep ◽  
...  
Keyword(s):  
Model Checking ◽  
Process Algebra
Sign in / Sign up

Export Citation Format

Share Document