Algebraic specification of concurrent systems

IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Theoretical Computer Science Pub Date : 1989-12-05 DOI:10.1016/0304-3975(89)90090-X
Stéphane Kaplan
{"title":"Algebraic specification of concurrent systems","authors":"Stéphane Kaplan","doi":"10.1016/0304-3975(89)90090-X","DOIUrl":null,"url":null,"abstract":"<div><p>This article presents an extension of the formalism of <em>algebraic specifications</em> to the specification of concurrent systems. The key concept is that of <em>process specifications</em>, which have two hierarchical layers: processes and data. Processes apply to data via an <em>application operator</em>, eventually yielding a set of data as a result. Syntax and semantics of process specifications are presented, with emphasis on methodological issues (how to write hierarchically consistent and complete specifications). A suitable notion of <em>observational congruence</em> is introduced and characterized. A notion of <em>implementation</em> is defined, and a general method for proving correction is considered, based on the notion of serializability proof. A primitive for putting specifications together, in parallel, is analyzed. Finally, richer primitives for building basic specifications are discussed. Our proposal is illustrated via several examples including the one of the systematic, stepwise development of a complex specification.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"69 1","pages":"Pages 69-115"},"PeriodicalIF":1.0000,"publicationDate":"1989-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0304-3975(89)90090-X","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/030439758990090X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 4

Abstract

This article presents an extension of the formalism of algebraic specifications to the specification of concurrent systems. The key concept is that of process specifications, which have two hierarchical layers: processes and data. Processes apply to data via an application operator, eventually yielding a set of data as a result. Syntax and semantics of process specifications are presented, with emphasis on methodological issues (how to write hierarchically consistent and complete specifications). A suitable notion of observational congruence is introduced and characterized. A notion of implementation is defined, and a general method for proving correction is considered, based on the notion of serializability proof. A primitive for putting specifications together, in parallel, is analyzed. Finally, richer primitives for building basic specifications are discussed. Our proposal is illustrated via several examples including the one of the systematic, stepwise development of a complex specification.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
并发系统的代数规范
本文将代数规范的形式化扩展到并发系统的规范。关键概念是流程规范,它有两个层次结构层:流程和数据。进程通过应用程序操作符应用于数据,最终产生一组数据。介绍了过程规范的语法和语义,重点是方法学问题(如何编写层次一致和完整的规范)。引入并描述了观测同余的合适概念。定义了实现的概念,并基于可序列化性证明的概念考虑了证明更正的一般方法。分析了将规范并行放在一起的原语。最后,讨论了用于构建基本规范的更丰富的原语。我们的建议是通过几个例子来说明的,包括一个复杂规范的系统的、逐步的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
期刊最新文献
Weakly leveled planarity with bounded span Respecting lower bounds in uniform lower and upper bounded facility location problem Efficient algorithms for the interval maximum coverage problem Editorial Board Finding trails in multigraphs with restricted transitions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1