First passage time analysis of stochastic process algebra using partial orders

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

Volumn 2031 LNCS, Issue , 2001, Pages 220-235

  Ruys, Theo C ^a   Langerak, Rom ^a   Katoen, Joost Pieter ^a   Latella, Diego ^b   Massink, Mieke ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; NETWORK PROTOCOLS; NUMERICAL ANALYSIS; RANDOM PROCESSES; SEMANTICS; SYSTEM BUSES;

EVENT STRUCTURES; FINITE PREFIX; FIRST PASSAGE TIME; PARTIAL ORDER SEMANTICS; PROCESS ALGEBRAS; RECURSIVE PROCESS; STOCHASTIC PROCESS ALGEBRAS; STOCHASTIC TASK;

STOCHASTIC SYSTEMS;

EID: 84903119267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_16     Document Type: Conference Paper

References (34)

1. M. Bernardo and R. Gorricri. A Tutorial on EMPA: A Theory of Concurrent Processes with Nondctcrminism, Priorities, Probabilities and Time. Theoretical Computer Science, 202:1 54, 1998.
2. T. Bologncsi and E. Brinksma. Introduction to the ISO Specification Language LOTOS. Computer Networks and ISDN Systems, 14:25 59, 1987.
3. M. Bravctti and R. Gorricri. Interactive Generalized Semi-Markov Processes. In J. Hillston and M. Silva, editors, Proc. of PAPM'99, pages 83 98, Zaragoza, Spain, September 1999.
4. E. Brinksma, J.-P. Katocn, R. Langcrak, and D. Latclla. A Stochastic Causality-Based Process Algebra. The Computer Journal, 38(7):552 565, 1995.
5. P. R. D'Argcnio. Algebras and Automata for Timed and Stochastic Systems. PhD thesis, University of Twcntc, Enschcdc, The Netherlands, November 1999.
6. P. R. D'Argcnio, J.-P. Katocn, and E. Brinksma. An Algebraic Approach to the Specification of Stochastic Systems (extended abstract). In D. Grics and W.-P. dc Rocvcr, editors, Proc. of PROCOMET'98, pages 126 148, Shelter Island, New York, USA, 1998. Chapman & Hall.
7. P. Dauphin, F. Hartlcb, M. Kicnow, V. Mcrtsiotakis, and A. Quick. PEPP: Performance Evaluation of Parallel Programs User's Guide Version 3.3. Technical Report 17/93, IMMD VII, University of Erlangcn Nürnbcrg, Germany, 1993.
8. P. Dauphin, R. Hofmann, R. Klar, B. Mohr, A. Quick, M. Sicglc, and F. Sötz. ZM4/SIMPLE: a General Approach to Performance-Measurement and Evaluation of Distributed Systems. In T. L. Casavant and M. Singhal, editors, Advances in Distributed Computing: Concepts and Design. IEEE Computer Society Press, 1992.
9. J. Engclfrict. Branching Processes of Pctri Nets. Ada Informatica, 28(6):575 591, 1991.
10. J. Esparza. Model Checking Using Net Unfoldings. Science of Computer Programming, 23(2): 151 195, 1994.
11. J. Esparza, S. Römcr, and W. Voglcr. An Improvement of McMillan's Unfolding Algorithm. In T. Margaria and B. Steffen, editors, Proc. of TAG AS'96, LNCS 1055, pages 87 106, Passau, Germany, March 1996. Springer-Vcrlag.
12. E. R. Gansncr, E. Koutsofios, and S. C. N. an Kicm-Phong Vo. A Technique for Drawing Directed Graphs. IEEE Transactions on Software Engineering, 19(3):214 230, 1993.
13. N. Götz, U. Hcrzog, and M. Rcttclbach. Multiprocessor and Distributed System Design: The Integration of Functional Specification and Performance Analysis Using Stochastic Process Algebras. In L. Donaticllo and R. Nelson, editors, Proc. of PERFORMANCE'93, LNCS 729, pages 121 146, Rome, Italy, September 1993. Springcr-Vcrlag.
14. P. G. Harrison and B. Strulo. Stochastic Process Algebra for Discrete Event Simulation. In F. Bacclli, A. Jean-Marie, and I. Mitrani, editors, Quantitative Methods in Parallel Systems, Esprit Basic Research Scries, pages 18 37. Springcr-Vcrlag, 1995. Chapter 2.
15. F. Hartlcb. Stochastic Graph Models for Performance Evaluation of Parallel Programs and the Evaluation Tool PEPP. In N. Götz, U. Hcrzog, and M. Rcttclbach, editors, Proc. of the QMIPS Workshop on Formalisms, Principles and State-of-the-art, pages 207 224, Erlangcn/Pommcrsfcldcn, Germany, March 1993. Arbcits-bcricht Band 26, Number 14.
16. H. Hermanns. Interactive Markov Chains. PhD thesis, University of Erlangcn, Nürnbcrg, Germany, 1998.
17. H. Hermanns and J.-P. Katocn. Automated Compositional Markov Chain Generation for a Plain-Old Telephone System. Science of Computer Programming, 36(1):97 127, 2000.
18. U. Hcrzog. A Concept for Graph-Based Stochastic Process Algebras, Generally Distributed Activity Times, and Hierarchical Modelling. In M. Ribaudo, editor, Proc. of PAPM'96, pages 1 20. C.L.U.T. Press, 1996.
19. J. Hillston. A Compositional Approach to Performance Modelling. Distinguished Dissertations Scries. Cambridge University Press, 1996.
20. IEEE Computer Society. IEEE Standard for a High Performance Serial Bus, Std 1394-1995 edition, 1996.
21. R. Klar, P. Dauphin, F. Hartlcb, R. Hofmann, B. Mohr, A. Quick, and M. Sicglc. Messung and Modellierung Paralleler und Verteilter Rechensysteme (in german). Tcubncr-Vcrlag, Stuttgart, 1995.
22. R. Langcrak. Transformations and Semantics for LOTOS. PhD thesis, University of Twcntc, Enschcdc, The Netherlands, November 1992.
23. R. Langcrak. Deriving a Graph Grammar from a Complete Finite Prefix of an Unfolding. In I. Castcllani and B. Victor, editors, Proc. of EXPRESS'99, ENTCS 27, Eindhoven, The Netherlands, August 1999. Elsevier Science Publishers.
24. R. Langcrak and E. Brinksma. A Complete Finite Prefix for Process Algebra. In N. Halbwachs and D. Pclcd, editors, Proc. of CAV'99, LNCS 1633, pages 184 195, Trcnto, Italy, July 1999. Springer-Vcrlag.
25. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwcr Academic Publishers, 1993.
26. K. L. McMillan. A Technique of State Space Search Based on Unfolding. Formal Methods in System Design, 6(1):45 65, 1995.
27. V. Mcrtsiotakis. Extension of the Graph Analysis Tool SPASS and Integration into the X-Window Environment of PEPP (in german). Technical report, Department of Computer Science VII, IMMD VII, University of Erlangcn Nürnbcrg, Germany, 1991. Internal study.
28. M. Nielsen, G. D. Plotkin, and G. Winskcl. Pctri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13(1):85 108, 1981.
29. E.-R. Oldcrog. Nets, Terms and Formulas, volume 23 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1991.
30. A. Rcnsink. Models and Methods for Action Refinement. PhD thesis, University of Twcntc, Enschcdc, The Netherlands, August 1993.
31. T. C. Ruys. Towards Effective Model Checking. PhD thesis, University of Twcntc, Enschcdc, The Netherlands, March 2001. To be published.
32. G. Sander. Graph Layout through the VCG Tool. In R. Tamassia and I. G. Tollis, editors, Proc. of the Int. Workshop on Graph Drawing (CD'94), LNCS 894, pages 194 205, Princeton, New Jersey, USA, 1994. Springer-Vcrlag.
33. M. I. Stoclinga and F. W. Vaandragcr. Root Contention in IEEE 1994. In J.-P. Katocn, editor, Proc. of ARTS'99, LNCS 1601, pages 53 74, Bambcrg, Germany, May 1999. Springer-Vcrlag.
34. F. Wallncr. Model-Checking LTL using Net Unfoldings. In A. J. Hu and M. Y. Vardi, editors, Proc. of CAV'98, LNCS 1427, pages 207 218, Vancouver, Canada, July 1998. Springer-Vcrlag.