{"title":"The Principle of Comprehensive Modelling Applied to Data and Behaviour","authors":"A. McNeile","doi":"10.1145/2630768.2630773","DOIUrl":null,"url":null,"abstract":"In their paper \"Trace Semantics are Fully Abstract\" Nain and Vardi propose that denotational semantics of behavioural modelling formalisms should adhere to the \"Principle of Comprehensive Modelling\" which requires models are exhaustive of all possible circumstances. However their exploration of this principle is made only in the context of machines that use sets of single symbols to define their state and alphabet. We extend the application of the principle to the denotational semantics of machines that use data structures, rather than single symbols, for the definition of state and alphabet. We show that, in the context of modelling the interaction between data and behaviour, this extension enables a unification of what are normally considered distinct styles of behavioural composition.","PeriodicalId":223556,"journal":{"name":"International Workshop on Behaviour Modelling - Foundations and Applications","volume":"581 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Behaviour Modelling - Foundations and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2630768.2630773","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In their paper "Trace Semantics are Fully Abstract" Nain and Vardi propose that denotational semantics of behavioural modelling formalisms should adhere to the "Principle of Comprehensive Modelling" which requires models are exhaustive of all possible circumstances. However their exploration of this principle is made only in the context of machines that use sets of single symbols to define their state and alphabet. We extend the application of the principle to the denotational semantics of machines that use data structures, rather than single symbols, for the definition of state and alphabet. We show that, in the context of modelling the interaction between data and behaviour, this extension enables a unification of what are normally considered distinct styles of behavioural composition.