<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-06T16:56:51Z</responseDate>
  <request identifier="5611" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:5611</identifier>
        <datestamp>2024-03-06T09:29:42Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Parametric Verification of Weighted Systems</dc:title>
          <dc:creator>Christoffersen, Peter</dc:creator>
          <dc:creator>Hansen, Mikkel</dc:creator>
          <dc:creator>Mariegaard, Anders</dc:creator>
          <dc:creator>Ringsmose, Julian Trier</dc:creator>
          <dc:creator>Larsen, Kim Guldstrand</dc:creator>
          <dc:creator>Mardare, Radu</dc:creator>
          <dc:subject>parametric weighted transition systems</dc:subject>
          <dc:subject>parametric weighted CTL</dc:subject>
          <dc:subject>parametric model checking</dc:subject>
          <dc:subject>well-quasi ordering</dc:subject>
          <dc:subject>tool</dc:subject>
          <dc:description>This paper addresses the problem of parametric model checking for weighted transition systems. We consider transition systems labelled with linear equations over a set of parameters and we use them to provide semantics for a parametric version of weighted CTL where the until and next operators are themselves indexed with linear equations. The parameters change the model-checking problem into a problem of computing a linear system of inequalities that characterizes the parameters that guarantee the satisfiability. To address this problem, we use parametric dependency graphs (PDGs) and we propose a global update function that yields an assignment&#13;
to each node in a PDG. For an iterative application of the function, we prove that a fixed point assignment to PDG nodes exists and the set of assignments constitutes a well-quasi ordering, thus ensuring that the fixed point assignment can be found after finitely many iterations. To demonstrate the utility of our technique, we have implemented a prototype tool that computes the constraints on parameters for model checking problems.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Peter Christoffersen and Mikkel Hansen and Anders Mariegaard and Julian Trier Ringsmose and Kim Guldstrand Larsen and Radu Mardare</dc:contributor>
          <dc:date>2015</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 44, 2nd International Workshop on Synthesis of Complex Parameters (SynCoP'15) (2015)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.SynCoP.2015.77</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-56115</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SynCoP.2015.77</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
