{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T11:44:40Z","timestamp":1789386280856,"version":"build-2803163510"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T00:00:00Z","timestamp":1223596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T00:00:00Z","timestamp":1223596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00236-008-0077-0","type":"journal-article","created":{"date-parts":[[2008,10,13]],"date-time":"2008-10-13T14:02:56Z","timestamp":1223906576000},"page":"537-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["M-nets: a survey"],"prefix":"10.1007","volume":"45","author":[{"given":"Hanna","family":"Klaudel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franck","family":"Pommereau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,10,10]]},"reference":[{"issue":"2","key":"77_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. TCS 126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"77_CR2","unstructured":"Benaissa, N., Djafri, B., Hutzler, G., Klaudel, H.: Towards modelling and verification of mobile agent systems. INADIS\/IBERAMIA-SBIA-SBRN\u20192006. Springer, Berlin (2006)"},{"key":"77_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","volume":"55","author":"E. Best","year":"1987","unstructured":"Best, E., Devillers, R.: Sequential and concurrent behaviour in Petri net theory. TCS 55, 87\u2013136 (1987)","journal-title":"TCS"},{"key":"77_CR4","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Hall, J.G.: The box calculus: a new causal algebra with multi-label communication. APN\u201992. LNCS, vol. 609. Springer, Berlin (1992)","DOI":"10.1007\/3-540-55610-9_167"},{"key":"77_CR5","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Esparza, J.: General refinement and recursion for the box calculus. STACS\u201993. LNCS, vol. 665. Springer, Berlin (1993)","DOI":"10.1007\/3-540-56503-5_16"},{"key":"77_CR6","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. In: EATCS Monographs on TCS. Springer, Berlin (2001)","DOI":"10.1007\/978-3-662-04457-5"},{"key":"77_CR7","doi-asserted-by":"crossref","unstructured":"Best, E., Fleischhack, H., Fra\u0327czak, W., Hopkins, R.P., Klaudel, H., Pelz, E.: An M-net semantics of B(PN). SCT\u201995. Springer, Berlin (1995)","DOI":"10.1007\/978-1-4471-3078-9_6"},{"key":"77_CR8","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s002360050144","volume":"35","author":"E. Best","year":"1998","unstructured":"Best, E., Fra\u0327czak, W., Hopkins, R.P., Klaudel, H., Pelz, E.: M-nets: an algebra of high level Petri nets, with an application to the semantics of concurrent programming languages. Acta Inf. 35, 813\u2013857 (1998)","journal-title":"Acta Inf."},{"key":"77_CR9","doi-asserted-by":"crossref","unstructured":"Best, E., Fern\u00e1ndez, C.: Nonsequential processes. In: EATCS Monographs on TCS, vol. 13. Springer, Berlin (1988)","DOI":"10.1007\/978-3-642-73483-0"},{"key":"77_CR10","doi-asserted-by":"crossref","unstructured":"Best, E., Hopkins, R.P.: B(PN)2\u2014a basic Petri net programming notation. PARLE \u201993. LNCS, vol. 694. Springer, Berlin (1993)","DOI":"10.1007\/3-540-56891-3_30"},{"issue":"1","key":"77_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(92)90184-H","volume":"96","author":"E. Best","year":"1992","unstructured":"Best, E., Koutny, M.: Petri net semantics of priority systems. TCS 96(1), 175\u2013215 (1992)","journal-title":"TCS"},{"key":"77_CR12","doi-asserted-by":"crossref","unstructured":"Best, E., Thielke, T.: Refinement of coloured Petri nets. FCT\u201997. LNCS, vol. 1279. Springer, Berlin (1997)","DOI":"10.1007\/BFb0036175"},{"key":"77_CR13","doi-asserted-by":"crossref","unstructured":"Biberstein, O., Buchs, D., Guelfi, N.: Object-oriented nets with algebraic specifications: the CO-OPN\/2 formalism. APN on Object-Orientation. LNCS, vol. 2001. Springer, Berlin (2000)","DOI":"10.1007\/3-540-45397-0_3"},{"key":"77_CR14","unstructured":"Bouroulet, R., Klaudel, H., Pelz, E.: A semantics of security protocol language (SPL) using a class of composable high-level Petri nets. ACSD\u201904. IEEE, New York (2004)"},{"key":"77_CR15","unstructured":"Bouroulet, R., Klaudel, H., Pelz, E.: Modelling and verification of authentication using enhanced net semantics of SPL (security protocol language). ACSD\u201906. IEEE, New York (2006)"},{"key":"77_CR16","unstructured":"Bui Thanh, C., Klaudel, H.: Encapsulation in an object oriented notation based on modular Petri nets. In: Workshop on Simulation with Petri nets (satellite of ESMc\u20192003). Eurosis (2003)"},{"key":"77_CR17","doi-asserted-by":"crossref","unstructured":"Bui Thanh, C., Klaudel, H.: Object oriented modelling with high-level modular Petri nets. IFM\u201904. LNCS, vol. 2999. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24756-2_16"},{"key":"77_CR18","unstructured":"Bui Thanh, C., Klaudel, H., Pommereau, F.: Box calculus with coloured buffers. DASD\/ASTC\u201904. SCS, San Diego (2004)"},{"key":"77_CR19","doi-asserted-by":"crossref","unstructured":"Bui Thanh, C., Klaudel, H., Pommereau, F.: Petri nets with causal time for system verification. MTCS\u201902, ENTCS 68.5. Elsevier, Amsterdam (2002)","DOI":"10.1016\/S1571-0661(04)80521-8"},{"key":"77_CR20","unstructured":"Bui Thanh, C.: Mod\u00e8les Orient\u00e9s-Objet pour la V\u00e9rification de Syst\u00e8mes Concurrents. Ph.D. thesis, University of Paris 12, Cr\u00e9teil (2004)"},{"key":"77_CR21","unstructured":"CCITT: Specification and Description Language. CCITT Z.100. ICCTT (1992)"},{"key":"77_CR22","unstructured":"Chizzoni, A.: CLOWN: class orientation with nets. Master thesis, University of Milan (1996)"},{"key":"77_CR23","doi-asserted-by":"crossref","unstructured":"Crazzolara, F., Winskel, G.: Events in security protocols. In: ACM Conference on Computer and Communications Security. ACM Press, New York (2001)","DOI":"10.1145\/501983.501998"},{"issue":"5","key":"77_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/32.685256","volume":"24","author":"R. De Nicola","year":"1998","unstructured":"De Nicola, R., Ferrari, G., Pugliese, R.: Klaim: a kernel language for agents interaction and mobility. IEEE Trans. Softw. Eng. 24(5), 315\u2013330 (1998)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"77_CR25","doi-asserted-by":"crossref","unstructured":"Devillers, R., Klaudel, H.: Refinement and recursion in a high level Petri Box Calculus. STRICT\u201995, WiC. Springer, Berlin (1995)","DOI":"10.1007\/978-1-4471-3078-9_10"},{"key":"77_CR26","unstructured":"Devillers, R., Klaudel, H.: Solving Petri net recursions through finite representation. ACST\u20192004. ACTA Press, Zurich (2004)"},{"issue":"66","key":"77_CR27","first-page":"221","volume":"3","author":"R. Devillers","year":"2005","unstructured":"Devillers, R., Klaudel, H.: Synchronous and asynchronous communications in composable parameterized high-level Petri nets. Fundam. Inf. 3(66), 221\u2013257 (2005)","journal-title":"Fundam. Inf."},{"key":"77_CR28","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: Context-based process algebras for mobility. ACSD\u201904. IEEE, New York (2004)"},{"key":"77_CR29","doi-asserted-by":"crossref","unstructured":"Devillers, R., Klaudel, R., Koutny, M.: Petri net semantics of the finite \u03c0-calculus. FORTE\u20192004. LNCS, vol. 3235. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30232-2_20"},{"issue":"3","key":"77_CR30","first-page":"71","volume":"154","author":"R. Devillers","year":"2006","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: A Petri net semantics of a simple process algebra for mobility. EXPRESS\/CONCUR\u201905. ENTCS 154(3), 71\u201394 (2006)","journal-title":"EXPRESS\/CONCUR\u201905"},{"issue":"3","key":"77_CR31","first-page":"203","volume":"70","author":"R. Devillers","year":"2006","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: Petri net semantics of the finite \u03c0-calculus terms. Fundam. Inf. 70(3), 203\u2013226 (2006)","journal-title":"Fundam. Inf."},{"key":"77_CR32","doi-asserted-by":"crossref","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: A Petri net translation of \u03c0-calculus terms. ICTAC\u201906. LNCS, vol. 4281. Springer, Berlin (2006)","DOI":"10.1007\/11921240_10"},{"key":"77_CR33","doi-asserted-by":"crossref","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: Modelling mobility in high-level Petri nets. ACSD\u201907. IEEE, New York (2007)","DOI":"10.1109\/ACSD.2007.55"},{"key":"77_CR34","first-page":"293","volume":"54","author":"R. Devillers","year":"2003","unstructured":"Devillers, R., Klaudel, H., Koutny, M., Pommereau, F.: Asynchronous box calculus. Fundam. Inf. 54, 293\u2013344 (2003)","journal-title":"Fundam. Inf."},{"issue":"2","key":"77_CR35","first-page":"81","volume":"5","author":"R. Devillers","year":"2000","unstructured":"Devillers, R., Klaudel, H., Pelz, E.: An algebraic box calculus. JALC 5(2), 81\u2013108 (2000)","journal-title":"JALC"},{"key":"77_CR36","doi-asserted-by":"crossref","unstructured":"Devillers, R., Klaudel, H., Riemann, R.-C.: General refinement for high level Petri nets. FST-TCS\u201997. LNCS, vol. 1346. Springer, Berlin (1997)","DOI":"10.1007\/BFb0058038"},{"key":"77_CR37","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0304-3975(02)00088-9","volume":"300","author":"R. Devillers","year":"2003","unstructured":"Devillers, R., Klaudel, H., Riemann, R.-C.: General parameterised refinement and recursion for the M-net calculus. TCS 300, 259\u2013300 (2003)","journal-title":"TCS"},{"key":"77_CR38","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/0169-023X(91)90024-R","volume":"6","author":"R. Durchholz","year":"1991","unstructured":"Durchholz, R.: Causality, time and deadlines. Data Knowl. Eng. 6, 469\u2013477 (1991)","journal-title":"Data Knowl. Eng."},{"key":"77_CR39","unstructured":"Fleischhack, H., Grahlmann, B.: A Petri net semantics for B(PN)2 with procedures. PDSE\u201997. IEEE, New York (1997)"},{"key":"77_CR40","doi-asserted-by":"crossref","unstructured":"Fleischhack, H., Grahlmann, B.: A compositional Petri net semantics for SDL. ATPN\u201998. LNCS, vol. 1420. Springer, Berlin (1998)","DOI":"10.1007\/3-540-69108-1_9"},{"key":"77_CR41","doi-asserted-by":"crossref","unstructured":"Grahlmann, B., Best, E.: PEP: more than a Petri net tool. TACAS\u201996. LNCS, vol. 1055. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61042-1_58"},{"key":"77_CR42","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(81)90113-4","volume":"13","author":"H. Genrich","year":"1981","unstructured":"Genrich, H., Lautenbach, H.J.: System modelling with high-level Petri nets. TCS 13, 109\u2013136 (1981)","journal-title":"TCS"},{"key":"77_CR43","doi-asserted-by":"crossref","unstructured":"Genrich, H.J., Lautenbach, K., Thiagarajan, P.S.: Elements of general net theory. ACGNTPS\u201980. LNCS, vol. 84. Springer, Berlin (1980)","DOI":"10.1007\/3-540-10001-6_22"},{"issue":"2, 3","key":"77_CR44","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U. Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Inf. Control 57(2, 3), 125\u2013147 (1983)","journal-title":"Inf. Control"},{"key":"77_CR45","unstructured":"Grahlmann, B.: Parallel programs as Petri nets. Ph.D. thesis, University of Hildesheim, Germany (1999)"},{"key":"77_CR46","doi-asserted-by":"crossref","unstructured":"Huber, P., Jensen, K., Shapiro, R.M.: Hierarchies in coloured Petri nets. APN\u201990, LNCS 483. Springer, Berlin (1990)","DOI":"10.1007\/978-3-642-84524-6_7"},{"key":"77_CR47","unstructured":"Jensen, K.: Coloured Petri nets. Basic concepts, analysis methods and practical use. In: EATCS Monographs on TCS, vol. 1. Springer, Berlin (1992)"},{"key":"77_CR48","doi-asserted-by":"crossref","unstructured":"Kishinevsky, M., Cortadella, J., Kondratyev, A., Lavagno, L., Taubin, A., Yakovlev, A.: Coupling asynchrony and interrupts: place chart nets and their synthesis. ICATPN\u201997. LNCS, vol. 1248. Springer, Berlin (1997)","DOI":"10.1007\/3-540-63139-9_44"},{"key":"77_CR49","unstructured":"Khomenko, V.: Punf documentation and user guide (2002). http:\/\/homepages.cs.ncl.ac.uk\/victor.khomenko\/home.formal\/tools\/punf"},{"key":"77_CR50","doi-asserted-by":"crossref","unstructured":"Khomenko, V., Koutny, M.: Branching processes of high-level Petri nets. TACAS\u20192003. LNCS, vol. 2619. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36577-X_34"},{"key":"77_CR51","unstructured":"Klaudel, H.: Mod\u00e8les alg\u00e9briques, bas\u00e9s sur les r\u00e9seaux de Petri, pour la s\u00e9mantique des langages de programation concurrents. Ph.D. thesis, University of Paris 11, Orsay (1995)"},{"key":"77_CR52","doi-asserted-by":"crossref","unstructured":"Klaudel, H.: Parameterized M-expression semantics of parallel procedures. DAPSYS\u201900. Kluwer, Dordrecht (2000)","DOI":"10.1007\/978-1-4615-4489-0_14"},{"issue":"3","key":"77_CR53","first-page":"195","volume":"41","author":"H. Klaudel","year":"2001","unstructured":"Klaudel, H.: Compositional high-level Petri net semantics of a parallel programming language with procedures. SCP 41(3), 195\u2013240 (2001)","journal-title":"SCP"},{"key":"77_CR54","doi-asserted-by":"crossref","unstructured":"Klaudel, H., Pommereau, F.: Asynchronous links in the PBC and M-nets. ASIAN\u201999. LNCS, vol. 1742. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46674-6_17"},{"key":"77_CR55","doi-asserted-by":"crossref","unstructured":"Klaudel, H., Pommereau, F.: A concurrent and compositional Petri net semantics of preemption. IFM\u201900. LNCS, vol. 1945. Springer, Berlin (2000)","DOI":"10.1007\/3-540-40911-4_19"},{"key":"77_CR56","doi-asserted-by":"crossref","unstructured":"Klaudel, H., Pommereau, F.: A concurrent semantics of static exceptions in a parallel programming language. ICATPN\u201901. LNCS, vol. 2075. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45740-2_13"},{"issue":"1","key":"77_CR57","first-page":"33","volume":"50","author":"H. Klaudel","year":"2002","unstructured":"Klaudel, H., Pommereau, F.: A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems. Fundam. Inf. 50(1), 33\u201355 (2002)","journal-title":"Fundam. Inf."},{"key":"77_CR58","doi-asserted-by":"crossref","unstructured":"Klaudel, H., Riemann, R.-C.: High level expressions and their SOS semantics. CONCUR\u201997. LNCS, vol. 1243. Springer, Berlin (1997)","DOI":"10.1007\/3-540-63141-0_20"},{"key":"77_CR59","doi-asserted-by":"crossref","unstructured":"Lakos, C.: Object oriented modelling with object Petri nets. APN\u201997. LNCS, vol. 2001. Springer, Berlin (1997)","DOI":"10.1007\/3-540-45397-0_1"},{"issue":"1, 2","key":"77_CR60","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1(1, 2), 134\u2013152 (1997)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"77_CR61","doi-asserted-by":"crossref","unstructured":"Lilius, J.: OOB(PN)2: an object-oriented Petri net programming notation. In: Second Workshop on Object-Oriented Programming and Models of Concurrency (1996)","DOI":"10.1007\/3-540-61626-8_87"},{"key":"77_CR62","doi-asserted-by":"crossref","unstructured":"Lilius, J.: OB(PN)2: an object based Petri net programming notation. Euro-Par\u201996. LNCS, vol. 1123. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61626-8_87"},{"key":"77_CR63","doi-asserted-by":"crossref","unstructured":"Lilius, J.: OB(PN)2: an object based Petri net programming notation. APN\u201901. LNCS, vol. 2001. Springer, Berlin (1997)","DOI":"10.1007\/3-540-45397-0_8"},{"key":"77_CR64","unstructured":"Lilius, J., Pelz, E.: an M-net semantics for B(PN)2 with procedures. ISCIS\u201996, vol. 1. Middle East Technical University (1996)"},{"key":"77_CR65","unstructured":"M\u00e4kel\u00e4, M.: MARIA: modular reachability analyser for algebraic system nets. Online manual (1999). http:\/\/www.tcs.hut.fi\/maria"},{"key":"77_CR66","unstructured":"Mazurkiewicz, A.: Trace theory. APN\u201987, Part II. LNCS, vol. 255. Springer, Berlin (1987)"},{"key":"77_CR67","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Part I and II. Information and Computation, vol. 100. Elsevier, Amsterdam (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"77_CR68","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Schriften des Instituts f\u00fcr instrumentelle Mathematik. Universit\u00e4t Bonn (1962)"},{"key":"77_CR69","unstructured":"The CPN group, University of Aarhus, Denmark. The Petri net world, Petri nets tool database. http:\/\/www.daimi.au.dk\/PetriNets\/tools\/db.html"},{"key":"77_CR70","doi-asserted-by":"crossref","unstructured":"Pommereau, F.: FIFO buffers in tie sauce. DAPSYS\u201900. Kluwer, Dordrecht (2000)","DOI":"10.1007\/978-1-4615-4489-0_13"},{"key":"77_CR71","unstructured":"Pommereau, F.: Mod\u00e8les composables et concurrents pour le temps-r\u00e9el. Ph.D. thesis, University of Paris 12, Cr\u00e9teil (2002)"},{"key":"77_CR72","doi-asserted-by":"crossref","unstructured":"Pommereau, F.: Causal time calculus. FORMATS\u201903. LNCS, vol. 2791. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-40903-8_21"},{"key":"77_CR73","unstructured":"Pommereau, F.: SNAKES is the net algebra kit for editors and simulators. http:\/\/www.univ-paris12.fr\/lacl\/pommereau\/soft\/snakes"},{"key":"77_CR74","unstructured":"Pommereau, F.: Versatile boxes: a multi-purpose algebra of high-level Petri nets. DADS\/SCSC\u201907, SCS\/ACM, San Diego (2007)"},{"key":"77_CR75","unstructured":"Pommereau, F., Devillers, R., Klaudel, H.: Efficient reachability graph representation of Petri nets with unbounded counters. Infinity\u201907. ENTCS. Elsevier, Amsterdam (to appear)"},{"key":"77_CR76","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri nets and algebraic specifications. TCS 80. Elsevier, Amsterdam (1991)","DOI":"10.1016\/0304-3975(91)90203-E"},{"key":"77_CR77","unstructured":"Richter, G.: Counting interfaces for discrete time modeling. Tech. report 26, GMD. September (1998)"},{"key":"77_CR78","unstructured":"Riemann, R-C.: Modelling of concurrent systems: structural and semantical methods in the high-level Petri net calculus. Ph.D. thesis, University of Paris 11, Orsay (1999)"},{"issue":"8","key":"77_CR79","first-page":"9","volume":"17","author":"P.H. Starke","year":"1981","unstructured":"Starke, P.H.: Processes in Petri nets. EIK 17(8), 9 (1981)","journal-title":"EIK"},{"key":"77_CR80","unstructured":"St\u00f6rrle, H.: An evaluation of high-end tools for Petri-nets. Tech. Report Bericht 9802. Ludwig Maximilians Univerit\u00e4t M\u00fcnchen (1998)"},{"key":"77_CR81","doi-asserted-by":"crossref","unstructured":"Vogler, W.: Modular construction and partial order semantics of Petri nets. LNCS, vol. 625. Springer, Berlin (1992)","DOI":"10.1007\/3-540-55767-9"},{"issue":"1\/2","key":"77_CR82","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s100090050009","volume":"1","author":"S. Yovine","year":"1997","unstructured":"Yovine, S.: Kronos: a verification tool for real-time systems. Int. J. Softw. Tools Technol. Transf. 1(1\/2), 123\u2013133 (1997)","journal-title":"Int. J. Softw. Tools Technol. Transf."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0077-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-008-0077-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0077-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0077-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T08:03:47Z","timestamp":1652688227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-008-0077-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,10]]},"references-count":82,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["77"],"URL":"https:\/\/doi.org\/10.1007\/s00236-008-0077-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,10]]},"assertion":[{"value":"14 November 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2008","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}