<?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>00000ntmaa22000003a 4500</leader>
  <controlfield tag="001">UP-8027390931316571412</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20260225101910.0</controlfield>
  <controlfield tag="006">a     r    |||| u|</controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">260225s2025    xx    a r   b|||| u|eng d</controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">UPVT-00020035671</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">UPTC</subfield>
   <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2="0">
   <subfield code="a">LG 993.5 2025 C66</subfield>
   <subfield code="b">A33</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Afable, Mar Elden C.</subfield>
   <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">On lazy soundness of robustness diagram with loop and time controls</subfield>
   <subfield code="c">Mar Elden C. Afable; 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">xi, 78 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">rdamedia</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="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 the author/adviser-NO.</subfield>
  </datafield>
  <datafield tag="506" ind1=" " ind2=" ">
   <subfield code="a">Available only for those bound by confidentiality agreement-NO.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">This study formalizes the notion of lazy soundness in Robustness Diagrams with Loop and Time controls (RDLT's), particularly in the context of systems exhibiting parallel activities. Lazy soundness is a relaxation of classical soundness that tolerates the non-completion of certain concurrent activities, provided that at least one valid execution path leads to system completion. To capture this, the study introduces the concept of Combined Activity Structures (CAS), derived from maximal activity structures (MAS), and proposes structural conditions and algorithms to verify lazy soundness in RDLTS. A modified complaint processing system is modeled to demonstrate the applicability of the framework, where lazy soundness is enforced through shared re-sources with limited availability. The study also presents the Lazy RDLT Soundness Verification Algorithm (LRSVA) and proves its time and space complexities. Additionally, it explores the decomposition of RDLTs into Petrinets, showing that lazy soundness is preserved under this transformation. This work advances the theoretical understanding of soundness in concurrent systems and opens avenues for future research on automated verification and generalized soundness in parallel workflows.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Formal methods (Computer science)</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">A33</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
