Automated compositional Markov chain generation for a plain-old telephone system-Reference-Cited by-同舟云学术

Automated compositional Markov chain generation for a plain-old telephone system

Published:2000-01 Issue:1 Volume:36 Page:97-127
ISSN:0167-6423
Container-title:Science of Computer Programming
language:en
Short-container-title:Science of Computer Programming

Author:

Hermanns Holger,Katoen Joost-Pieter

Publisher

Elsevier BV

Subject

Software

Reference42 articles.

1. M. Bernardo, Using EMPA for the performance evaluation of an ATM switch, in: J.F. Groote, B. Luttik, J. van Wamel (Eds.), Proc. 3rd ERCIM Int. Workshop on Formal Methods for Industrial Critical Systems, SMC Press, 1998, pp. 43–58.

2. M. Bernardo, R. Gorrieri, Extended Markovian process algebra, in: U. Montanari, V. Sassone (Eds.), Concur’96: Concurrency Theory, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 315–330.

3. Regrouping parallel processes;Bolognesi;J. Formal Methods Systems Des.,1996

4. Introduction to the ISO specification language LOTOS;Bolognesi;Comput. Networks ISDN Systems,1987

5. A. Bouali, Weak and branching bisimulation in FCTOOL, Rapports de Recherche 1575, INRIA Sophia Antipolis, 1992.

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A three-valued model abstraction framework for PCTL* stochastic model checking;Automated Software Engineering;2022-03-02

2. Equivalence Checking 40 Years After: A Review of Bisimulation Tools;Lecture Notes in Computer Science;2022

3. The quest for minimal quotients for probabilistic and Markov automata;Information and Computation;2018-10

4. Compositional Verification in Action;Formal Methods for Industrial Critical Systems;2018

5. From Lotosphere to Thermosphere;ModelEd, TestEd, TrustEd;2017