Titlebook: Automata, Languages and Programming; 18th International C Javier Leach Albert,Burkhard Monien,Mario Rodrígue Conference proceedings 1991 Sp

博愛家

疾馳

Model-checking for probabilistic real-time systems,me Markov chains. The correctness of the algorithm is not obvious, because it analyzes the projection of a Markov process onto a finite state space. The projection process is not Markov, so our most significant result is that the model-checking algorithm works.

COWER

ALLEY

Grundlagen der Schwing-Dreh-Bewegungen,ulation. We propose and study a safety preorder for this semantics based on simulation and dealing with silent actions. We focus on regular safety properties and characterize them by both tree-automata and formulas of a branching time logic. We show that verifying safety properties on trees reduces to simulation testing.

創(chuàng)新

https://doi.org/10.1007/978-3-663-02500-9. The proof approach presented in them fails to be complete in a model with a fair scheduler. The main idea suggested here which allows for the development of a modular and complete proof system for fair termination is a new program property, called ..