Sequential composition of linear systems' clans

DOI10.1016/j.ins.2016.02.016zbMath1427.68219OpenAlexW2255347072MaRDI QIDQ2279738

Dmitry A. Zaitsev

Publication date: 13 December 2019

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.02.016

zbMATH Keywords

Petri netsparse linear systemclansequential compositioncollapse of weighted graphdeadlock control

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• TINA
• CSparse

Cites Work

• On parallel multisplitting block iterative methods for linear systems arising in the numerical solution of Euler equations
• Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems
• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
• On efficient sparse integer matrix Smith normal form computations
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Robustness of deadlock control for a class of Petri nets with unreliable resources
• Direct Methods for Sparse Linear Systems
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Theory and Application of Graphs
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item