A Graph-Theoretic Approach for Timing Analysis and its Implementation
From MaRDI portal
Recommendations
Cited in
(17)- A rigorous methodology for specification and verification of business processes
- Using mappings to prove timing properties
- Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
- A theory of timed automata
- Formal timing analysis for distributed real-time programs
- A logic for reasoning about time and reliability
- A process algebra of communicating shared resources with dense time and priorities
- A temporal logic for real-time partial ordering with named transactions
- Optimizing path real-time logic for unified real-time system
- Counting for satisfiability by inverting resolution
- Steady state analysis of timed event graphs with time window constraints
- Algorithms for Extracting Timeliness Graphs
- scientific article; zbMATH DE number 744061 (Why is no real title available?)
- A temporal logic for real-time partial-ordering with named transactions
- An algebraic model for performance evaluation of timed event multigraphs
- scientific article; zbMATH DE number 969979 (Why is no real title available?)
- Integrating on-line performance visualization and real-time system design
This page was built for publication: A Graph-Theoretic Approach for Timing Analysis and its Implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728220)