On the complexity of computing the volume of a polyhedron
SIAM Journal on Computing
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
General distributions in process algebra
Lectures on formal methods and performance analysis
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Model checking stochastic automata
ACM Transactions on Computational Logic (TOCL)
Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Solving generalized semi-Markov decision processes using continuous phase-type distributions
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Enforcing Concurrent Temporal Behaviors
Electronic Notes in Theoretical Computer Science (ENTCS)
Performance evaluation of schedulers in a probabilistic setting
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
| Hi-index | 0.00 |
When testing a system, it is often necessary to execute a suspicious trace in a realistic environment. Due to nondeterministic choices existing in concurrent systems, such a particular trace may not be scheduled for execution. Thus it is useful to compute the probability of executing the trace. Our probabilistic model of real-time systems requires that for each transition, the period from the time when its enabling condition becomes satisfied to the time when it is fired is bounded and the length of the period obeys a probabilistic distribution. This model is not Markovian if the distribution is not exponential. Therefore it cannot be analyzed by Markov processes. We propose to use integration to calculate the probability for a path. Then we discuss the possibility to optimize the calculation.