Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
From MaRDI portal
Publication:2639765
Recommendations
Cites work
- A characterization of the minimum cycle mean in a digraph
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- An Algebra for Network Routing Problems
- Cramer and Cayley-Hamilton in the max algebra
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
- scientific article; zbMATH DE number 3906559 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- scientific article; zbMATH DE number 3313421 (Why is no real title available?)
- scientific article; zbMATH DE number 3378927 (Why is no real title available?)
- Les éléments p-réguliers dans les dioides
- Linear and combinatorial optimization in ordered algebraic structures
- Marked directed graphs
- Minimax algebra
- Modeling and analysis of communication and cooperation protocols using petri net based models
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
- Projections in minimax algebra
- Scheduling Parallel Computations
Cited in
(13)- A hierarchical approach to solving machine grouping and loading problems of flexible manufacturing systems
- Some complexity results in cyclic scheduling
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
- A modeling method for process systems and studies on the dynamical behavior
- Automatic generation of analytic model formulae in job shop production
- Analyse de fabrications non linéaires et répétitives à l'aide de graphes d'événements temporisés
- Performance evaluation of job-shop systems using timed event-graphs
- On the robustness of using balanced part mix ratios to determine cyclic part input sequences into flexible flow systems
- scientific article; zbMATH DE number 1262892 (Why is no real title available?)
- scientific article; zbMATH DE number 1784933 (Why is no real title available?)
- scientific article; zbMATH DE number 1836358 (Why is no real title available?)
- scientific article; zbMATH DE number 850970 (Why is no real title available?)
- New transience bounds for max-plus linear systems
This page was built for publication: Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639765)