{"title":"基本LOTOS方程语义的完备性","authors":"M. Massink, L. Rooijakkers","doi":"10.1109/FTDCS.1993.344208","DOIUrl":null,"url":null,"abstract":"The logical correspondence between the equational semantics of Basic LOTOS and is standard, derivational one is proven. A derivational semantics is traditionally given by means of a set of axioms and deduction rules which define a deduction system. With such semantics, some difficulties arise when dealing with deduction rules with negative premises; also, the proof that a transition cannot take place cannot be carried out within the formal system. On the other hand, in the equational semantics approach, a transition is viewed as the application of a triadic predicate. Such a function is defined by a set of equations, and this, in a natural way, allows for the use of negative information within the system. It is shown that for Basic LOTOS, when restricted to guarded recursion, both formal reasoning systems strongly correspond.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Completeness of the equational semantics for Basic LOTOS\",\"authors\":\"M. Massink, L. Rooijakkers\",\"doi\":\"10.1109/FTDCS.1993.344208\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The logical correspondence between the equational semantics of Basic LOTOS and is standard, derivational one is proven. A derivational semantics is traditionally given by means of a set of axioms and deduction rules which define a deduction system. With such semantics, some difficulties arise when dealing with deduction rules with negative premises; also, the proof that a transition cannot take place cannot be carried out within the formal system. On the other hand, in the equational semantics approach, a transition is viewed as the application of a triadic predicate. Such a function is defined by a set of equations, and this, in a natural way, allows for the use of negative information within the system. It is shown that for Basic LOTOS, when restricted to guarded recursion, both formal reasoning systems strongly correspond.<<ETX>>\",\"PeriodicalId\":251095,\"journal\":{\"name\":\"1993 4th Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 4th Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.1993.344208\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 4th Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1993.344208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Completeness of the equational semantics for Basic LOTOS
The logical correspondence between the equational semantics of Basic LOTOS and is standard, derivational one is proven. A derivational semantics is traditionally given by means of a set of axioms and deduction rules which define a deduction system. With such semantics, some difficulties arise when dealing with deduction rules with negative premises; also, the proof that a transition cannot take place cannot be carried out within the formal system. On the other hand, in the equational semantics approach, a transition is viewed as the application of a triadic predicate. Such a function is defined by a set of equations, and this, in a natural way, allows for the use of negative information within the system. It is shown that for Basic LOTOS, when restricted to guarded recursion, both formal reasoning systems strongly correspond.<>