hh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Modular Semantics for Transition System Specifications with Negative Premises
Swansea University, Swansea, Wales, United Kingdom. (Department of Computer Science)
Swansea University, Swansea, Wales, United Kingdom. (Department of Computer Science)
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Eindhoven University of Technology, Eindhoven, The Netherlands.ORCID-id: 0000-0002-4869-6794
2013 (engelsk)Inngår i: Proceedings of the 24th International Conference on Concurrency Theory / [ed] Pedro R. D'Argenio & Hernán Melgratti, Heidelberg: Springer Berlin/Heidelberg, 2013, s. 46-60Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Transition rules with negative premises are needed in the structural operational semantics of programming and specification constructs such as priority and interrupt, as well as in timed extensions of specification languages. The well-known proof-theoretic semantics for transition system specifications involving such rules is based on well-supported proofs for closed transitions. Dealing with open formulae by considering all closed instances is inherently non-modular - proofs are not necessarily preserved by disjoint extensions of the transition system specification. Here, we conservatively extend the notion of well-supported proof to open transition rules. We prove that the resulting semantics is modular, consistent, and closed under instantiation. Our results provide the foundations for modular notions of bisimulation such that equivalence can be proved with reference only to the relevant rules, without appealing to all existing closed instantiations of terms. © 2013 Springer-Verlag.

sted, utgiver, år, opplag, sider
Heidelberg: Springer Berlin/Heidelberg, 2013. s. 46-60
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8052
Emneord [en]
Structural Operational Semantics, Well-Supported Proof, Conservative Extensions
HSV kategori
Identifikatorer
URN: urn:nbn:se:hh:diva-23495DOI: 10.1007/978-3-642-40184-8_5Scopus ID: 2-s2.0-84882769400ISBN: 978-3-642-40183-1 ISBN: 978-3-642-40184-8 OAI: oai:DiVA.org:hh-23495DiVA, id: diva2:645854
Konferanse
24th International Conference on Concurrency Theory, CONCUR 2013, Buenos Aires, Argentina, 27–30 August 2013
Forskningsfinansiär
eLLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsTilgjengelig fra: 2013-09-05 Laget: 2013-09-05 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

fulltext(755 kB)156 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 755 kBChecksum SHA-512
770c9edeeaa0459a5d345dace1c70e8c3572e48557b30147c9ed1d41f59adc78ab8be3da1537f0f46b2d0eab7cc59378140315dde88513b96a70139bc5966a03
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Mousavi, Mohammad Reza

Søk i DiVA

Av forfatter/redaktør
Mousavi, Mohammad Reza
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 156 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 224 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf