메뉴 건너뛰기




Volumn 153, Issue 2 SPEC. ISS., 2006, Pages 97-116

Partial Order Reduction for Probabilistic Branching Time

Author keywords

ample set; Markov decision process; model checking; partial order reduction; PCTL; probabilistic visible bisimulation

Indexed keywords

COMPUTER SCIENCE; MARKOV PROCESSES; MATHEMATICAL MODELS;

EID: 33646407831     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.10.034     Document Type: Article
Times cited : (42)

References (25)
  • 1
    • 16244382037 scopus 로고    scopus 로고
    • Partial order reduction for probabilistic systems
    • IEEE Computer Society Press
    • Baier C., Größer M., and Ciesinski F. Partial order reduction for probabilistic systems. Proc. 1st QEST (2004), IEEE Computer Society Press 230-239
    • (2004) Proc. 1st QEST , pp. 230-239
    • Baier, C.1    Größer, M.2    Ciesinski, F.3
  • 2
    • 33646432550 scopus 로고    scopus 로고
    • Christel Baier. On the algorithmic verification of probabilistic systems. Universität Mannheim, 1998. Habilitation Thesis
  • 3
    • 21844505024 scopus 로고
    • Model checking of probabilistic and nondeterministic systems
    • FST & TCS
    • Bianco A., and de Alfaro L. Model checking of probabilistic and nondeterministic systems. FST & TCS. LNCS 1026 (1995) 499-513
    • (1995) LNCS , vol.1026 , pp. 499-513
    • Bianco, A.1    de Alfaro, L.2
  • 4
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • Clarke E., Emerson E., and Sistla A. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 2 (April 1986) 244-263
    • (1986) ACM Transactions on Programming Languages and Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.1    Emerson, E.2    Sistla, A.3
  • 5
    • 16244419032 scopus 로고    scopus 로고
    • Partial order reduction on concurrent probabilistic programs
    • IEEE Computer Society Press
    • D'Argenio P.R., and Niebert P. Partial order reduction on concurrent probabilistic programs. Proc. 1st QEST (2004), IEEE Computer Society Press 240-249
    • (2004) Proc. 1st QEST , pp. 240-249
    • D'Argenio, P.R.1    Niebert, P.2
  • 6
    • 33646412941 scopus 로고    scopus 로고
    • L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science, 1997
  • 7
    • 84945913752 scopus 로고    scopus 로고
    • Stochastic transition systems
    • Proc. 9th CONCUR
    • de Alfaro L. Stochastic transition systems. Proc. 9th CONCUR. LNCS 1466 (1998) 423-438
    • (1998) LNCS , vol.1466 , pp. 423-438
    • de Alfaro, L.1
  • 8
    • 33646386207 scopus 로고    scopus 로고
    • J. Desharnais. Labelled Markov Processes. PhD thesis, McGill University, 1999
  • 9
    • 84874739738 scopus 로고    scopus 로고
    • *. In Proc. CONCUR 2002, LNCS 2421
  • 10
    • 84995331101 scopus 로고
    • A partial order approach to branching time logic model checking
    • IEEE Computer Society Press
    • Gerth R., Kuiper R., Peled D., and Penczek W. A partial order approach to branching time logic model checking. Proc. 3rd ISTCS'95 (1995), IEEE Computer Society Press 130-139
    • (1995) Proc. 3rd ISTCS'95 , pp. 130-139
    • Gerth, R.1    Kuiper, R.2    Peled, D.3    Penczek, W.4
  • 11
    • 0003903001 scopus 로고
    • Time and Probability in Formal Design of Distributed Systems
    • Elsevier
    • Hansson H. Time and Probability in Formal Design of Distributed Systems. Series in Real-Time Safety Critical Systems (1994), Elsevier
    • (1994) Series in Real-Time Safety Critical Systems
    • Hansson, H.1
  • 12
    • 0003096318 scopus 로고
    • A logic for reasoning about time and reliability
    • Hansson H., and Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing 6 5 (1994) 512-535
    • (1994) Formal Aspects of Computing , vol.6 , Issue.5 , pp. 512-535
    • Hansson, H.1    Jonsson, B.2
  • 13
    • 0000863166 scopus 로고
    • An improvement in formal verification
    • FORTE94, Berne, Switzerland, Chapman & Hall
    • Holzmann G., and Peled D. An improvement in formal verification. Proc. Formal Description Techniques. FORTE94, Berne, Switzerland (October 1994), Chapman & Hall 197-211
    • (1994) Proc. Formal Description Techniques , pp. 197-211
    • Holzmann, G.1    Peled, D.2
  • 14
    • 58849164515 scopus 로고    scopus 로고
    • Static partial order reduction
    • Proc. TACAS
    • Kurshan R., Levin V., Minea M., Peled D., and Yenign H. Static partial order reduction. Proc. TACAS. LNCS 1384 (1998) 345-357
    • (1998) LNCS , vol.1384 , pp. 345-357
    • Kurshan, R.1    Levin, V.2    Minea, M.3    Peled, D.4    Yenign, H.5
  • 16
    • 0026222347 scopus 로고
    • Bisimulation through probabilistic testing
    • Larsen K., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 1 (1991) 1-28
    • (1991) Information and Computation , vol.94 , Issue.1 , pp. 1-28
    • Larsen, K.1    Skou, A.2
  • 17
    • 85010991128 scopus 로고
    • All from one, one for all: On model checking using representatives
    • Proc. 5th CAV
    • Peled D. All from one, one for all: On model checking using representatives. Proc. 5th CAV. LNCS 697 (1993) 409-423
    • (1993) LNCS , vol.697 , pp. 409-423
    • Peled, D.1
  • 18
    • 33646398378 scopus 로고    scopus 로고
    • D. Peled. Partial order reduction: Linear and branching time logics and process algebras. In [19], pages 79-88, 1996
  • 19
    • 33646424158 scopus 로고    scopus 로고
    • Peled D., Pratt V., and Holzmann G. (Eds), American Mathematical Society
    • In: Peled D., Pratt V., and Holzmann G. (Eds). Partial Order Methods in Verification. DIMACS volume 29(10) (1997), American Mathematical Society
    • (1997) DIMACS , vol.29 10
  • 21
    • 33646417398 scopus 로고    scopus 로고
    • R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995
  • 22
    • 0001609136 scopus 로고
    • Probabilistic simulations for probabilistic processes
    • Segala R., and Lynch N. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2 2 (1995) 250-273
    • (1995) Nordic Journal of Computing , vol.2 , Issue.2 , pp. 250-273
    • Segala, R.1    Lynch, N.2
  • 23
    • 0001176166 scopus 로고
    • A stubborn attack on state explosion
    • Valmari A. A stubborn attack on state explosion. Formal Methods in System Design 1 (1992) 297-322
    • (1992) Formal Methods in System Design , vol.1 , pp. 297-322
    • Valmari, A.1
  • 24
    • 33646434299 scopus 로고    scopus 로고
    • A. Valmari. Stubborn set methods for process algebras. In [19], pages 79-88, 1996
  • 25
    • 0025625503 scopus 로고
    • Reactive, generative, and stratified models of probabilistic processes
    • IEEE Computer Society Press
    • van Glabbeek R., Smolka S., Steffen B., and Tofts C. Reactive, generative, and stratified models of probabilistic processes. Proc. 5th LICS (1990), IEEE Computer Society Press 130-141
    • (1990) Proc. 5th LICS , pp. 130-141
    • van Glabbeek, R.1    Smolka, S.2    Steffen, B.3    Tofts, C.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.