Reachability analysis for timed automata using max-plus algebra
DOI10.1016/J.JLAP.2011.10.004zbMATH Open1279.68214OpenAlexW2109586922WikidataQ114851545 ScholiaQ114851545MaRDI QIDQ444476FDOQ444476
Søren Ravn, Qi Lu, Michael Madsen, Martin Milata, Kim G. Larsen, Uli Fahrenberg
Publication date: 14 August 2012
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2011.10.004
Formal languages and automata (68Q45) Data structures (68P05) Max-plus and related algebras (15A80) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kronos: A verification tool for real-time systems
- The octagon abstract domain
- A theory of timed automata
- Generators, extremals and bases of max cones
- Symbolic model checking for real-time systems
- Reactive Systems
- Formal Modeling and Analysis of Timed Systems
- Inferring Min and Max Invariants Using Max-Plus Polyhedra
- Correctness kernels of abstract interpretations
- Verification, Performance Analysis and Controller Synthesis for Real-Time Systems
- Static Analysis in Disjunctive Numerical Domains
- Reachability analysis for timed automata using max-plus algebra
- Tools and Algorithms for the Construction and Analysis of Systems
- The Minkowski theorem for max-plus convex sets
Cited In (14)
- On the complexity of strongly connected components in directed hypergraphs
- Tropical Fourier-Motzkin elimination, with an application to real-time verification
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems
- Optimal time-bounded reachability analysis for concurrent systems
- Performance evaluation of (max,+) automata
- Reachability analysis for timed automata using max-plus algebra
- Formal analysis and control of timed automata with guards using (max, +) and (min, +) algebras
- Computational techniques for reachability analysis of Max-Plus-Linear systems
- Fault localization of timed automata using maximum satisfiability
- Title not available (Why is that?)
- Conditional reachability of uncertain max plus linear systems
- Analysis and control of max-plus linear discrete-event systems: an introduction
- On the set-estimation of uncertain max-plus linear systems
- Decoupled fitness criteria for reactive systems
Uses Software
This page was built for publication: Reachability analysis for timed automata using max-plus algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444476)
