Article

An Equivalence Based Method for Compositional Verification of the Linear Temporal Logic of Constraint Automata

Department of Computer Engineering, Sharif University of Technology and IPM School of Computer Science, Tehran, IRAN
Electronic Notes in Theoretical Computer Science 05/2006; 159:171-186. DOI: 10.1016/j.entcs.2005.12.068
Source: DBLP

ABSTRACT Constraint automaton is a formalism to capture the operational semantics of the channel based coordination language Reo. In general constraint automaton can be used as a formalism for modeling coordination of some components. In this paper we introduce a standard linear temporal logic and two fragments of it for expressing the properties of the systems modeled by constraint automata and show that the equivalence relation defined by Valmari et al. is the minimal compositional equivalence preserving that fragment of linear time temporal logic which has no next-time operator and has an extra operator distinguishing deadlocks and a slight modification of this equivalence is the minimal equivalence preserving linear time temporal logic without next-time operator. We present a compositional model checking method based on these equivalences for component-based systems modeled by labeled transition systems and constraint automata and a simplification of it for model checking the coordinating subsystems modeled by constraint automata.

Download full-text

Full-text

Available from: Ali Movaghar, Aug 17, 2015
0 Followers
 · 
69 Views
  • Source
    • "In general, compositional verification may be exploited more effectively when the model is naturally decomposable [17]. In the method of equivalence based compositional reduction components of a system are reduced with respect to an equivalence relation before building the model of the complete system [9] [6] [11]. An equivalence relation should have two properties in order to be useful in the equivalence based compositional reduction method: it should preserve the class of properties to be verified and also, it should be a congruence with respect to the syntactic operators which are used for composing of the components of the model. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Reo is a coordination language for modeling component connectors of component-based computing systems. Constraint automaton, as an extension of finite automaton, has been proposed as the operational semantics of Reo. In this paper, we introduce an extended definition of constraint automaton 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 composition of constraint automata using their join (production) and hiding operators. Based on these congruency results and by considering the temporal logic preservation properties of CFFD and NDFD equivalences, they can be used for reducing sizes of models before doing model checking based verification.
    Electronic Notes in Theoretical Computer Science 09/2009; 250(1):105-122. DOI:10.1016/j.entcs.2009.08.008
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Reo is an exogenous coordination language for compositional construction of the coordinating subsystems of component-based softwares. Constraint automaton has been proposed as the operational semantics of Reo networks. The main goal of this work is to prepare a model checking based verification environment for component-based systems, whose component connectors are modeled by Reo networks and constraint automata. We use the methods of compositional reduction and abstraction in model checking of component-based systems and their component connectors modeled by Reo.
    Computer Software and Applications Conference, 2007. COMPSAC 2007. 31st Annual International; 08/2007
  • [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    International Journal of Software Engineering and Knowledge Engineering 08/2008; 18(5):683-712. DOI:10.1142/S0218194008003775 · 0.26 Impact Factor
Show more