Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras
From MaRDI portal
Publication:5026795
Recommendations
- Reachability analysis for timed automata using max-plus algebra
- Modelling and temporal evaluation of networked control systems using timed automata with guards and (max,+) algebra
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- On Continuous Timed Automata with Input-Determined Guards
- scientific article; zbMATH DE number 1956585
- Guarded autonomous transitions increase conciseness and expressiveness of timed automata
- An algebraic specification for CTL with time constraints
- Time-triggered conversion of guards for reachability analysis of hybrid automata
Cites work
- scientific article; zbMATH DE number 176728 (Why is no real title available?)
- A theory of timed automata
- Modeling and analysis of timed Petri nets using heaps of pieces
- Modelling and temporal evaluation of networked control systems using timed automata with guards and (max,+) algebra
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
- Performance evaluation of (max,+) automata
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of \((\max,+)\) automata: a behavioral approach
Cited in
(2)
This page was built for publication: Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026795)