Petri Nets

Jiacun Wang, William Tepfenhart
{"title":"Petri Nets","authors":"Jiacun Wang, William Tepfenhart","doi":"10.1201/9780429184185-8","DOIUrl":null,"url":null,"abstract":"Exercise 1 (Dickson’s Lemma). A quasi-order (A,≤) is a set A endowed with a reflexive and transitive ordering relation ≤. A well quasi order (wqo) is a quasi order (A,≤) s.t., for any infinite sequence a0a1 · · · in Aω, there exist indices i < j with ai ≤ aj . 1. Let (A,≤) be a wqo and B ⊆ A. Show that (B,≤) is a wqo. 2. Show that (N ] {ω},≤) is a wqo. 3. Let (A,≤) be a wqo. Show that any infinite sequence a0a1 · · · in Aω embeds an infinite increasing subsequence ai0 ≤ ai1 ≤ ai2 ≤ · · · with i0 < i1 < i2 < · · · .","PeriodicalId":195915,"journal":{"name":"Formal Methods in Computer Science","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Formal Methods in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9780429184185-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Exercise 1 (Dickson’s Lemma). A quasi-order (A,≤) is a set A endowed with a reflexive and transitive ordering relation ≤. A well quasi order (wqo) is a quasi order (A,≤) s.t., for any infinite sequence a0a1 · · · in Aω, there exist indices i < j with ai ≤ aj . 1. Let (A,≤) be a wqo and B ⊆ A. Show that (B,≤) is a wqo. 2. Show that (N ] {ω},≤) is a wqo. 3. Let (A,≤) be a wqo. Show that any infinite sequence a0a1 · · · in Aω embeds an infinite increasing subsequence ai0 ≤ ai1 ≤ ai2 ≤ · · · with i0 < i1 < i2 < · · · .
佩特里网
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信