Timed weak simulation verification and its application to stepwise refinement of real-time software

Authors:
Satoshi Yamane
Affiliations:
Graduate School of Natural Science, Kanazawa University, Kanazawa City, Japan
Venue:
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Year:
2005

Citing 10
Cited 0

Operational and algebraic semantics of concurrent processes

Handbook of theoretical computer science (vol. B)
A theory of timed automata

Theoretical Computer Science
Symbolic model checking for real-time systems

Information and Computation
What's decidable about hybrid automata?

Journal of Computer and System Sciences
Verification of real-time designs: combining scheduling theory with automatic formal verification

ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Automatic Symbolic Verification of Embedded Systems

IEEE Transactions on Software Engineering
Linear and Branching Structures in the Semantics and Logics of Reactive Systems

Proceedings of the 12th Colloquium on Automata, Languages and Programming
Verifying Abstractions of Timed Systems

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalences for Parallel Timer Processes

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
A Determinizable Class of Timed Automata

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-time software runs over real-time operating systems, and guaranteeing qualities are difficult. In this paper, we propose timed weak simulation relation verification and apply it to a refinement design method of real-time software. Moreover, we apply our proposed method to general real-time software scheduled by fixed-priority preemptive policy.