Supervisory control of (,+) automata: a behavioral approach

DOI10.1007/S10626-009-0083-6zbMATH Open1180.93068OpenAlexW2087816883MaRDI QIDQ843993FDOQ843993

Authors: Jan Komenda, Sébastien Lahaye, Jean-Louis Boimond 

Publication date: 18 January 2010

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-009-0083-6

Recommendations

• Supervisory control of (max,+) automata: extensions towards applications
• New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
• A characterization of realizable behavior in supervisory control of timed event graphs
• scientific article; zbMATH DE number 4041696
• Supervisory Control with Complete Observations

zbMATH Keywords

Hadamard productsupervisory control\((\max,+)\)-automatasupremal controllable formal power series

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Hierarchical systems (93A13) Discrete event control/observation systems (93C65)

Cites Work

• Title not available (Why is that?)
• A theory of timed automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modeling and analysis of timed Petri nets using heaps of pieces
• Performance evaluation of (max,+) automata
• Title not available (Why is that?)
• On observability of discrete-event systems
• Just in time control of constrained \((max,+)\)-linear systems
• Supervisory control of timed discrete-event systems
• Masked prioritized synchronization for interaction and control of discrete event systems
• Series which are both max-plus and min-plus rational are unambiguous

Cited In (13)

• Simulations and bisimulations for max-plus automata
• New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
• Performance safety enforcement in strongly connected timed event graphs
• Determinization of timed Petri nets behaviors
• Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras
• Modeling and analysis of switching max-plus linear systems with discrete-event feedback
• Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics
• String execution time for finite languages: max is easy, min is hard
• Supervisory control of (max,+) automata: extensions towards applications
• Compositions of (max,+) automata
• Switched max-plus linear-dual inequalities: cycle time analysis and applications
• Coinduction in concurrent timed systems
• Towards a tropical automaton product minimizing global completion times

This page was built for publication: Supervisory control of \((\max,+)\) automata: a behavioral approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843993)