<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><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-11-21T02:05:38Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/19007" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/19007</identifier><datestamp>2026-09-24T18:49:52Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Janicki, Ryszard</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Alqarni, Mohammad</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-04-01T20:15:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-04-01T20:15:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2016-06-17</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/19007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/13875</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Standard operational semantics of the majority of concurrency models is defined&#xd;
in terms of either sequences or step sequences, while standard concurrent history&#xd;
semantics is usually defined in terms of partial orders, stratified order structures (or&#xd;
structures equivalent to them as net processes).&#xd;
It is commonly assumed (first argued by N. Wiener in 1914) that any system run&#xd;
(execution) that can be observed by a single observer must be an interval order of&#xd;
event occurrences.&#xd;
However, generating interval orders directly is problematic for most models of&#xd;
concurrency, as the only feasible sequence representation of interval order is by using&#xd;
Fishburn Theorem (1970) and appropriate sequences of beginnings and endings of&#xd;
events involved. It was shown by Janicki and Koutny in 1997 that concurrent histories&#xd;
involving interval orders can be represented by interval order structures, but how these&#xd;
interval order structures could be derived for particular concurrent systems was not&#xd;
clear.&#xd;
My original contribution to knowledge is defining an interval order semantics for&#xd;
Petri Nets with Inhibitor Arcs. We start with introducing operational interval order&#xd;
semantics, and then we generalize the concept of net process to represent the set of&#xd;
equivalent executions modelled by interval orders.&#xd;
Next we will show that our interval processes correspond to appropriate interval&#xd;
order structures. Finally, we will prove that our model is equivalent to that of Janicki&#xd;
and Yin (2015) where novel interval traces are used to represent equivalent executions.&#xd;
We will also demonstrate that our model covers simpler cases where sequences or&#xd;
step sequences were used to represent system runs.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Computer Science</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Theoretical Computer Sceince</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Systems Modelling</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Concurrency</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Modelling Concurrent Systems with Interval Processes</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>