<?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-06-28T14:49:39Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/138.1" metadataPrefix="qdc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/138.1</identifier><datestamp>2025-07-04T00:18:14Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_17</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Egalitarian state-transition systems (extended version)</dc:title>
   <dc:creator>Martín Sánchez, Óscar</dc:creator>
   <dc:creator>Verdejo López, José Alberto</dc:creator>
   <dc:creator>Martí Oliet, Narciso</dc:creator>
   <dcterms:abstract>We argue that considering transitions at the same level as states, as first-class citizens, is advantageous in many cases. Namely, the use of atomic propositions on transitions, as well as on states, allows temporal formulas and strategies to be more powerful, general, and meaningful. We define egalitarian structures and logics, and show how they generalize well-known state-based, event-based, and mixed ones. We present translations from egalitarian to non-egalitarian settings that, in particular, allow the model checking of LTLR formulas using Maude’s LTL model checker. We have implemented these translations as a prototype in Maude itself.</dcterms:abstract>
   <dcterms:dateAccepted>2023-06-15T07:56:23Z</dcterms:dateAccepted>
   <dcterms:available>2023-06-15T07:56:23Z</dcterms:available>
   <dcterms:created>2023-06-15T07:56:23Z</dcterms:created>
   <dcterms:issued>2016</dcterms:issued>
   <dc:type>technical report</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/138.1</dc:identifier>
   <dc:identifier>XXXX-XXXX</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>StrongSoft (TIN2012–39391– C04–04)</dc:relation>
   <dc:relation>N-GREENS Software (S2013/ICE-2731)</dc:relation>
   <dc:rights>open access</dc:rights>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>