2018 18th International Conference on Application of Concurrency to System Design (ACSD)最新文献

Team Coordination Based on Causal Nets with Synchronous Channels 基于同步通道因果网络的团队协调

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/ACSD.2018.00009

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":"https://doi.org/10.1109/ACSD.2018.00009","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.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134544527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Message from the ACSD 2018 Program Chairs 2018年ACSD项目主席致辞

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/acsd.2018.00005

T. Chatain, R. Grosu

引用次数: 0

Fault-Free Refinements for Interface Automata 接口自动机的无故障改进

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/ACSD.2018.00017

Ayleen Schinko, W. Vogler

引用次数: 3

Optimal-Cost Reachability Analysis Based on Time Petri Nets 基于时间Petri网的最优成本可达性分析

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/ACSD.2018.000-1

H. Boucheneb, D. Lime, O. Roux, Charlotte Seidner

引用次数: 2

ACSD 2018 Invited Talk Abstract ACSD 2018特邀演讲摘要

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/acsd.2018.000-5

引用次数: 0

Symbolically Aligning Observed and Modelled Behaviour 象征性地将观察到的和模拟的行为对齐

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/ACSD.2018.00008

Vincent Bloemen, J. Pol, Wil M.P. van der Aalst

{"title":"Symbolically Aligning Observed and Modelled Behaviour","authors":"Vincent Bloemen, J. Pol, Wil M.P. van der Aalst","doi":"10.1109/ACSD.2018.00008","DOIUrl":"https://doi.org/10.1109/ACSD.2018.00008","url":null,"abstract":"Conformance checking is a branch of process mining that aims to assess to what degree a given set of log traces and a corresponding reference model conform to each other. The state-of-the-art approach in conformance checking is based on the concept of alignments. Alignments express the observed behaviour in terms of the reference model while minimizing the number of mismatches between the event data and the model. The currently known best algorithm for constructing alignments applies the A* shortest path algorithm for each trace of event data. In this work, we apply insights from the field of model checking to aid conformance checking. We investigate whether alignments can be computed efficiently via symbolic reachability with decision diagrams. We designed a symbolic algorithm for computing shortest-paths on graphs restricted to 0- and 1-cost edges (which is typical for alignments). We have implemented our approach in the LTSmin model checking toolset and compare its performance with the A* implementation supported by ProM. We generated more than 4000 experiments (Petri net model and log trace combinations) by setting various parameters, and analysed performance and related these to structural properties. Our empirical study shows that the symbolic technique is in general better suited for computing alignments on large models than the A* approach. Our approach is better performing in cases where the size of the state-space tends to blow up. Based on our experiments we conclude that the techniques are complementary, since there is a significant number of cases where A* outperforms the symbolic technique and vice versa.","PeriodicalId":242721,"journal":{"name":"2018 18th International Conference on Application of Concurrency to System Design (ACSD)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114520536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

SONCraft: A Tool for Construction, Simulation, and Analysis of Structured Occurrence Nets SONCraft:一个构建、模拟和分析结构化发生网的工具

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/ACSD.2018.00010

Bowen Li, B. Randell, Anirban Bhattacharyya, Talal Alharbi, M. Koutny

引用次数: 5

Timed Automata with Parametric Updates 具有参数更新的定时自动机

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/ACSD.2018.000-2

É. André, D. Lime, Mathias Ramparison

引用次数: 5

On Reconciling Concurrency, Sequentiality and Determinacy for Reactive Systems—A Sequentially Constructive Circuit Semantics for Esterel 论反应系统的并发性、顺序性和确定性的协调——esterl的顺序构造电路语义

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/ACSD.2018.00018

Alexander Schulz-Rosengarten, Steven Smyth, R. V. Hanxleden, Michael Mendler

{"title":"On Reconciling Concurrency, Sequentiality and Determinacy for Reactive Systems—A Sequentially Constructive Circuit Semantics for Esterel","authors":"Alexander Schulz-Rosengarten, Steven Smyth, R. V. Hanxleden, Michael Mendler","doi":"10.1109/ACSD.2018.00018","DOIUrl":"https://doi.org/10.1109/ACSD.2018.00018","url":null,"abstract":"A classic challenge in designing reactive systems is how to reconcile concurrency with determinacy. Synchronous languages, such as Esterel, SyncCharts or SCADE, resolve this by providing a semantics that does not depend on run-time scheduling decisions. Esterel's circuit semantics is grounded in physics: An Esterel program is considered valid (constructive) iff it corresponds to a delay-insensitive circuit. The circuit semantics provides on the one hand a mathematically grounded semantics, based on constructive logic, on the other hand it gives a direct path to a data-flow style software implementation. However, Esterel's constructive semantics entails a rather restricted regime for handling sequential accesses to shared data. Thus many programs are rejected as being non-constructive, even though they have a very natural, determinate interpretation. We here present a sequentially constructive circuit semantics (SCC) that lifts this restriction, by distinguishing sequential and concurrent execution contexts. This permits an imperative style familiar to programmers versed in C, for example, without leaving the sound physical foundation of synchronous programming.","PeriodicalId":242721,"journal":{"name":"2018 18th International Conference on Application of Concurrency to System Design (ACSD)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127748271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

[Copyright notice] (版权)

2018 18th International Conference on Application of Concurrency to System Design (ACSD) Pub Date : 2018-06-01 DOI: 10.1109/acsd.2018.00003

引用次数: 0