Team Coordination Based on Causal Nets with Synchronous Channels

Dennis Schmitz, D. Moldt, Michael Haustermann, David Mosteller, Christian Röder
{"title":"Team Coordination Based on Causal Nets with Synchronous Channels","authors":"Dennis Schmitz, D. Moldt, Michael Haustermann, David Mosteller, Christian Röder","doi":"10.1109/ACSD.2018.00009","DOIUrl":null,"url":null,"abstract":"A project consist of a partially ordered set of tasks that need to be performed to reach the project's goals. Ordering the tasks and coordinating the individual actors are prerequisites for the success of a project. The sub-teams (groups) may be distributed in terms of space, time or organization. The groups have to plan their local (intra-group) tasks and coordinate their inter-group tasks while avoiding global deadlocks. Today, centralized approaches with a single diagram for the entire team are used to model the global task order and calculate its critical path. We propose that each group models its intra- and inter-group tasks in a single diagram. Causal nets represent the precedences in an ideal way. Inter-group tasks require a special treatment that we provide by extending causal nets with synchronous channels. These can be executed within the Renew IDE. We consider time aspects based on a mapping between those extended causal nets and Network Planning Technique (NPT). Supported by a Renew plugin we aggregate the separated groups' diagrams to a global NPT diagram to calculate the project's critical path. Beside the tool support for general project management, we present and discuss the support for agile and distributed software development projects. Our extensions preserve the efficient checking for consistent, partially ordered global project plans.","PeriodicalId":242721,"journal":{"name":"2018 18th International Conference on Application of Concurrency to System Design (ACSD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 18th International Conference on Application of Concurrency to System Design (ACSD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSD.2018.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A project consist of a partially ordered set of tasks that need to be performed to reach the project's goals. Ordering the tasks and coordinating the individual actors are prerequisites for the success of a project. The sub-teams (groups) may be distributed in terms of space, time or organization. The groups have to plan their local (intra-group) tasks and coordinate their inter-group tasks while avoiding global deadlocks. Today, centralized approaches with a single diagram for the entire team are used to model the global task order and calculate its critical path. We propose that each group models its intra- and inter-group tasks in a single diagram. Causal nets represent the precedences in an ideal way. Inter-group tasks require a special treatment that we provide by extending causal nets with synchronous channels. These can be executed within the Renew IDE. We consider time aspects based on a mapping between those extended causal nets and Network Planning Technique (NPT). Supported by a Renew plugin we aggregate the separated groups' diagrams to a global NPT diagram to calculate the project's critical path. Beside the tool support for general project management, we present and discuss the support for agile and distributed software development projects. Our extensions preserve the efficient checking for consistent, partially ordered global project plans.
基于同步通道因果网络的团队协调
项目由一组部分有序的任务组成,需要执行这些任务才能达到项目目标。安排任务和协调各个参与者是项目成功的先决条件。子团队(组)可以根据空间、时间或组织进行分布。组必须计划它们的本地(组内)任务并协调它们的组间任务,同时避免全局死锁。今天,整个团队使用带有单个图的集中式方法来建模全局任务顺序并计算其关键路径。我们建议每个组在单个图中对其组内和组间任务建模。因果网络以一种理想的方式代表了优先顺序。组间任务需要一种特殊的处理方式,我们用同步通道扩展因果网络。这些可以在Renew IDE中执行。我们考虑的时间方面是基于这些扩展因果网络和网络规划技术(NPT)之间的映射。在Renew插件的支持下,我们将分离组的图聚合为一个全局NPT图,以计算项目的关键路径。除了对一般项目管理的工具支持外,我们还介绍并讨论了对敏捷和分布式软件开发项目的支持。我们的扩展保留了对一致的、部分有序的全球项目计划的有效检查。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信