Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Priority Assignment for Embedded Reactive Real-Time Systems
LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Efficient methods for embedded system design space exploration
Proceedings of the 37th Annual Design Automation Conference
Automatic abstraciton for worst-case analysis of discrete systems
DATE '00 Proceedings of the conference on Design, automation and test in Europe
STARS of MPEG decoder: a case study in worst-case analysis of discrete-event systems
Proceedings of the ninth international symposium on Hardware/software codesign
A vision for embedded software
CASES '01 Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems
STARS in VCC: complementing simulation with worst-case analysis
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
We propose a methodology for worst-case analysis of systems with discrete observable signals. The methodology can be used to verify different properties of systems such as power consumption, timing performance or resource utilization. We also propose an application of the methodology to timing analysis of embedded systems implemented on a single processor. The analysis provides a bound on the response time of such systems. It is typically very efficient, because it does not require a state space search.