Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet

Simple item page
dc.contributor.authorAceto, Luca
dc.contributor.authorFrutos Escrig, David De
dc.date.accessioned2023-06-20T03:31:45Z
dc.date.available2023-06-20T03:31:45Z
dc.date.issued2011-04-01
dc.description.abstractThis note shows that the complete and the ready simulation preorders do not have a finite inequational basis over the language BCCSP when the set of actions is a singleton. Moreover, the equivalences induced by those preorders do not have a finite (in)equational axiomatization either. These results are in contrast with a claim of finite axiomatizability for those semantics in the literature, which was based on the erroneous assumption that they coincide with complete trace semantics in the presence of a singleton set of actions.en
dc.description.departmentSección Deptal. de Sistemas Informáticos y Computación
dc.description.facultyFac. de Ciencias Matemáticas
dc.description.facultyInstituto de Matemática Interdisciplinar (IMI)
dc.description.refereedTRUE
dc.description.sponsorshipIcelandic Fund for Research
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/20634
dc.identifier.citationAceto, L. & Frutos Escrig, D. «Complete and Ready Simulation Semantics Are Not Finitely Based over BCCSP, Even with a Singleton Alphabet». Information Processing Letters, vol. 111, n.o 9, abril de 2011, pp. 408-13. DOI.org (Crossref), https://doi.org/10.1016/j.ipl.2011.01.015.
dc.identifier.doi10.1016/j.ipl.2011.01.015
dc.identifier.issn0020-0190
dc.identifier.officialurlhttps//doi.org/10.1016/j.ipl.2011.01.015
dc.identifier.relatedurlhttp://www.sciencedirect.com/science/article/pii/S002001901100024X
dc.identifier.urihttps://hdl.handle.net/20.500.14352/43728
dc.issue.number9
dc.journal.titleInformation processing letters
dc.language.isoeng
dc.page.final413
dc.page.initial408
dc.publisherElsevier Science
dc.relation.projectID080039021
dc.relation.projectID100014021
dc.relation.projectIDTESIS (TIN2009-14312-C02-01)
dc.relation.projectIDDESAFIOS10 (TIN2009-14599-C03-01)
dc.relation.projectIDPROMETIDOSS2009/TIC-1465
dc.rights.accessRightsrestricted access
dc.subject.cdu004
dc.subject.keywordConcurrency
dc.subject.keywordProcess algebra
dc.subject.keywordComplete simulation
dc.subject.keywordReady simulation
dc.subject.keywordEquational logic
dc.subject.keywordNon-finitely based algebras
dc.subject.ucmInformática (Informática)
dc.subject.unesco1203.17 Informática
dc.titleComplete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabeten
dc.typejournal article
dc.volume.number111
dspace.entity.typePublication
relation.isAuthorOfPublicationfc861853-ad02-4152-b8b0-e0a8df6080dc
relation.isAuthorOfPublication.latestForDiscoveryfc861853-ad02-4152-b8b0-e0a8df6080dc

Download

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Frutos04elsevier.pdf
Size:
143.86 KB
Format:
Adobe Portable Document Format
Download

Collections

Artículos