{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:20:51Z","timestamp":1725492051416},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540756972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75698-9_11","type":"book-chapter","created":{"date-parts":[[2007,10,3]],"date-time":"2007-10-03T22:26:03Z","timestamp":1191450363000},"page":"160-174","source":"Crossref","is-referenced-by-count":6,"title":["Formal Testing of Systems Presenting Soft and Hard Deadlines"],"prefix":"10.1007","author":[{"given":"Mercedes G.","family":"Merayo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismael","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"75","volume-title":"3rd Int. Symposium on Measuring, Modelling and Evaluating Computer Systems","author":"J. Sifakis","year":"1977","unstructured":"Sifakis, J.: Use of Petri nets for performance evaluation. In: 3rd Int. Symposium on Measuring, Modelling and Evaluating Computer Systems, pp. 75\u201393. North-Holland, Amsterdam (1977)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/800053.801913","volume-title":"7th Annual Symposium on Computer Architecture","author":"W. Zuberek","year":"1980","unstructured":"Zuberek, W.: Timed Petri nets and preliminary performance evaluation. In: 7th Annual Symposium on Computer Architecture, pp. 88\u201396. ACM Press, New York (1980)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(88)90030-8","volume":"58","author":"G. Reed","year":"1988","unstructured":"Reed, G., Roscoe, A.: A timed model for communicating sequential processes. Theoretical Computer Science\u00a058, 249\u2013261 (1988)","journal-title":"Theoretical Computer Science"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/3-540-55179-4_36","volume-title":"Computer Aided Verification","author":"X. Nicollin","year":"1992","unstructured":"Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 376\u2013398. Springer, Heidelberg (1992)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R.v. Glabbeek","year":"1995","unstructured":"Glabbeek, R.v., Smolka, S., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation\u00a0121(1), 59\u201380 (1995)","journal-title":"Information and Computation"},{"key":"11_CR6","series-title":"EATCS Monograph","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04995-2","volume-title":"Process algebra with timing","author":"J. Baeten","year":"2002","unstructured":"Baeten, J., Middelburg, C.: Process algebra with timing. EATCS Monograph. Springer, Heidelberg (2002)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(01)00344-9","volume":"290","author":"M. Bravetti","year":"2003","unstructured":"Bravetti, M., Aldini, A.: Discrete time generative-reactive probabilistic processes with different advancing speeds. Theoretical Computer Science\u00a0290(1), 355\u2013406 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"11_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S1567-8326(02)00069-3","volume":"56","author":"M. N\u00fa\u00f1ez","year":"2003","unstructured":"N\u00fa\u00f1ez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming\u00a056(1\u20132), 117\u2013177 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"11_CR9","first-page":"197","volume-title":"IWTCS 1999","author":"T. Higashino","year":"1999","unstructured":"Higashino, T., Nakata, A., Taniguchi, K., Cavalli, A.: Generating test cases for a timed I\/O automaton model. In: IWTCS 1999. 12th Int. Workshop on Testing of Communicating Systems, pp. 197\u2013214. Kluwer Academic Publishers, Boston, MA (1999)"},{"issue":"1-2","key":"11_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0304-3975(99)00134-6","volume":"254","author":"J. Springintveld","year":"2001","unstructured":"Springintveld, J., Vaandrager, F., D\u2019Argenio, P.: Testing timed automata. Theoretical Computer Science 254(1-2), 225\u2013257 (2001) Previously appeared as Technical Report\u00a0CTIT-97-17, University of Twente (1997)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"11_CR11","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/TNET.2003.818182","volume":"11","author":"M. Fecko","year":"2003","unstructured":"Fecko, M., Uyar, M., Duale, A., Amer, P.: A technique to generate feasible tests for communications systems with multiple timers. IEEE\/ACM Transactions on Networking\u00a011(5), 796\u2013809 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44830-6_16","volume-title":"Testing of Communicating Systems","author":"A. En-Nouaary","year":"2003","unstructured":"En-Nouaary, A., Dssouli, R.: A guided method for testing timed input output automata. In: Hogrefe, D., Wiles, A. (eds.) TestCom 2003. LNCS, vol.\u00a02644, pp. 211\u2013225. Springer, Heidelberg (2003)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-39979-7_22","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2003","author":"M. N\u00fa\u00f1ez","year":"2003","unstructured":"N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Towards testing stochastic timed systems. In: K\u00f6nig, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol.\u00a02767, pp. 335\u2013350. Springer, Heidelberg (2003)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45061-0_38","volume-title":"Automata, Languages and Programming","author":"M. Stoelinga","year":"2003","unstructured":"Stoelinga, M., Vaandrager, F.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 464\u2013477. Springer, Heidelberg (2003)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/11576280_19","volume-title":"Formal Methods and Software Engineering","author":"L. Brand\u00e1n Briones","year":"2005","unstructured":"Brand\u00e1n Briones, L., Brinksma, E.: Testing real-time multi input-output systems. In: Lau, K.-K., Banach, R. (eds.) ICFEM 2005. LNCS, vol.\u00a03785, pp. 264\u2013279. Springer, Heidelberg (2005)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/11888116_27","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2006","author":"M. Merayo","year":"2006","unstructured":"Merayo, M., N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Extending EFSMs to specify and test timed systems with action durations and timeouts. In: Najm, E., Pradat-Peyre, J.F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol.\u00a04229, pp. 372\u2013387. Springer, Heidelberg (2006)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0013851","volume-title":"Performance Evaluation of Computer and Communication Systems","author":"N. G\u00f6tz","year":"1993","unstructured":"G\u00f6tz, N., Herzog, U., Rettelbach, M.: Multiprocessor and distributed system design: The integration of functional specification and performance analysis using stochastic process algebras. In: Donatiello, L., Nelson, R. (eds.) SIGMETRICS 1993 and Performance 1993. LNCS, vol.\u00a0729, pp. 121\u2013146. Springer, Heidelberg (1993)"},{"key":"11_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569951","volume-title":"A Compositional Approach to Performance Modelling","author":"J. Hillston","year":"1996","unstructured":"Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)"},{"issue":"1-2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00127-8","volume":"202","author":"M. Bernardo","year":"1998","unstructured":"Bernardo, M., Gorrieri, R.: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science\u00a0202(1-2), 1\u201354 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1093\/logcom\/10.1.3","volume":"10","author":"P. Harrison","year":"2000","unstructured":"Harrison, P., Strulo, B.: SPADES \u2013 a process algebra for discrete event simulation. Journal of Logic Computation\u00a010(1), 3\u201342 (2000)","journal-title":"Journal of Logic Computation"},{"issue":"1-2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(00)00305-4","volume":"274","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H., Herzog, U., Katoen, J.P.: Process algebra for performance evaluation. Theoretical Computer Science\u00a0274(1-2), 43\u201387 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0304-3975(01)00043-3","volume":"282","author":"M. Bravetti","year":"2002","unstructured":"Bravetti, M., Gorrieri, R.: The theory of interactive generalized semi-Markov processes. Theoretical Computer Science\u00a0282(1), 5\u201332 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/s00165-004-0044-7","volume":"16","author":"N. L\u00f3pez","year":"2004","unstructured":"L\u00f3pez, N., N\u00fa\u00f1ez, M., Rubio, F.: An integrated framework for the analysis of asynchronous communicating stochastic processes. Formal Aspects of Computing\u00a016(3), 238\u2013262 (2004)","journal-title":"Formal Aspects of Computing"},{"key":"11_CR24","unstructured":"Cleaveland, R., Lee, I., Lewis, P., Smolka, S.: A theory of testing for soft real-time processes. In: SEKE 1996. 8th Int. Conf. on Software Engineering and Knowledge Engineering, pp. 474\u2013479 (1996)"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"de Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"11_CR26","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/BFb0015028","volume-title":"CONCUR \u201994: Concurrency Theory","author":"S. Yuen","year":"1994","unstructured":"Yuen, S., Cleaveland, R., Dayar, Z., Smolka, S.: Fully abstract characterizations of testing preorders for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 497\u2013512. Springer, Heidelberg (1994)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-44618-4_23","volume-title":"CONCUR 2000 - Concurrency Theory","author":"M. Bernardo","year":"2000","unstructured":"Bernardo, M., Cleaveland, W.: A theory of testing for markovian processes. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 305\u2013319. Springer, Heidelberg (2000)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-44685-0_22","volume-title":"CONCUR 2001 - Concurrency Theory","author":"N. L\u00f3pez","year":"2001","unstructured":"L\u00f3pez, N., N\u00fa\u00f1ez, M.: A testing theory for generally distributed stochastic processes. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 321\u2013335. Springer, Heidelberg (2001)"},{"issue":"3","key":"11_CR30","first-page":"103","volume":"17","author":"J. Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs, outputs and repetitive quiescence. Software \u2013 Concepts and Tools\u00a017(3), 103\u2013120 (1996)","journal-title":"Software \u2013 Concepts and Tools"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36135-9_1","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2002","author":"M. N\u00fa\u00f1ez","year":"2002","unstructured":"N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Encoding PAMR into (timed) EFSMs. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol.\u00a02529, pp. 1\u201316. Springer, Heidelberg (2002)"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11759744_8","volume-title":"Formal Approaches to Software Testing","author":"M. N\u00fa\u00f1ez","year":"2006","unstructured":"N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Conformance testing relations for timed systems. In: Grieskamp, W., Weise, C. (eds.) FATES 2005. LNCS, vol.\u00a03997, pp. 103\u2013117. Springer, Heidelberg (2006)"},{"issue":"1\u20133","key":"11_CR33","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.tcs.2005.10.047","volume":"353","author":"N. L\u00f3pez","year":"2006","unstructured":"L\u00f3pez, N., N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Specification, testing and implementation relations for symbolic-probabilistic systems. Theoretical Computer Science\u00a0353(1\u20133), 228\u2013248 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","International Symposium on Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75698-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:27:30Z","timestamp":1619504850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75698-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540756972"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75698-9_11","relation":{},"subject":[]}}