Orthomodular Lattices Induced by the Concurrency Relation

L. Bernardinello, L. Pomello, S. Rombolà
{"title":"Orthomodular Lattices Induced by the Concurrency Relation","authors":"L. Bernardinello, L. Pomello, S. Rombolà","doi":"10.4204/EPTCS.9.2","DOIUrl":null,"url":null,"abstract":"We apply to locally finite partially ordered sets a construction which associates a complete latticeto a given poset; the elements of the lattice are the closed subsets of a closure operator, definedstarting from the concurrency relation. We show that, if the partially ordered set satisfies a propertyof local density, i.e.: N-density, then the associated lattice is also orthomodular. We then consideroccurrence nets, introduced by C.A. Petri as models of concurrent computations, and define a familyof subsets of the elements of an occurrence net; we call those subsets causally closed because theycan be seen as subprocesses of the whole net which are, intuitively, closed with respect to the forwardand backward local state changes. We show that, when the net is K-dense, the causally closed setscoincide with the closed sets induced by the closure operator defined starting from the concurrencyrelation. K-density is a property of partially ordered sets introduced by Petri, on the basis of formeraxiomatizations of special relativity theory.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"47 1","pages":"12-21"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dialogues in cardiovascular medicine : DCM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.9.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We apply to locally finite partially ordered sets a construction which associates a complete latticeto a given poset; the elements of the lattice are the closed subsets of a closure operator, definedstarting from the concurrency relation. We show that, if the partially ordered set satisfies a propertyof local density, i.e.: N-density, then the associated lattice is also orthomodular. We then consideroccurrence nets, introduced by C.A. Petri as models of concurrent computations, and define a familyof subsets of the elements of an occurrence net; we call those subsets causally closed because theycan be seen as subprocesses of the whole net which are, intuitively, closed with respect to the forwardand backward local state changes. We show that, when the net is K-dense, the causally closed setscoincide with the closed sets induced by the closure operator defined starting from the concurrencyrelation. K-density is a property of partially ordered sets introduced by Petri, on the basis of formeraxiomatizations of special relativity theory.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
并发关系诱导的正交格
对于局部有限偏序集,我们应用了一个将完全格与给定偏序集联系起来的构造;晶格的元素是闭包运算符的封闭子集,从并发关系开始定义。我们证明,如果部分有序集满足局部密度的性质,即n密度,则其相关格也是正模的。然后,我们考虑由C.A. Petri引入的并发计算模型——发生网,并定义了一个发生网元素的子集族;我们称这些子集为因果封闭,因为它们可以被视为整个网络的子过程,直观地说,它们与正向和向后的局部状态变化有关。我们证明,当网络是k密集时,因果闭集与由从并发关系开始定义的闭包算子诱导的闭集一致。k密度是由Petri在狭义相对论的前公理化基础上引入的偏序集的一个性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Free fall and cellular automata A knowledge representation meta-model for rule-based modelling of signalling networks Generation, Ranking and Unranking of Ordered Trees with Degree Bounds Formalising Confluence in PVS Compositional model checking of concurrent systems, with Petri nets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1