Verification of multiprocess probabilistic protocols
Distributed Computing
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Verifying clocked transition systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Real-Time Systems, Abstractions, Languages, Design Methodologies, and Tools
Real-Time Systems, Abstractions, Languages, Design Methodologies, and Tools
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Foundations of Real-Time Computing: Formal Specifications and Methods
Foundations of Real-Time Computing: Formal Specifications and Methods
Termination of probabilistic concurrent programs: (extended abstract)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Verifying Automata Specifications of Probabilistic Real-time Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Verification of Digital and Hybrid Systems (Nato ASI Series (closed) / Nato ASI Subseries F
Verification of Digital and Hybrid Systems (Nato ASI Series (closed) / Nato ASI Subseries F
| Hi-index | 0.00 |
Many people have studied formal specification and verification methods of real-time systems all over the world. We can specify real-time systems using timed automata, and verify them using model-checking. Especially, recently, probabilistic timed automata and their model-checking have been developed in order to express the relative likelihood of the systemexhibiting certain behavior. Moreover, model-checking and probabilistic timed simulation verification methods of probabilistic timed automata have been developed. In this paper, we propose probabilistic timed transition systems by generalizing probabilistic timed automata, and propose deductive verification rules of probabilistic real-time linear temporal logic over probabilistic timed transition systems. As our proposed probabilistic timed transition system is a general computational model, we have developed general verification methods.