Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues
- 1 December 1990
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 26 (1) , 150-193
- https://doi.org/10.1007/bf02248590
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Cramer and Cayley-Hamilton in the max algebraLinear Algebra and its Applications, 1988
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturingIEEE Transactions on Automatic Control, 1985
- A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systemsACM Transactions on Computer Systems, 1984
- Les elements p-reguliers dans les dioïdesDiscrete Mathematics, 1979
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Projections in minimax algebraMathematical Programming, 1976
- Marked directed graphsJournal of Computer and System Sciences, 1971
- An Algebra for Network Routing ProblemsIMA Journal of Applied Mathematics, 1971
- Scheduling Parallel ComputationsJournal of the ACM, 1968
- Describing Industrial Processes with Interference and Approximating Their Steady-State BehaviourJournal of the Operational Research Society, 1962