{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:57Z","timestamp":1725484317399},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439134"},{"type":"electronic","value":"9783540456056"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45605-8_12","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T02:15:19Z","timestamp":1179281719000},"page":"188-206","source":"Crossref","is-referenced-by-count":8,"title":["Deriving Symbolic Representations from Stochastic Process Algebras"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Kuntz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Siegle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their Applications. Formal Methods in System Design, 10(2\/3):171\u2013206, April\/May 1997.","DOI":"10.1023\/A:1008699807402"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00127-8","volume":"202","author":"M. Bernardo","year":"1998","unstructured":"M. Bernardo and R. Gorrieri. A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time. Theoretical Computer Science, 202:1\u201354, 1998.","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","series-title":"Master\u2019s thesis","volume-title":"Kompositionelle Semantiken stochastischer Proze\u00dfalgebren zur Erzeugung reduzierter Transitionssysteme","author":"H. Bohnenkamp","year":"1995","unstructured":"H. Bohnenkamp. Kompositionelle Semantiken stochastischer Proze\u00dfalgebren zur Erzeugung reduzierter Transitionssysteme. Master\u2019s thesis, University of Erlangen-N\u00fcrnberg, Informatik 7, 1995 (in German)."},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","first-page":"96","volume-title":"Computer Aided Verification","author":"A. Bouali","year":"1992","unstructured":"A. Bouali and R. de Simone. Symbolic Bisimulation Minimisation. In Computer Aided Verification, pages 96\u2013108, 1992. LNCS 663."},{"issue":"8","key":"12_CR5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/3215235","volume":"31","author":"P. Buchholz","year":"1994","unstructured":"P. Buchholz. Exact and Ordinary Lumpability in Finite Markov Chains. Journal of Applied Probability, (31):59\u201375, 1994.","journal-title":"Journal of Applied Probability"},{"key":"12_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/3-540-46419-0_27","volume-title":"TACAS 2000","author":"L. Alfaro de","year":"2000","unstructured":"L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic Model Checking for Probabilistic Processes using MTBDDs and the Kronecker Representation. In S. Graf and M. Schwartzbach, editors, TACAS 2000, LNCS 1785, pages 395\u2013410, Berlin, 2000."},{"key":"12_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-60045-0_37","volume-title":"Computer Aided Verification","author":"A. Dsouza","year":"1995","unstructured":"A. Dsouza and B. Bloom. Generating BDD models for process algebra terms. In Computer Aided Verification, pages 16\u201330, 1995. LNCS 939."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02242704","volume":"6","author":"R. Enders","year":"1993","unstructured":"R. Enders, T. Filkorn, and D. Taubner. Generating BDDs for symbolic model checking in CCS. Distributed Computing, (6):155\u2013164, 1993.","journal-title":"Distributed Computing"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J.C. Fernandez","year":"1989","unstructured":"J.C. Fernandez. An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming, 13:219\u2013236, 1989.","journal-title":"Science of Computer Programming"},{"issue":"2\/3","key":"12_CR11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M. Fujita","year":"1997","unstructured":"M. Fujita, P. McGeer, and J.C.-Y. Yang. Multi-terminal Binary Decision Diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10(2\/3):149\u2013169, April\/May 1997.","journal-title":"Formal Methods in System Design"},{"key":"12_CR12","unstructured":"N. G\u00f6tz. Stochastische Proze\u00dfalgebren-Integration von funktionalem Entwurf und Leistungsbewertung Verteilter Systeme. Ph.D. thesis, Universit\u00e4t Erlangen-N\u00fcrnberg, 1994 (in German)."},{"issue":"9-10","key":"12_CR13","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/S0169-7552(97)00133-5","volume":"30","author":"H. Hermanns","year":"1998","unstructured":"H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic Process Algebras \u2014 Between LOTOS and Markov Chains. Computer Networks and ISDN (CNIS), 30(9-10):901\u2013924, 1998.","journal-title":"Computer Networks and ISDN (CNIS)"},{"key":"12_CR14","unstructured":"H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In B. Plateau, W.J. Stewart, and M. Silva, editors, 3rd Int. Workshop on the Numerical Solution of Markov Chains, pages 188\u2013207. Prensas Universitarias de Zaragoza, 1999."},{"key":"12_CR15","unstructured":"H. Hermanns and M. Rettelbach. Syntax, Semantics, Equivalences, and Axioms for MTIPP. In Proc. of PAPM\u201994, pages 71\u201388. Arbeitsberichte des IMMD 27 (4), Universit\u00e4t Erlangen-N\u00fcrnberg, 1994."},{"key":"12_CR16","series-title":"Lect Notes Comput Sci","first-page":"144","volume-title":"ARTS\u201999, 5th Int. AMAST Workshop on Real-Time and Probabilistic Systems","author":"H. Hermanns","year":"1999","unstructured":"H. Hermanns and M. Siegle. Bisimulation Algorithms for Stochastic Process Algebras and their BDD-based Implementation. In J.-P. Katoen, editor, ARTS\u201999, 5th Int. AMAST Workshop on Real-Time and Probabilistic Systems, pages 144\u2013264. Springer, LNCS 1601, 1999."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.","DOI":"10.1017\/CBO9780511569951"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kanellakis","year":"1990","unstructured":"P. Kanellakis and S. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation, 86:43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"12_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-44804-7_2","volume-title":"PAPM-PROBMIV 2001","author":"J.-P. Katoen","year":"2001","unstructured":"J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and Symbolic CTMC Model Checking. In PAPM-PROBMIV 2001, pages 23\u201338. Springer, LNCS 2165, 2001."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"M. Kuntz and M. Siegle. Deriving symbolic representations from stochastic process algebras. Tech. Rep. Informatik 7 03\/02, Universit\u00e4t Erlangen-N\u00fcrnberg, 2002.","DOI":"10.1007\/3-540-45605-8_12"},{"key":"12_CR21","first-page":"7","volume-title":"MMB-PNPM-PAPM-PROBMIV Tool Proceedings","author":"M. Kwiatkowska","year":"2001","unstructured":"M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic Symbolic Model Checker. In P. Kemper, editor, MMB-PNPM-PAPM-PROBMIV Tool Proceedings, pages 7\u201312. Univ. Dortmund, Informatik IV, Bericht 760\/2001, 2001."},{"key":"12_CR22","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, London, 1989."},{"issue":"6","key":"12_CR23","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. Tarjan. Three Partition Refinement Algorithms. SIAM Journal of Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal of Computing"},{"key":"12_CR24","unstructured":"M. Rettelbach and M. Siegle. Compositional Minimal Semantics for the Stochastic Process Algebra TIPP. In Proc. of PAPM\u201994, pages 89\u2013106. Arbeitsberichte des IMMD 27 (4), Universit\u00e4t Erlangen-N\u00fcrnberg, 1994."},{"key":"12_CR25","unstructured":"M. Siegle. Compact representation of large performability models based on extended BDDs. In Fourth Int. Workshop on Performability Modeling of Computer and Communication Systems (PMCCS4), pages 77\u201380, Williamsburg, Sept. 1998."},{"key":"12_CR26","unstructured":"M. Siegle. Compositional Representation and Reduction of Stochastic Labelled Transition Systems based on Decision Node BDDs. In D. Baum, N. M\u00fcller, and R. R\u00f6dler, editors, MMB\u201999, pages 173\u2013185, Trier, September 1999. VDE Verlag."},{"key":"12_CR27","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Process Algebra and Probabilistic Methods, Joint Int. Workshop PAPM-PROBMIV 2001","author":"M. Siegle","year":"2001","unstructured":"M. Siegle. Advances in model representation. In L. de Alfaro and S. Gilmore, editors, Process Algebra and Probabilistic Methods, Joint Int. Workshop PAPM-PROBMIV 2001, pages 1\u201322. Springer, LNCS 2165, September 2001."},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"R. Sisto. A method to build symbolic representations of LOTOS specifications. In Protocol Specification, Testing and Verification, pages 323\u2013338, 1995.","DOI":"10.1007\/978-0-387-34892-6_21"},{"key":"12_CR29","unstructured":"A. Xie and P.A. Beerel. Implicit Enumeration of Strongly Connected Components. In ICCAD\u201999, pages 37\u201340. IEEE, 1999."}],"container-title":["Lecture Notes in Computer Science","Process Algebra and Probabilistic Methods: Performance Modeling and Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45605-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:53:20Z","timestamp":1556412800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45605-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439134","9783540456056"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-45605-8_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}