<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000ntmaa22000002i 4500</leader>
  <controlfield tag="001">UP-8027390931312009578</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20260212155533.0</controlfield>
  <controlfield tag="006">m|||||o||d||||||||</controlfield>
  <controlfield tag="007">cr |||||||||||</controlfield>
  <controlfield tag="008">260212s2025    xx    a     b ||| u eng  </controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">UPVT-00020035090</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">UPTC</subfield>
   <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
   <subfield code="a">LG 993.5 2025 C66</subfield>
   <subfield code="b">G28</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Gabitanan, Rugie C.</subfield>
   <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">A matrix representation for the verification of free-choiceness of Robustness Diagram with Loop and Time Controls</subfield>
   <subfield code="c">Rugie C. Gabitanan ; Jasmine A. Malinao, adviser.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="0">
   <subfield code="a">Tacloban City</subfield>
   <subfield code="b">Division of Natural Sciences and Mathematics, University of the Philippines Tacloban College</subfield>
   <subfield code="c">2025.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">xii, 79 leaves</subfield>
   <subfield code="b">illustrations</subfield>
   <subfield code="c">31 cm.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
   <subfield code="a">text</subfield>
   <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
   <subfield code="a">unmediated</subfield>
   <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
   <subfield code="a">volume</subfield>
   <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
   <subfield code="a">Undergraduate thesis (Bachelor of Science in Computer Science) -- University of the Philippines, Tacloban.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
   <subfield code="a">Includes bibliographical references.</subfield>
  </datafield>
  <datafield tag="506" ind1=" " ind2=" ">
   <subfield code="a">Available to the general public-YES.</subfield>
  </datafield>
  <datafield tag="506" ind1=" " ind2=" ">
   <subfield code="a">Available only after consultation with author/adviser-NO.</subfield>
  </datafield>
  <datafield tag="506" ind1=" " ind2=" ">
   <subfield code="a">Available only by for those bound by confidentiality agreement-NO.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">Workflow models aid in effective system representation and help in the assessment and improvement of various system qualities defined over some structural or behavioral aspects of their model properties. This research focuses on a multidimensional workflow, called the Robustness Diagram with Loop and Time Controls (or RDLT), and its free-choice property for model verification. Free-choiceness is critical to induce behaviors like race condition avoidance. To date, there is still no supporting algebraic representations for an efficient verification of free-choiceness of RDLTs. To address this gap, this paper presents a matrix-based representation for RDLTs to aid in automating the verification of checking free-choiceness in RDLTs. In particular, this research employs verification focusing on structural analysis of related components and their adjacencies and constraint matrices for verifying E-distinct PCS free-choice. This also evaluates their shared neighborhood and simultaneous reachability of siblings for verifying to-step PCN free-choice. Both stages in the verification are supported by a set of formally proven lemmas and theorems, ensuring the correctness of the verification process. Overall, this work contributes toward improving efficiency and reducing manual errors in analyzing complex workflow models. </subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Software engineering.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Malinao, Jasmine A.</subfield>
   <subfield code="e">adviser.</subfield>
  </datafield>
  <datafield tag="842" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FI</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">UP</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPTAC</subfield>
   <subfield code="b">UPTAC</subfield>
   <subfield code="h">LG 993.5 2025 C66</subfield>
   <subfield code="i">G28</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
