<?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-29T07:44:21Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/50040" metadataPrefix="oai_dc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/50040</identifier><datestamp>2024-08-21T12:39:36Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</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" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Extending EFSMs to specify and test timed systems with action durations and timeouts</dc:title>
   <dc:creator>García Merayo, María De Las Mercedes</dc:creator>
   <dc:creator>Núñez García, Manuel</dc:creator>
   <dc:creator>Rodríguez Laguna, Ismael</dc:creator>
   <dc:subject>519.8</dc:subject>
   <dc:subject>Automata</dc:subject>
   <dc:subject>Investigación operativa (Matemáticas)</dc:subject>
   <dc:subject>1207 Investigación Operativa</dc:subject>
   <dc:description>Formal Techniques for Networked and Distributed Systems - FORTE 2006.  International Conference on Formal Methods for Networked and Distributed Systems. SEP 26-29, 2006.   Paris, FRANCE.</dc:description>
   <dc:description>In this paper we introduce a timed extension of the extended finite state machines model. On the one hand, we consider that output actions take time to be performed. This time may depend on several factors such as the value of variables. On the other hand, our formalism allows to specify timeouts. In addition to present our formalism, we develop a testing theory. First, we define ten timed conformance relations and relate them. Second, we introduce a notion of timed test and define how to apply tests to IUTs.</dc:description>
   <dc:description>MCYT</dc:description>
   <dc:description>Junta de Castilla-La Mancha</dc:description>
   <dc:description>Marie Curie</dc:description>
   <dc:description>Sección Deptal. de Sistemas Informáticos y Computación</dc:description>
   <dc:description>Fac. de Ciencias Matemáticas</dc:description>
   <dc:description>TRUE</dc:description>
   <dc:description>pub</dc:description>
   <dc:date>2023-06-20T09:37:00Z</dc:date>
   <dc:date>2023-06-20T09:37:00Z</dc:date>
   <dc:date>2006</dc:date>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/50040</dc:identifier>
   <dc:identifier>0302-9743</dc:identifier>
   <dc:identifier>10.1007/11888116_27</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>TIC2003-07848-C02-01</dc:relation>
   <dc:relation>PAC-03-001</dc:relation>
   <dc:relation>MRTN-CT-2003-505121/TAROT</dc:relation>
   <dc:rights>restricted access</dc:rights>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>Springer Verlag</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>