A Decidable Probability Logic for Timed Probabilistic Systems

Details A Decidable Probability Logic for Timed Probabilistic Systems A Decidable Probability Logic for Timed Probabilistic Systems

2004-11-30

arxiv.org/abs/cs/0411100v2

Computer Science

Logic in Computer Science

Scientific paper

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to Semi-Markov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering also predicates on clock. We prove that results on Semi Markov Processes hold also for Probabilistic Timed Automata for both the two semantics considered. Moreover, we prove that results for Markov Processes shown in [Beauquier et al. 2002] are extensible to Probabilistic Timed Automata where urgent semantics is considered.

Affiliated with

Also associated with

No associations

Rating

A Decidable Probability Logic for Timed Probabilistic Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Decidable Probability Logic for Timed Probabilistic Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Decidable Probability Logic for Timed Probabilistic Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13834