Relating Hierarchy of Temporal Properties to Model Checking

Author(s):  
Ivana Černá ◽  
Radek Pelánek
2005 ◽  
Vol 128 (6) ◽  
pp. 311-324 ◽  
Author(s):  
Dimitar P. Guelev ◽  
Mark Ryan ◽  
Pierre Yves Schobbens

Author(s):  
Roméo Courbis ◽  
Pierre-Cyrille Héam ◽  
Olga Kouchnarenko

Author(s):  
MOHAMMAD IZADI ◽  
ALI MOVAGHAR

A component-based computing system consists of two main parts: a set of components and a coordination subsystem. Reo is an exogenous coordination language for compositional construction of the coordination subsystem. Constraint automaton has been defined as the operational semantics of Reo. The main goal of this paper is to prepare a model checking method for verifying linear time temporal properties of component-based systems whose coordinating subsystems are modeled by Reo and components are modeled by labeled transition systems. For this purpose, we introduce modified definitions of constraint automata and their composition operators by which, every constraint automaton can be considered as a labeled transition system and each labeled transition system can be translated into a constraint automaton. We show that failure-based equivalences CFFD and NDFD are congruences with respect to the composition operators of constraint automata. Also we present a method for compositional model checking of component-based systems using these equivalences for reducing the sizes of constraint automata models.


Author(s):  
André Carvalho ◽  
Joel Carvalho ◽  
Jorge Sousa Pinto ◽  
Simão Melo de Sousa

2011 ◽  
Vol 109 (3) ◽  
pp. 305-321 ◽  
Author(s):  
Artur Męski ◽  
Wojciech Penczek ◽  
Agata Półrola

Author(s):  
Armin Biere

One of the most important industrial applications of SAT is currently Bounded Model Checking (BMC). This technique is typically used for formal hardware verification in the context of Electronic Design Automation. But BMC has successfully been applied to many other domains as well. In practice, BMC is mainly used for falsification, which is concerned with violations of temporal properties. In addition, a considerable part of this chapter discusses complete extensions, including k-induction and interpolation. These extensions also allow to prove properties.


Author(s):  
Dimitar P. Guelev ◽  
Mark D. Ryan ◽  
Pierre Yves Schobbens

2005 ◽  
Vol 345 (1) ◽  
pp. 139-170 ◽  
Author(s):  
Luca de Alfaro ◽  
Marco Faella ◽  
Thomas A. Henzinger ◽  
Rupak Majumdar ◽  
Mariëlle Stoelinga

Sign in / Sign up

Export Citation Format

Share Document