Answers are grounded in this paper and cite their sources.
This paper proposes analytical approaches to solve the problem of generalised marking constraints enforced on partially controllable and observable timed event graphs. For this purpose, the Min-Plus algebra formalisms is used to describe the behaviour of these graphs and to translate the specifications to be satisfied. Sufficient conditions for the existence of causal control laws that ensure compliance with the constraints are established by manipulating Min-Plus equations and inequalities. An application of a disassembly system is carried out to demonstrate and validate the theoretical results.
No takes yet. Share an insight, caveat, or question.
Bouazza et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: