Discrete event dynamic systems最新文献_第2页

Switched max-plus linear-dual inequalities: cycle time analysis and applications 交换式最大加线性二元不等式：周期时间分析与应用

Discrete event dynamic systems Pub Date : 2024-02-01 DOI: 10.1007/s10626-023-00389-5

Davide Zorzenon, Jan Komenda, Jörg Raisch

{"title":"Switched max-plus linear-dual inequalities: cycle time analysis and applications","authors":"Davide Zorzenon, Jan Komenda, Jörg Raisch","doi":"10.1007/s10626-023-00389-5","DOIUrl":"https://doi.org/10.1007/s10626-023-00389-5","url":null,"abstract":"P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows. Their dynamics can be represented by max-plus linear-dual inequalities (LDIs), i.e., systems of linear dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches; ii. a complete trajectory of the robot including start-up and shut-down transients.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139663981","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}

引用次数: 0

A modular synthesis approach for the coordination of multi-agent systems: the multiple team case 多代理系统协调的模块合成方法：多团队案例

Discrete event dynamic systems Pub Date : 2024-01-26 DOI: 10.1007/s10626-024-00393-3

Marcelo Rosa, José E. R. Cury, Fabio L. Baldissera

{"title":"A modular synthesis approach for the coordination of multi-agent systems: the multiple team case","authors":"Marcelo Rosa, José E. R. Cury, Fabio L. Baldissera","doi":"10.1007/s10626-024-00393-3","DOIUrl":"https://doi.org/10.1007/s10626-024-00393-3","url":null,"abstract":"In this paper, we deal with the problem of coordinating multiple agents to accomplish a global task. This problem consists of a set of agents divided into teams of homogeneous agents that interact with each other in order to autonomously complete a common global task. Due to the fact that agents in a team are exactly the same both in hardware and control software, the open-loop behavior of any agent in a team can be represented by a template, as well as its local control specifications. Our approach is based on the Supervisory Control Theory and it derives sufficient conditions that allow us to synthesize for each team a local supervisor template from templates associated with the team and the global task model in such a way that, when this supervisor template is instantiated for the other agents in the team, the global task can be completed by the coordinated action of all agents in the system. Our sufficient conditions also guarantee that a computed set of supervisor templates does not need to be recomputed or reconfigured whenever agents are added or removed from teams. An example of 3D robotic construction is provided to illustrate our approach.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139587744","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}

引用次数: 0

Compositional non-blockingness verification of finite automata with prioritised events 具有优先事件的有限自动机的组合无阻塞性验证

Discrete event dynamic systems Pub Date : 2024-01-25 DOI: 10.1007/s10626-024-00394-2

Yiheng Tang, Thomas Moor

{"title":"Compositional non-blockingness verification of finite automata with prioritised events","authors":"Yiheng Tang, Thomas Moor","doi":"10.1007/s10626-024-00394-2","DOIUrl":"https://doi.org/10.1007/s10626-024-00394-2","url":null,"abstract":"This paper addresses the verification of non-blockingness for modular discrete-event systems, i.e., discrete-event systems that are composed from component models. For such systems, the explicit construction of a monolithic representation turns out intractable for relevant applications, since such a construction in general is of exponential cost w.r.t. the number of components. One well established approach to circumvent the need for a monolithic representation for the verification task at hand is to alternate (a) the substitution of individual components by abstractions and (b) the composition of only a small number of strategically chosen components at a time. When successful, one ends up with a single moderately sized automaton which does not represent the overall behaviour in any detail but which does block if and only if the original modular system fails to be non-conflicting. This approach is referred to as compositional verification and originates from the field of process algebra with more recent adaptations to finite automata models. The main contribution of the present study is the development of a number of abstraction rules valid for compositional verification of non-conflictingness in the presence of global event priorities, i.e., where high priority events from one component possibly preempt events with lower priority of all components.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"216 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139556086","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}

引用次数: 0

$$pi $$ HyFlow: formalism, semantics, and applications $$/pi $$ HyFlow：形式、语义和应用

Discrete event dynamic systems Pub Date : 2024-01-24 DOI: 10.1007/s10626-023-00390-y

Fernando Barros

{"title":"$$pi $$ HyFlow: formalism, semantics, and applications","authors":"Fernando Barros","doi":"10.1007/s10626-023-00390-y","DOIUrl":"https://doi.org/10.1007/s10626-023-00390-y","url":null,"abstract":"Simulation models have been described using different perspectives, or worldviews. In the process interaction world view (PI), every entity is modeled by a sequence of actions describing its life cycle, offering a comprehensive model that groups the events involving each entity. In this paper we describe (pi ) HyFlow, a formalism for representing hybrid models using a set of communicating processes. This set is dynamic, enabling processes to be created and destroyed at runtime. Processes are encapsulated into (pi ) HyFlow base models and communicate through shared memory. (pi ) HyFlow, however, can guarantee modularity by enforcing that models can only communicate by input and output interfaces. (pi ) HyFlow extends current PI approaches by providing support for HyFlow concepts of sampling and dense (continuous) outputs, in addition to the more traditional event-based communication. Likewise HyFlow, (pi ) HyFlow is a modeling & simulation formalism driven by expressiveness and performance analysis. We present (pi ) HyFlow semantics, and several applications to illustrate (pi ) HyFlow ability to describe a diversity of systems.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"19 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139557430","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}

引用次数: 0

Analysis and control of timed event graphs in (max,+) algebra for the active localization of time failures 分析和控制（max,+）代数中的定时事件图，主动定位时间故障

Discrete event dynamic systems Pub Date : 2024-01-16 DOI: 10.1007/s10626-023-00391-x

Ibis Velasquez, Yannick Pencolé, Euriell Le Corronc

引用次数: 0

Conflict-free electric vehicle routing problem: an improved compositional algorithm 无冲突电动汽车路由问题：一种改进的组合算法

Discrete event dynamic systems Pub Date : 2023-12-18 DOI: 10.1007/s10626-023-00388-6

Sabino Francesco Roselli, Martin Fabian, Knut Åkesson

{"title":"Conflict-free electric vehicle routing problem: an improved compositional algorithm","authors":"Sabino Francesco Roselli, Martin Fabian, Knut Åkesson","doi":"10.1007/s10626-023-00388-6","DOIUrl":"https://doi.org/10.1007/s10626-023-00388-6","url":null,"abstract":"The Conflict-Free Electric Vehicle Routing Problem (CF-EVRP) is a combinatorial optimization problem of designing routes for vehicles to execute tasks such that a cost function, typically the number of vehicles or the total travelled distance, is minimized. The CF-EVRP involves constraints such as time windows on the tasks’ execution, limited operating range of the vehicles, and limited capacity on the number of vehicles that a road segment can simultaneously accommodate. In previous work, the compositional algorithm ComSat was introduced to solve the CF-EVRP by breaking it down into sub-problems and iteratively solve them to build an overall solution. Though ComSat showed good performance in general, some problem instances took significant time to solve due to the high number of iterations required to find solutions for two sub-problems, namely the Routing Problem, and the Paths Changing Problem. This paper addresses the bottlenecks of ComSat and presents new formulations for both sub-problems in order to reduce the number of iterations required to find feasible solutions to the CF-EVRP. Experiments on sets of benchmark instances show the effectiveness of the presented improvements.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"104 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138714541","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}

引用次数: 0

Generation of mathematical programming representations for discrete event simulation models of timed petri nets 时间petri网离散事件仿真模型数学规划表示的生成

Discrete event dynamic systems Pub Date : 2023-12-06 DOI: 10.1007/s10626-023-00387-7

Mengyi Zhang, Arianna Alfieri, Andrea Matta

引用次数: 0

Mixed Nondeterministic-Probabilistic Automata 混合不确定性-概率自动机

Discrete event dynamic systems Pub Date : 2023-10-19 DOI: 10.1007/s10626-023-00375-x

Albert Benveniste, Jean-Baptiste Raclet

引用次数: 1

Multi-level control for multiple mobile robot systems 多移动机器人系统的多级控制

Discrete event dynamic systems Pub Date : 2023-10-18 DOI: 10.1007/s10626-023-00383-x

Elzbieta Roszkowska, Piotr Makowski-Czerski, Lukasz Janiec

{"title":"Multi-level control for multiple mobile robot systems","authors":"Elzbieta Roszkowska, Piotr Makowski-Czerski, Lukasz Janiec","doi":"10.1007/s10626-023-00383-x","DOIUrl":"https://doi.org/10.1007/s10626-023-00383-x","url":null,"abstract":"Abstract This paper contributes with a multi-level, hierarchical control system for a fleet of mobile robots sharing a common 2D motion space. The system consists of three levels, with the top level being a supervisor based on a discrete representation of the Multiple Mobile Robot System (MMRS), in which robot motion processes are seen as sequences of stages. The supervisor controls centrally the changes of their stages by robots, ensuring their collision-, and deadlock-free concurrent movement. The intermediate control level supervises locally the execution of robot motion on individual stages in a manner consistent with the decisions of the top level. The lowest level, robot control, is responsible for motion execution as determined by the local supervisor. We capitalize on some earlier results concerning the supervisory control of MMRS and propose a common framework for three supervisory control models. Then we propose relevant solutions for the local supervisors, in particular, a DES-based robot-motion-mode control and application of the Artificial Potential Field model for ensuring collision-free motion of two robots sharing a space sector. Next we assume simple robot control and subject the system to simulation experiments aimed at comparing the impact of the different solutions on the performance of MMRS.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135883895","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}

引用次数: 0

On tolerance of discrete systems with respect to transition perturbations 关于过渡扰动的离散系统的容限

Discrete event dynamic systems Pub Date : 2023-10-17 DOI: 10.1007/s10626-023-00386-8

Rômulo Meira-Góes, Eunsuk Kang, Stéphane Lafortune, Stavros Tripakis

引用次数: 4