<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-015-11-2196</article-id>
      <article-id pub-id-type="publisher-id">29477</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>F.3.2 - Semantics of Programming Languages</subject>
          <subject>F.4.2 - Grammars and Other Rewriting Systems</subject>
          <subject>H.1 - MODELS AND PRINCIPLES</subject>
          <subject>H.4.2 - Types of Systems</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Checking Semantics Equivalence of MDA Transformations in Concurrent Systems</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Barbosa</surname>
            <given-names>Paulo</given-names>
          </name>
          <email xlink:type="simple">paulo@dsc.ufcg.edu.br</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Ramalho</surname>
            <given-names>Franklin</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Figueiredo</surname>
            <given-names>Jorge</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Costa</surname>
            <given-names>Aniko</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Gomes</surname>
            <given-names>Luis</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Federal University of Campina Grande, Campina Grande, Brazil</addr-line>
        <institution>Federal University of Campina Grande</institution>
        <addr-line content-type="city">Campina Grande</addr-line>
        <country>Brazil</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">Universidade Nova de Lisboa, Lisboa, Portugal</addr-line>
        <institution>Universidade Nova de Lisboa</institution>
        <addr-line content-type="city">Lisboa</addr-line>
        <country>Portugal</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Paulo Barbosa (<email xlink:type="simple">paulo@dsc.ufcg.edu.br</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2009</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>06</month>
        <year>2009</year>
      </pub-date>
      <volume>15</volume>
      <issue>11</issue>
      <fpage>2196</fpage>
      <lpage>2224</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/EF07AA0F-8444-5082-A213-FBFC80F6A025">EF07AA0F-8444-5082-A213-FBFC80F6A025</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/7000889">7000889</uri>
      <permissions>
        <copyright-statement>Paulo Barbosa, Franklin Ramalho, Jorge Figueiredo, Aniko Costa, Luis Gomes</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>In a previous work we have proposed an extension to the four-layer MDAarchitecture promoting formal verification for semantics preserving model transformations. We analyzed semantics equivalence in transformations involving Platform Specific Models (PSM s). In this paper, considering concurrent systems domain, we show how this extended MDA architecture copes with the correctness verification of horizontal model transformations involving Platform Independent Models (PIM s). Our approach is supported by four formal techniques: behavioral equivalence relation, category the-ory, bisimulation and model-checking. This set of techniques allows the analysis of semantics equivalence between system model before and after transformation enablingthe decomposition of the system model into a set of concurrent sub-models, considered as components. The validation of our approach occurs in a net splitting operation,where PIM s are defined as Petri nets models according to the PNML metamodel with transformations representing formal operations in this domain.</p>
      </abstract>
    </article-meta>
  </front>
</article>
