Modular state level analysis of distributed systems techniques and tool support

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

Volumn 1579, Issue , 1999, Pages 420-434

  Buchholz, Peter ^a   Kemper, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Bisimulation; Kronecker algebra; Model checking; Ordered natural decision diagrams; Petri nets; Software analysis

Indexed keywords

BOOLEAN FUNCTIONS; MARKOV PROCESSES; MODEL CHECKING; PETRI NETS; STOCHASTIC SYSTEMS;

BISIMULATION EQUIVALENCES; BISIMULATIONS; DECISION DIAGRAM; KRONECKER ALGEBRA; KRONECKER REPRESENTATIONS; MUTUAL EXCLUSION ALGORITHMS; ORDERED BINARY DECISION DIAGRAMS; SOFTWARE ANALYSIS;

BINARY DECISION DIAGRAMS;

EID: 0009575614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49059-0_29     Document Type: Conference Paper

References (25)

1. A. Arnold. Finite Transition systems. Prentice Hall, 1994.
2. G. Balbo, S. C. Bruell, P. Chen, and G. Chiola. An example of modelling and evaluation of a concurrent program using coloured stochastic Petri nets: Lamport's fast mutual exclusion algorithm. IEEE Trans. on Parallel and Distributed Systems, 3(2): 221-240, 1992.
3. F. Bause, P. Buchholz, and P. Kemper. A toolbox for functional and quantitative analysis of DEDS. In R. Pujanger, N. N. Savino, and B. Serra, editors, Quant. Eval. of Comp. and Comm. Sys., pp. 356-359. Springer LNCS 1469, 1998.
4. F. Bause, P. Kemper, and P. Kritzinger. Abstract Petri nets notation. Petri Net Newsletter, (49): 9-27, 1995.
5. E. Best, W. Fraczak, R. P. Hopkins, H. Klaudel, and E. Pelz. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages. Acta Informatica, 35(10): 813-857, 1998.
6. P. Buchholz. A notion of equivalence for stochastic Petri nets. In G. De Michelis and M. Diaz, editors, ATPN'95, pp. 161-180. Springer LNCS 935, 1995.
7. P. Buchholz. Hierarchical structuring of superposed GSPNs. In Proc. PNPM'97 pp. 81-90. IEEE CS-Press, 1997.
8. P. Buchholz and P. Kemper. Efficient computation and representation of large reachability sets for composed automata. Technical report, in preparation.
9. G. Ciardo and A. S. Miner. Storage alternatives for large structured state spaces. In R. Marie and B. Plateau, editors, Proc. 9th Int. Conf. on Mod. Techn. and Tools for Comp. Perf. Eval., pp. 44-57. Springer LNCS 1245, 1997.
10. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: a semantics based tool for the verification of concurrent systems. ACM Trans. on Programming Languages and Systems, 15(1): 36-72, 1993.
11. M. Davio. Kronecker products and shuffe algebra. IEEE Trans. on Computer, 30: 116-125, 1981.
12. S. Donatelli. Superposed generalized stochastic Petri nets: definition and efficient solution. In R. Valette, editor, APTN'94, pp. 258-277. Springer LNCS 815, 1994.
13. J. Billington (ed.). Petri net standard. Committee draft, ISO/IECJTC1/SC7/WG11, 1992.
14. C. Hoare. Communicating sequential processes. Prentice Hall, 1985.
15. P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes and three problems of equivalence. Information and Computation, 86: 43-68, 1990.
16. P. Kemper. Numerical analysis of superposed GSPNs. IEEE Trans. on Software Engineering, 22(9): 615-628, 1996.
17. P. Kemper. Reachability analysis based on structured representations. In J. Billington and W. Reisig, editors, ATPN'96, pp. 269-288. Springer LNCS 1091, 1996.
18. E. Kindler and J. Desel. Der Traum von einem universellen Petrinetz-Werkzeug-der Petrinetz-Kern (in German). In Proc. 3rd Workhop on Algorithmen und Werkzeuge für Petrinetze, 1996.
19. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. on Computer Systems, 5(1): 1-11, 1987.
20. R. MiIner. Communication and concurrency. Prentice Hall, 1989.
21. R. Paige and R. E. Tarjan. Three partitopn rénement algorithms. SIAM Journ. on Computing, 16(6): 973-989, 1987.
22. B. Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. Performance Evaluation Review, 13: 142-154, 1985.
23. B. Plateau and K. Atif. Stochastic automata networks for modeling parallel systems. IEEE Trans. on Software Engineering, 17(10): 1093-1108, 1991.
24. L. Pomello, G. Rozenberg, and C. Simone. A survey of equivalence relations for net based systems. In G. Rozenberg, editor, Adv. in Petri Nets 1992, pages 410-472. Springer LNCS 609, 1992.
25. B. Steffen, T. Margaria, and V. Braun. The electronic tool integration platform: concepts and design. Int. Journ. on Softw. Tools for Technology Transfer, 1(1/2): 9-30, 1997.