Flow faster: Efficient decision algorithms for probabilistic simulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4424 LNCS, Issue , 2007, Pages 155-169

  Zhang, Lijun ^a   Hermanns, Holger ^a   Eisenbrand, Friedrich ^b   Jansen, David N ^c,d  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

^c UNIVERSITY OF TWENTE   (Netherlands)

^d RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTER SIMULATION; DECISION THEORY; MARKOV PROCESSES; STOCHASTIC CONTROL SYSTEMS;

ABSTRACTION TECHNIQUES; DECISION ALGORITHMS; FLOW TECHNIQUES; PROBABILISTIC SIMULATIONS;

PROBABILISTIC LOGICS;

EID: 37149034180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_14     Document Type: Conference Paper

References (20)

1. R. K. Ahuja, T. L. Magnanti, J. B. Orlin: Network Flows: theory, algorithms, and applications. Prentice Hall, 1993
2. A. Aziz, K. Sanwal, V. Singhal, R. K. Brayton: Verifying Continuous Time Markov Chains. In CAV (1996) 269-276
3. C. Baier, B. Engelen, M. E. Majster-Cederbaum: Deciding Bisimilarity and Similarity for Probabilistic Processes. J. Comput. Syst. Sci. 60(1) (2000) 187-231
4. C. Baier, B. R. Haverkort, H. Hermanns, J.-P. Katoen: Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. Software Eng. 29(6) (2003) 524-541
5. C. Baier and H. Hermanns and J.-P. Katoen: Probabilistic weak simulation is decidable in polynomial time. Inf. Process. Lett. 89(3) (2004) 123-130
6. C. Baier, J.-P. Katoen, H. Hermanns, B. Haverkort: Simulation for Continuous-Time Markov Chains. In CONCUR (2002) 338-354
7. C. Baier, J.-P. Katoen, H. Hermanns, V. Wolf: Comparative branching-time semantics for Markov chains. Inf. Comput 200(2) (2005) 149-214
8. J. Cheriyan, T. Hagerup, K. Mehlhorn: Can a Maximum Flow be Computed in O(nm) Time? In Proc. ICALP (1990) 235-248
9. E. M. Clarke, O. Grumberg, D. E. Long: Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems 16(5) (1994) 1512-1542
10. G. Gallo, M. D. Grigoriadis, R. E. Tarjan: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1) (1989) 30-55
11. R. Gentilini, C. Piazza, A. Policriti: From Bisimulation to Simulation: Coarsest Partition Problems. J. Autom. Reasoning 31(1) (2003) 73-103
12. A. V. Goldberg: Recent Developments in Maximum Flow Algorithms (Invited Lecture). In SWAT (1998) 1-10
13. A. V. Goldberg, R. E. Tarjan: A new approach to the maximum-flow problem. J. ACM 35(4) (1988) 921-940
14. H. Hansson, B. Jonsson: A Logic for Reasoning about Time and Reliability. Formal Asp. Comput. 6(5) (1994) 512-535
15. M. R. Henzinger, T. A. Henzinger, P. W. Kopke: Computing Simulations on Finite and Infinite Graphs. In FOCS (1995) 453-462
16. B. Jonsson: Simulations Between Specifications of Distributed Systems. In CONCUR (1991) 346-360
17. B. Jonsson, K. G. Larsen: Specification and Refinement of Probabilistic Processes. In LICS (1991) 266-277
18. R. Milner: Communication and Concurrency. Prentice Hall, 1989
19. D. Parker: Implementation of Symbolic Model Checking for Probabilistic Systems. University of Birmingham, 2002
20. A. Schrijver: Theory of Linear and Integer Programming. Wiley, 1986