Sequential composition of linear systems' clans
From MaRDI portal
Publication:2279738
Recommendations
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An efficient incremental algorithm for solving systems of linear diophantine equations
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
- Direct Methods for Sparse Linear Systems
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 4094832 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1888462 (Why is no real title available?)
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems
- On efficient sparse integer matrix Smith normal form computations
- On parallel multisplitting block iterative methods for linear systems arising in the numerical solution of Euler equations
- Parallel iterative methods for sparse linear systems
- Robustness of deadlock control for a class of Petri nets with unreliable resources
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Theory and Application of Graphs
This page was built for publication: Sequential composition of linear systems' clans
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279738)