<![CDATA[ IEEE Transactions on Systems, Man, and Cybernetics: Systems - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 6221021 2020September21<![CDATA[Table of contents]]>5010C13484461<![CDATA[IEEE Transactions on Systems, Man, and Cybernetics publication information]]>5010C2C273<![CDATA[Special Issue on Recent Advances in Petri Nets, Automata, and Discrete-Event Hybrid Systems]]>501034843487212<![CDATA[A2G2V: Automatic Attack Graph Generation and Visualization and Its Applications to Computer and SCADA Networks]]>5010348834983468<![CDATA[A Robust Control Approach to Automated Manufacturing Systems Allowing Multitype and Multiquantity of Resources With Petri Nets]]>5010349935141576<![CDATA[Robust Deadlock Prevention for Automated Manufacturing Systems With Unreliable Resources by Using General Petri Nets]]>5010351535271337<![CDATA[Supervisory Control of Deadlock-Prone Production Systems With Routing Flexibility and Unreliable Resources]]>5010352835401295<![CDATA[Toward an Improved Monitoring of Engineering Projects]]>5010354135531860<![CDATA[Stability Analysis for Homogeneous Hybrid Systems With Delays]]>501035543561719<![CDATA[An Extended Object Constraint Language for Adaptive Discrete Event Systems With Application to Reconfigurable Wireless Sensor Networks]]>5010356235762194<![CDATA[On Methodology for the Verification of Reconfigurable Timed Net Condition/Event Systems]]>5010357735912805<![CDATA[A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets]]>501035923597469<![CDATA[A Dynamic Data Slice Approach to the Vulnerability Analysis of E-Commerce Systems]]>5010359836122297<![CDATA[On Hierarchical Construction of the State Space of an Automated Manufacturing System Modeled With Petri Nets]]>state explosion problem which makes it a tough task or even impossible when the state space computation demands prohibitive cost (time and memory). We limit general resource allocation systems (RASs) to a certain class whose state space can be hierarchically constructed, yet it comprises various enough types of real-world discrete event systems, such as automated manufacturing systems. This paper focuses on a class of RASs modeled with Petri nets (PNs), where, through pure algebraic operations, a novel method to compute the state spaces is proposed, which is motivated by the superposition property. Given a PN model of a system and a target resource configuration, we first propose a special initial marking called the initial basis marking and compute the corresponding reachability graph. Then, we increase the capacity of the resource places in an incremental way and generate the reachability graphs by taking advantage of the PN structure and the previously computed reachability graph until the capacity function of resources reaches the target resource configuration. A complete enumeration of reachable states can be obtained by a recursive scheme. Experimental studies also demonstrate the efficiency of the proposed approach in terms of computational cost and its high-potential to cope with the state-explosion problem.]]>5010361336271673<![CDATA[Measurement and Computation of Profile Similarity of Workflow Nets Based on Behavioral Relation Matrix]]>relation profile based on behavioral profile. Based on the relation profile of a WF-net, behavioral relation matrix can be constructed. Additionally, we refine the complex correspondence and generate a group of behavioral relation submatrices from the behavioral relation matrix. By using them we present a new formula to measure the behavior similarity of two WF-nets. Finally, examples illustrate that our method can measure the similarity degree more accurately.]]>5010362836451819<![CDATA[Efficient Approach to Scheduling of Transient Processes for Time-Constrained Single-Arm Cluster Tools With Parallel Chambers]]>5010364636571807<![CDATA[Deadlock-Free Scheduling of Flexible Assembly Systems Based on Petri Nets and Local Search]]>estimation of distribution algorithm is developed to escape from local optima. Moreover, to improve population diversity, an acceptance criterion (AC) based on Pareto dominance is proposed. The chromosome representation, RA, perturbation strategy, and AC together support the cooperative aspect of local search for scheduling problems strongly.]]>5010365836691068<![CDATA[A Distributed Control Approach to Automated Manufacturing Systems With Complex Routes and Operations Using Petri Nets]]>5010367036841657<![CDATA[Resource Conflict Checking and Resolution Controller Design for Cross-Organization Emergency Response Processes]]>5010368537003546<![CDATA[A Humanoid Robot Learns to Recover Perturbation During Swinging Motion]]>${Q}$ -learning) is employed to explore relationship between actions and states that allow the robot to trigger a reaction to avoid falling. A self-organizing map (SOM) is employed using a circular topological neighborhood function to transform continuous exteroceptive information of the robot during stable swinging into a discrete representation of states. We take advantage of the SOM clustering and topology preservation in the perturbation detection. Swinging and recovery actions are generated from the same neural model using a multilayered multipattern central pattern generator. Experiments, which were carried out in the simulation and on the real humanoid robot (NAO), show that our approach allows humanoid robots to recover from pushing successfully by learning to switch from a rhythmic to an appropriate nonrhythmic behavior.]]>5010370137124578<![CDATA[Deterministic Policy Gradient With Integral Compensator for Robust Quadrotor Control]]>5010371337252405<![CDATA[TechRxiv]]>501037263726368<![CDATA[IEEE Systems, Man, and Cybernetics Society Information]]>5010C3C3103<![CDATA[Information For Authors]]>5010C4C4146