Marked-Controlled Reconfigurable Workflow Nets

Marisa Llorens, Javier Oliver
{"title":"Marked-Controlled Reconfigurable Workflow Nets","authors":"Marisa Llorens, Javier Oliver","doi":"10.1109/SYNASC.2006.49","DOIUrl":null,"url":null,"abstract":"In previous studies, we have introduced marked-controlled net rewriting systems and a subclass of these called marked-controlled reconfigurable nets. The main goal of these models is to analyze, simulate and verify concurrent and distributed systems that are subject to structural dynamic changes. In a marked-controlled net rewriting system, a system configuration is described as a Petri net, and a change in configuration is described as a graph rewriting rule. A marked-controlled reconfigurable net is a marked-controlled net rewriting system where a change in configuration amounts to a modification in the flow relations of the places in the domain of the involved rule in accordance with this rule, independently of the context in which this rewriting applies. In both models, the enabling of a rule not only depends on the net topology, but also depends on the net marking according to control places. In this work, we introduce marked-controlled reconfigurable workflow nets, based on Van der Aalst's workflow nets and marked-controlled reconfigurable nets, in order to model workflow systems handling structural dynamic changes. A characterization of the soundness property for marked-controlled reconfigurable workflow nets is also provided","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2006.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In previous studies, we have introduced marked-controlled net rewriting systems and a subclass of these called marked-controlled reconfigurable nets. The main goal of these models is to analyze, simulate and verify concurrent and distributed systems that are subject to structural dynamic changes. In a marked-controlled net rewriting system, a system configuration is described as a Petri net, and a change in configuration is described as a graph rewriting rule. A marked-controlled reconfigurable net is a marked-controlled net rewriting system where a change in configuration amounts to a modification in the flow relations of the places in the domain of the involved rule in accordance with this rule, independently of the context in which this rewriting applies. In both models, the enabling of a rule not only depends on the net topology, but also depends on the net marking according to control places. In this work, we introduce marked-controlled reconfigurable workflow nets, based on Van der Aalst's workflow nets and marked-controlled reconfigurable nets, in order to model workflow systems handling structural dynamic changes. A characterization of the soundness property for marked-controlled reconfigurable workflow nets is also provided
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
标记控制的可重构工作流网络
在以前的研究中,我们已经介绍了标记控制的网络重写系统和其中的一个子类,称为标记控制的可重构网络。这些模型的主要目的是分析、模拟和验证受结构动态变化影响的并发和分布式系统。在标记控制的网络重写系统中,将系统配置描述为Petri网,将配置的变化描述为图重写规则。标记控制的可重构网络是一种标记控制的网络重写系统,其中配置的改变相当于根据该规则修改所涉及规则域内位置的流动关系,而独立于该重写应用的上下文。在这两种模型中,规则的启用不仅取决于网络拓扑结构,还取决于根据控制位置对网络进行标记。本文在Van der Aalst工作流网络和标记控制可重构工作流网络的基础上,引入标记控制可重构工作流网络,对处理结构动态变化的工作流系统进行建模。给出了标记控制的可重构工作流网络的稳健性表征
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithms and Results in Content-Based Visual Query of the Image Databases Resulting from Dicom Files A New k-means Based Clustering Algorithm in Aspect Mining A Framework for Scheduling Image Processing Applications in MedioGRID HTML Pattern Generator--Automatic Data Extraction from Web Pages Incremental Deterministic Planning
×
引用
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