Modular Semantics for Transition System Specifications with Negative Premises
2013 (English)In: Proceedings of the 24th International Conference on Concurrency Theory / [ed] Pedro R. D'Argenio & Hernán Melgratti, Heidelberg: Springer Berlin/Heidelberg, 2013, 46-60 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Heidelberg: Springer Berlin/Heidelberg, 2013. 46-60 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8052
Structural Operational Semantics, Well-Supported Proof, Conservative Extensions
Computer and Information Science
IdentifiersURN: urn:nbn:se:hh:diva-23495DOI: 10.1007/978-3-642-40184-8_5ScopusID: 2-s2.0-84882769400ISBN: 978-3-642-40183-1ISBN: 978-3-642-40184-8OAI: oai:DiVA.org:hh-23495DiVA: diva2:645854
24th International Conference on Concurrency Theory, CONCUR 2013, Buenos Aires, Argentina, 27–30 August 2013
FundereLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications