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; 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.

0 Bookmarks
 · 
55 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Constraint automata are the first-proposed operational semantics of Reo coordination language. They can be composed not only by all well-defined composition operators of labeled transition systems but also by two new operators. The new operators are joining of constraint automata with respect to their common port names and hiding a port name in all transition labels. The operations of these two extra operators depend on the internal structures of the transition labels, while in the others each transition label is considered as a simple entity. An equivalence relation between transition systems is a congruence relation if the replacement of the components of a model by the equivalent ones always yields a model that is equivalent with the original one. Obviously, this definition of the congruency depends on the operators which are used to compose the components of models. This paper introduces four congruency results: we prove that failure-based equivalence relation CFFD (chaos-free failures divergences relation) is a congruence relation with respect to joining of constraint automata and also with respect to hiding port names in a constraint automaton. We also show that these are cases for equivalence relation NDFD (non-divergent failures divergences).
    International Journal of Computer Mathematics 09/2010; 87:2426-2443. · 0.54 Impact Factor
  • Source
    [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:105-122.
  • 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

Full-text (2 Sources)

Download
44 Downloads
Available from
Jun 5, 2014