[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_00ca5b4d-9a8a-4eff-b6db-bb58d85c413b":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:00ca5b4d-9a8a-4eff-b6db-bb58d85c413b,\"}":57},{"code":4,"data":5,"meta":18},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":20,"manageAffiliations":21,"indexDatabases":22,"url":18,"thumbnailPath":18,"statistic":40,"gsStatistic":18,"type":18,"analyzePriority":18},"00ca5b4d-9a8a-4eff-b6db-bb58d85c413b","2023-11-10T08:42:58.317+00:00","2025-11-21T10:01:16.365+00:00",[],"The-Journal-of-Logic-and-Algebraic-Programming",{"issn":12,"title":14},{"VOID":13},"15678326",{"EN":15},"The Journal of Logic and Algebraic Programming","PUBLISHER","PENDING",null,0,[],[],[23],{"id":24,"indexDatabase":25,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},"8618da2e-53ec-426d-8cb2-0f830661081e",{"id":26,"createTime":27,"updateTime":28,"relativeEntities":29,"label":30,"description":32,"key":34,"publicationTags":35,"standard":18},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":31,"VI":31},"Scopus - Elsevier",{"EN":31,"VI":33},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[36],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F28359","2001-2014","SCOPUS__Q1",{"impactFactor":19,"impactFactorByYear":41,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":43,"totalCitation":19,"totalCitationByYear":55,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":56,"hindexLast5Year":19,"hindex":19},{},178,{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},3,9,5,17,11,20,26,14,24,8,4,{},{},{"meta":58,"data":60},{"total":59},"168",[61,163,233,298,366,434,517,586,703,765],{"id":62,"createTime":63,"updateTime":64,"relativeEntities":65,"slug":66,"properties":67,"entityType":74,"verifyStatus":75,"verifyTime":64,"verifyNote":76,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":77,"fullTextUrl":18,"authors":78,"publicationType":134,"publisherRelationship":135,"citationCount":18,"citationInfo":18,"publishDate":160,"publishYear":161,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"aa0e9e25-6a6d-4e32-9634-07d70a905092","2024-01-28T06:29:16.369+00:00","2025-01-05T23:58:59.815+00:00",[],"Validation-and-verification-of-Web-services-choreographies-by-using-timed-automata",{"references":68,"title":70,"doi":72},{"VOID":69},"A. Ankolenkar et al., DAML-S: web service description for the semantic web, in: Proc. First International Semantic Web Conference, 2002, pp. 348–363.\nA. Arkin et al., Web Service Choreography Interface (WSCI) 1.0. \u003Chttp:\u002Fwww.w3.org\u002FTR\u002Fwsci\u002F>.\nA. Arkin et al., Web Services Business Process Execution Language Version 2.0, December 2004. \u003Chttp:\u002F\u002Fwww.oasis-open.org\u002Fcommittees\u002Fdownload.php\u002F10347\u002Fwsbpel-specification-draft-120204.htm>.\nR. Alur, D. Dill, Automata for modeling real-time systems, in: ICALP, 1990, pp. 322–335.\nAlur, 1994, A theory of timed automata, Theoret. Comput. Sci., 126, 183, 10.1016\u002F0304-3975(94)90010-8\nBravetti, 2007, A theory for strong service compliance, vol. 4467, 96\nBravetti, 2008, Contract compliance and choreography conformance in the presence of message queues, vol. 5387\nBrogi, 2004, Formalizing web service choreographies, Electron. Notes Theor. Comput. Sci., 105, 73, 10.1016\u002Fj.entcs.2004.05.007\nCambronero, 2009, A comparative study between WSCI, WS-CDL and OWL-S, 377\nM.E. Cambronero, G. Díaz, E. Martínez, V. Valero, L. Tobarra, WST: a tool supporting timed composite web services model transformation, in: Simulation: Transactions of the Society for Modeling and Simulation International, in press.\nM. Carbone, K. Honda, N. Yoshida, A theoretical basis of communication-centres concurrent programming, in: First International Summer School on Emerging Trends in Concurrency (TIC’06), 2006.\nG. Díaz, J.J. Pardo, M.E. Cambronero, V. Valero, F. Cuartero, Verification of web services with timed automata, in: Proceedings of First International Workshop on Automated Specification and Verification of Web Sites, Electronic Notes in Theoretical Computer Science, vol. 1125, 157\u002F2, 2005.\nDíaz, 2009, Automatically deriving choreography-conforming systems of services, 9\nJ.S. Dong, Y. Liu, J. Sun, X. Zhang, Verification of computation orchestration via timed automata, in: International Conference on Formal Engineering Methods (ICFEM), 2006, pp. 226–245.\nX. Du, C. Xing, L. Zhou, Z. Li, Nested web service interface control flow automata, in: Proc. 4th International Conference on Next Generation Web Services Practices, 2008, pp. 129–136.\nH. Foster, W. Emmerich, J. Kramer, J. Magee, D.S. Rosenblum, S. Uchitel, Model checking service compositions under resource constraints, in: ESEC\u002FSIGSOFT FSE, 2007, pp. 225–234.\nR. Hamadi, B. Benatallah, A petri net-based model for web service composition, in: Proc. 14th Australasian Database Conference, vol. 17, 2003, pp. 191–200.\nK. Honda, N. Yoshida, M. Carbone, Multiparty asynchronous session types, in: POPL, 2008, pp. 273–284.\nLarsen, 1997, UPPAAL in a nutshell, Int. J. Softw. Tools Technol. Transfer, 1, 134, 10.1007\u002Fs100090050010\nN. Lohmann, J. Kleine, Fully-automatic translation of open workflow net models into simple abstract bpel processes, in: Modellierung, 2008, pp. 57–72.\nMilner, 1989\nMilner, 1992, A calculus of mobile processes, parts I and II, Inform. and Comput., 100, 1, 10.1016\u002F0890-5401(92)90008-4\nN. Kavantzas et al., Web Service Choreography Description Language (WSCDL) 1.0. \u003Chttp:\u002F\u002Fwww.w3.org\u002FTR\u002Fws-cdl-10\u002F>.\nS. Narayanan, S. Mcllraith, Simulation, verification and automated composition of web services, in: Proc. 11th International World Wide Conference, 2002, pp. 77–88.\nG. Salaün, L. Bordeaux, M. Schaerf, Describing and reasoning on web services using process algebra, in: Proc. 2nd International Conference on Web Services (ICWS), 2004, pp. 43–51.\nSharygina, 2007, Model checking with abstraction for web services, 121\nValero, 2009, A petri net approach for the design and analysis of web services choreographies, J. Logic Algebraic Program., 78, 359, 10.1016\u002Fj.jlap.2008.09.002\nW.M.P. van der Aalst, N. Lohmann, P. Massuthe, C. Stahl, K. Wolf, From public views to private views – correctness-by-design for services, in: WS-FM, 2007, pp. 139–153.\nH. Yang, X. Zhao, C. Cai, Z. Qiu, Model-checking of web services choreography, in: IEEE International Workshop on Service-Oriented System Engineering, 2008, pp. 79–84.\nW. L. Yeung, Mapping WS-CDL and BPEL into CSP for behavioural specification and verification of web services, in: European Conference on Web Services (ECOWS), 2006, pp. 297–305.\nZhou, 2006, Pi4SOA: a policy infrastructure for verification and control of service collaboration, 307",{"EN":71},"Validation and verification of Web services choreographies by using timed automata",{"VOID":73},"10.1016\u002Fj.jlap.2010.02.001","PUBLICATION","VERIFIED","Auto Verify","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832610000032",[79,97,109,122],{"id":80,"sortIndex":81,"researcher":18,"roles":82,"affiliations":84,"properties":94},"4168e5c8-9e24-4ff8-a682-7c73de81dd6e",2,[83],"AUTHOR",[85],{"id":18,"sortIndex":19,"affiliation":86,"properties":18},{"id":87,"createTime":88,"updateTime":88,"relativeEntities":89,"slug":18,"properties":90,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"8cf50eb0-1d35-4fdb-b74d-38c3cdb9387b","2024-01-28T06:29:16.391+00:00",[],{"title":91},{"VI":92},"Departamento de Sistemas Informáticos, Escuela Superior de Ingeniería, Informática de Albacete, Universidad de Castilla-La Mancha, Campus Universitario s\u002Fn, 02071. Albacete, Spain","AFFILIATION",{"title":95},{"VI":96},"Valentín Valero",{"id":98,"sortIndex":44,"researcher":18,"roles":99,"affiliations":100,"properties":106},"13824f75-b7c3-44a6-a5c1-adeff018a2ae",[83],[101],{"id":18,"sortIndex":19,"affiliation":102,"properties":18},{"id":87,"createTime":88,"updateTime":88,"relativeEntities":103,"slug":18,"properties":104,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":105},{"VI":92},{"title":107},{"VI":108},"Enrique Martínez",{"id":110,"sortIndex":111,"researcher":18,"roles":112,"affiliations":113,"properties":119},"7ab36467-2d1e-4620-afba-7f37acacb4dc",1,[83],[114],{"id":18,"sortIndex":19,"affiliation":115,"properties":18},{"id":87,"createTime":88,"updateTime":88,"relativeEntities":116,"slug":18,"properties":117,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":118},{"VI":92},{"title":120},{"VI":121},"Gregorio Díaz",{"id":123,"sortIndex":19,"researcher":18,"roles":124,"affiliations":125,"properties":131},"43f476c9-cf58-44be-b1a0-54ea0a751045",[83],[126],{"id":18,"sortIndex":19,"affiliation":127,"properties":18},{"id":87,"createTime":88,"updateTime":88,"relativeEntities":128,"slug":18,"properties":129,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":130},{"VI":92},{"title":132},{"VI":133},"M. Emilia Cambronero","ARTICLE",{"url":77,"publisher":136,"properties":155},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":137,"slug":10,"properties":138,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":141,"manageAffiliations":142,"indexDatabases":143,"url":18,"thumbnailPath":18,"statistic":150,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":139,"title":140},{"VOID":13},{"EN":15},[],[],[144],{"id":24,"indexDatabase":145,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":146,"label":147,"description":148,"key":34,"publicationTags":149,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":151,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":152,"totalCitation":19,"totalCitationByYear":153,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":154,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":156,"pages":158},{"VOID":157},"80",{"VOID":159},"25-49","2011-01-01",2011,false,{"id":164,"createTime":165,"updateTime":165,"relativeEntities":166,"slug":18,"properties":167,"entityType":74,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":174,"fullTextUrl":18,"authors":175,"publicationType":134,"publisherRelationship":206,"citationCount":18,"citationInfo":18,"publishDate":231,"publishYear":232,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"c3e9a295-f00c-45b7-bd3f-948000fdc8d9","2023-12-17T23:57:56.601+00:00",[],{"references":168,"title":170,"doi":172},{"VOID":169},"Behnke, 1998, RelView — A System for Calculation With Relations and Relational Programming, no. 1382, 318\nR. Berghammer, B. Leoniuk, U. Milanese, Implementation of relational algebra using binary decision diagrams, in: H. de Swart (Ed.), Lecture Notes in Computer Science, no. 2561, Springer-Verlag, 2002, pp. 241–257.\nBerghammer, 2005, RelView – an OBDD-based computer algebra system for relations, vol. 3718, 40\nChoquet, 1953, Theory of capacities, Annales Inst. Fourier, 5, 131, 10.5802\u002Faif.53\nA. Colorni, M. Paruccini, B. Roy, A-MCD-A – multiple criteria decision aiding, Joint Research Centre of the European Commission, 2001.\nCox, 2001, Multidimensional scaling, vol. 88\nDempster, 1967, Upper and lower probabilities induced by a multivalued mapping, Annals Math. Statist., 38, 325, 10.1214\u002Faoms\u002F1177698950\nFodor, 2000, Preferences and decisions under incomplete knowledge, vol. 51\nFodor, 1994, Fuzzy preference modelling and multicriteria decision support, vol. 14\nLuce, 1959\nPeeva, 2004, Fuzzy relational calculus – theory, applications and software, vol. 22\nPirlot, 1997, Semiorders – properties, representations, applications, vol. 36\nG. Schmidt, Relational Language, Technical Report 2003-05, Fakultät für Informatik, Universität der Bundeswehr München, 2003, 101p. \u003Chttp:\u002F\u002Fhomepage.mac.com\u002Ftiturel\u002FPapers\u002FLanguageProposal.html>.\nSchmidt, 2004, A proposal for a multilevel relational reference language, Electronic J. on Relational Methods in Comput. Sci., 1, 314\nSchmidt, 1989, 10.1007\u002F978-3-642-83608-4\nShafer, 1976\nSugeno, 1985",{"EN":171},"Relational measures and integration in preference modeling",{"VOID":173},"10.1016\u002Fj.jlap.2007.10.001","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832607000835",[176,191],{"id":177,"sortIndex":111,"researcher":18,"roles":178,"affiliations":179,"properties":188},"6516629f-da4c-44fe-abb1-7daf849a5527",[83],[180],{"id":18,"sortIndex":19,"affiliation":181,"properties":18},{"id":182,"createTime":183,"updateTime":183,"relativeEntities":184,"slug":18,"properties":185,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"3a146c24-8067-4a99-8366-f58cedfe4fa7","2024-01-15T22:58:32.378+00:00",[],{"title":186},{"VI":187},"Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Olshausenstraße 40, 24098 Kiel, Germany",{"title":189},{"VI":190},"Rudolf Berghammer",{"id":192,"sortIndex":19,"researcher":18,"roles":193,"affiliations":194,"properties":203},"03e6cac0-7e65-4a14-ab90-e79b84241d52",[83],[195],{"id":18,"sortIndex":19,"affiliation":196,"properties":18},{"id":197,"createTime":198,"updateTime":198,"relativeEntities":199,"slug":18,"properties":200,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"721dcb1b-90f3-417d-bc9c-95be95379b79","2023-12-17T23:57:56.618+00:00",[],{"title":201},{"VI":202},"Fakultät für Informatik, Universität der Bundeswehr München, 85577 Neubiberg, Germany",{"title":204},{"VI":205},"Gunther Schmidt",{"url":174,"publisher":207,"properties":226},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":208,"slug":10,"properties":209,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":212,"manageAffiliations":213,"indexDatabases":214,"url":18,"thumbnailPath":18,"statistic":221,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":210,"title":211},{"VOID":13},{"EN":15},[],[],[215],{"id":24,"indexDatabase":216,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":217,"label":218,"description":219,"key":34,"publicationTags":220,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":222,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":223,"totalCitation":19,"totalCitationByYear":224,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":225,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":227,"pages":229},{"VOID":228},"76",{"VOID":230},"112-129","2008-05-01",2008,{"id":234,"createTime":235,"updateTime":235,"relativeEntities":236,"slug":18,"properties":237,"entityType":74,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":244,"fullTextUrl":18,"authors":245,"publicationType":134,"publisherRelationship":273,"citationCount":18,"citationInfo":18,"publishDate":297,"publishYear":161,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"b917ed6b-3ff5-457b-bb20-a4188b0c458d","2023-12-29T23:53:16.836+00:00",[],{"references":238,"title":240,"doi":242},{"VOID":239},"Habel, 2001, Double-pushout graph transformation revisited, Math. Structures Comput. Sci., 11, 637, 10.1017\u002FS0960129501003425\nBaldan, 1998, An event structure semantics for P\u002FT contextual nets: asymmetric event structures, vol. 1378, 63\nBonchi, 2009, Synthesising CCS bisimulation using graph rewriting, Inform. and Comput., 207, 14, 10.1016\u002Fj.ic.2008.10.005\nBonchi, 2009, Reactive systems barbed semantics and the mobile ambients, vol. 5504, 272\nBruni, 2002, Normal forms for algebras of connections, Theoret. Comput. Sci., 286, 247, 10.1016\u002FS0304-3975(01)00318-8\nCaires, 2003, A spatial logic for concurrency (part I), Inform. and Comput., 186, 194, 10.1016\u002FS0890-5401(03)00137-8\nCardelli, 2000, Mobile ambients, Theoret. Comput. Sci., 240, 177, 10.1016\u002FS0304-3975(99)00231-5\nCenciarelli, 2005, Ambient graph rewriting, vol. 117, 335\nCorradini, 1999, An algebraic presentation of term graphs, via gs-monoidal categories, Appl. Categ. Structures, 7, 299, 10.1023\u002FA:1008647417502\nCorradini, 1996, Graph processes, Fund. Inform., 26, 241, 10.3233\u002FFI-1996-263402\nCorradini, 1997, Algebraic approaches to graph transformation I: basic concepts and double pushout approach, vol. 1, 163\nDrewes, 1997, Hyperedge replacement graph grammars, vol. 1, 95\nEhrig, 2006, Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts, Math. Structures Comput. Sci., 16, 1133, 10.1017\u002FS096012950600569X\nFerrari, 2001, A LTS semantics of ambients via graph synchronization with mobility, vol. 2202, 1\nGadducci, 2007, Graph rewriting for the π-calculus, Math. Structures Comput. Sci., 17, 407, 10.1017\u002FS096012950700610X\nGadducci, 2008, A decentralized implementation of mobile ambients, vol. 5214, 115\nGadducci, 2001, A concurrent graph semantics for mobile ambients, vol. 45\nHirschkoff, 2007, An efficient abstract machine for safe ambients, J. Logic Algebraic Programming, 71, 114, 10.1016\u002Fj.jlap.2007.02.003\nO. Jensen, R. Milner, Bigraphs and Mobile Processes, Technical Report 580, Computer Laboratory, University of Cambridge, 2003.\nLevi, 2003, Mobile safe ambients, ACM Trans. Program. Lang. Syst., 25, 1, 10.1145\u002F596980.596981\nMilner, 2006, Pure bigraphs: structure and dynamics, Inform. and Comput., 204, 60, 10.1016\u002Fj.ic.2005.07.003\nN. Mylonakis, F Orejas, Another fully abstract graph semantics for the ambient calculus, Presented at Graph Transformation – Verification and Concurrency 2007.\nRegev, 2004, Bioambients: an abstraction for biological compartments, Theoret. Comput. Sci., 325, 141, 10.1016\u002Fj.tcs.2004.03.061",{"EN":241},"A decentralised graphical implementation of mobile ambients",{"VOID":243},"10.1016\u002Fj.jlap.2010.10.002","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832610000913",[246,261],{"id":247,"sortIndex":19,"researcher":18,"roles":248,"affiliations":249,"properties":258},"6d555b03-e3fb-4375-afbb-7b7b39e9238b",[83],[250],{"id":18,"sortIndex":19,"affiliation":251,"properties":18},{"id":252,"createTime":253,"updateTime":253,"relativeEntities":254,"slug":18,"properties":255,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"d58cd3a1-5b3d-4d61-9db9-10216802ef16","2024-01-03T04:50:43.828+00:00",[],{"title":256},{"VI":257},"Dipartimento di Informatica, Università di Pisa, largo Pontecorvo 3c, I-56127 Pisa, Italy",{"title":259},{"VI":260},"Fabio Gadducci",{"id":262,"sortIndex":111,"researcher":18,"roles":263,"affiliations":264,"properties":270},"7fb2114b-2eaa-4ca2-82ee-62fa5f8922ae",[83],[265],{"id":18,"sortIndex":19,"affiliation":266,"properties":18},{"id":252,"createTime":253,"updateTime":253,"relativeEntities":267,"slug":18,"properties":268,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":269},{"VI":257},{"title":271},{"VI":272},"Giacoma Valentina Monreale",{"url":244,"publisher":274,"properties":293},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":275,"slug":10,"properties":276,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":279,"manageAffiliations":280,"indexDatabases":281,"url":18,"thumbnailPath":18,"statistic":288,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":277,"title":278},{"VOID":13},{"EN":15},[],[],[282],{"id":24,"indexDatabase":283,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":284,"label":285,"description":286,"key":34,"publicationTags":287,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":289,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":290,"totalCitation":19,"totalCitationByYear":291,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":292,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":294,"pages":295},{"VOID":157},{"VOID":296},"113-136","2011-02-01",{"id":299,"createTime":300,"updateTime":300,"relativeEntities":301,"slug":18,"properties":302,"entityType":74,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":309,"fullTextUrl":18,"authors":310,"publicationType":134,"publisherRelationship":341,"citationCount":18,"citationInfo":18,"publishDate":365,"publishYear":232,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"f82792e7-de1d-438b-bf8a-326d82650b42","2024-01-11T23:29:13.580+00:00",[],{"references":303,"title":305,"doi":307},{"VOID":304},"Abramsky, 1991, Domain theory in logical form, Ann. Pure Appl. Logic, 51, 1, 10.1016\u002F0168-0072(91)90065-T\nAbramsky, 1994, Domain theory, vol. 3, 1\nBanaschewski, 1983, Biframes and bispaces, Quaestiones Mathematicae, 6, 13, 10.1080\u002F16073606.1983.9632289\nBelnap, 1977, A useful four-valued logic, 8\nU. Berger, Totale Objekte und Mengen in der Bereichstheorie, Ph.D. Thesis, Ludwig-Maximilians-Universität München, 1990.\nBirkhoff, 1947, A ternary operation in distributive lattices, Bull. Amer. Math. Soc., 53, 749, 10.1090\u002FS0002-9904-1947-08864-9\nDavey, 2002\nEscardó, 2004, Synthetic topology of data types and classical spaces, vol. 87, 21\nM.H. Escardó, Infinite sets that admit fast exhaustive search, in: Proceedings of the 22nd Annual IEEE Symposium on Logic In Computer Science, IEEE Computer Society Press, 2007, pp. 443–452.\nEscardó, 2005, Operational domain theory and topology of a sequential language, 427\nGierz, 2003, Continuous lattices and domains, vol. 93\nGinsberg, 1992, Multivalued logics: a uniform approach to inference in artificial intelligence, Comput. Intell., 4, 256\nHofmann, 1981, Local compactness and continuous lattices, vol. 871, 209\nJohnstone, 1982, Stone spaces, vol. 3\nA. Jung, Cartesian closed categories of domains, CWI Tracts, vol. 66, Centrum voor Wiskunde en Informatica, Amsterdam, 1989, 107 pp.\nA. Jung, M.A. Moshier, On the bitopological nature of Stone duality, Technical Report CSR-06-13, School of Computer Science, The University of Birmingham, 2006, 110 pp.\nJung, 2007, A Hofmann–Mislove theorem for bitopological spaces, vol. 173, 159\nKeimel, 1994, A direct proof of the Hofmann–Mislove theorem, Proc. Amer. Math. Soc., 120, 301, 10.1090\u002FS0002-9939-1994-1195723-0\nLawson, 1979, The duality of continuous posets, Houston J. Math., 5, 357\nPlotkin, 1980, Dijkstra’s predicate transformers and Smyth’s powerdomains, vol. 86, 527\nG.D. Plotkin, Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes”), Department of Computer Science, University of Edinburgh, 1981. Available from: \u003Chttp:\u002F\u002Fwww.dcs.ed.ac.uk\u002Fhome\u002Fgdp\u002Fpublications\u002F>.\nSmyth, 1983, Powerdomains and predicate transformers: a topological view, vol. 154, 662\nTaylor, 2000, Geometric and higher order logic in terms of abstract Stone duality, Theory Appl. Categ., 7, 284\nVickers, 1989, Topology via logic, vol. 5",{"EN":306},"A Hofmann–Mislove theorem for bitopological spaces",{"VOID":308},"10.1016\u002Fj.jlap.2008.02.007","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS156783260800012X",[311,326],{"id":312,"sortIndex":19,"researcher":18,"roles":313,"affiliations":314,"properties":323},"7f2bda3d-e5dc-43ac-9be3-e3ca2e03e747",[83],[315],{"id":18,"sortIndex":19,"affiliation":316,"properties":18},{"id":317,"createTime":318,"updateTime":318,"relativeEntities":319,"slug":18,"properties":320,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"55b2ee29-bc97-42b4-b174-1f95dc584241","2023-12-12T21:33:59.048+00:00",[],{"title":321},{"VI":322},"School of Computer Science, The University of Birmingham, Birmingham, United Kingdom",{"title":324},{"VI":325},"Achim Jung",{"id":327,"sortIndex":111,"researcher":18,"roles":328,"affiliations":329,"properties":338},"2be43dc6-b19c-43e8-b65f-4a76f82ba81b",[83],[330],{"id":18,"sortIndex":19,"affiliation":331,"properties":18},{"id":332,"createTime":333,"updateTime":333,"relativeEntities":334,"slug":18,"properties":335,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"8439ccc8-c105-463c-ace6-414c349ee3c2","2024-01-11T23:29:13.604+00:00",[],{"title":336},{"VI":337},"Department of Mathematics and Computer Science, Chapman University, Orange, CA, USA",{"title":339},{"VI":340},"M. Andrew Moshier",{"url":309,"publisher":342,"properties":361},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":343,"slug":10,"properties":344,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":347,"manageAffiliations":348,"indexDatabases":349,"url":18,"thumbnailPath":18,"statistic":356,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":345,"title":346},{"VOID":13},{"EN":15},[],[],[350],{"id":24,"indexDatabase":351,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":352,"label":353,"description":354,"key":34,"publicationTags":355,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":357,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":358,"totalCitation":19,"totalCitationByYear":359,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":360,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":362,"pages":363},{"VOID":228},{"VOID":364},"161-174","2008-07-01",{"id":367,"createTime":368,"updateTime":369,"relativeEntities":370,"slug":371,"properties":372,"entityType":74,"verifyStatus":75,"verifyTime":369,"verifyNote":76,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":379,"fullTextUrl":18,"authors":380,"publicationType":134,"publisherRelationship":408,"citationCount":18,"citationInfo":18,"publishDate":433,"publishYear":232,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"241d7f85-482e-4717-a58d-87c5a46e17a1","2023-12-07T10:27:31.169+00:00","2025-01-31T23:20:50.011+00:00",[],"A-process-algebraic-view-of-shared-dataspace-coordination",{"references":373,"title":375,"doi":377},{"VOID":374},"Anderson, 1991, Persistent Linda: Linda + Transactions + Query, vol. 574, 93\nBanâtre, 1993, Programming by multiset transformation, Commun. ACM, 36, 98, 10.1145\u002F151233.151242\nBerger, 2000, The Two-Phase Commit Protocol in an extended π-calculus, vol. 39\nBerry, 1992, The chemical abstract machine, Theoret. Comput. Sci., 96, 217, 10.1016\u002F0304-3975(92)90185-I\ndeBoer, 2000, A timed Linda language, vol. 1906, 299\nde Boer, 1991, Embedding as a tool for language comparison: on the CSP hierarchy, vol. 527, 127\nBrogi, 1997, Modeling coordination via asynchronous communication, vol. 1282, 238\nBrogi, 1999, On the expressiveness of coordination models, vol. 1594, 134\nN. Busi, Petri Nets with Inhibitor and Read Arcs: Semantics, Analysis and Application to Process Calculi, Ph.D. Thesis, Department of Mathematics, University of Siena, Italy, 1998.\nBusi, 1998, A process algebraic view of Linda coordination primitives, Theoret. Comput. Sci., 192, 167, 10.1016\u002FS0304-3975(97)00149-7\nBusi, 2000, Comparing three semantics for Linda-like languages, Theoret. Comput. Sci., 240, 49, 10.1016\u002FS0304-3975(99)00227-3\nBusi, 2000, On the expressiveness of Linda coordination primitives, Inform. and Comput., 156, 90, 10.1006\u002Finco.1999.2823\nBusi, 2000, Process calculi for coordination: from Linda to JavaSpaces, vol. 1816, 198\nN. Busi, R. Gorrieri, G. Zavattaro, On the expressiveness of distributed leasing in Linda-like coordination languages, Technical Report UBLCS-2000-5, Department of Computer Science, University of Bologna, Italy, May 2000.\nBusi, 2001, Temporary data in shared-dataspace coordination, vol. 2030, 121\nBusi, 2002, State- and event-based reactive programming in shared dataspaces, vol. 2315, 111\nBusi, 2000, Event notification in data-driven coordination languages: comparing the ordered and unordered interpretations, 233\nBusi, 2000, On the expressiveness of event notification in data-driven coordination languages, vol. 1782, 41\nCabri, 1998, Reactive Tuple spaces for mobile agent coordination, vol. 1477, 237\nCheng, 1995, Complexity results for 1-safe nets, Theoret. Comput. Sci., 147, 117, 10.1016\u002F0304-3975(94)00231-7\nCiancarini, 1995, On the operational semantics of a coordination language, vol. 924, 77\nDe Nicola, 1984, Testing equivalences for processes, Theoret. Comput. Sci., 34, 83, 10.1016\u002F0304-3975(84)90113-0\nDe Nicola, 1998, KLAIM: a kernel language for agents interaction and mobility, IEEE Trans. Software Eng., 24, 315, 10.1109\u002F32.685256\nDe Nicola, 1996, A process algebra based on Linda, vol. 1061, 160\nGelernter, 1985, Generative communication in Linda, ACM Trans. Program. Lang. Syst., 7, 80, 10.1145\u002F2363.2433\nGelernter, 1992, Coordination languages and their significance, Commun. ACM, 35, 97, 10.1145\u002F129630.129635\nGroote, 1993, Transition system specifications with negative premises, Theoret. Comput. Sci., 118, 263, 10.1016\u002F0304-3975(93)90111-6\nHankin, 1993, A calculus of Gamma programs, vol. 757, 342\nHoare, 1985\nJacquet, 2000, On timed coordination languages, vol. 1906, 81\nT. Kielmann, Objective Linda: A Coordination Model for Object-Oriented Parallel Programming, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, University of Siegen, Germany, 1997.\nMalone, 1994, The interdisciplinary study of coordination, ACM Comput. Surveys, 26, 87, 10.1145\u002F174666.174668\nM. Mamei, F. Zambonelli, L. Leonardi, Tuples on the air: a middleware for context-aware computing in dynamic networks, in: Proceedings of the International Workshop on Mobile Computing Middleware, 2003, pp. 342–347.\nR. Menezes, R. Tolksdorf, A new approach to scalable Linda-systems based on swarms, in: Proceedings of ACM Symposium on Applied Computing, SAC 2003, Melbourne, FL, USA.\nMilner, 1989\nMilner, 1992, A calculus of mobile processes, Inform. and Comput., 100, 1, 10.1016\u002F0890-5401(92)90008-4\nMoller, 1990, A temporal calculus of communicating systems, vol. 458, 467\nSun Microsystem, Inc., JavaSpaces Specifications 1.1, 1999.\nSun Microsystem, Inc., Jini Distributed Leasing Specifications, 1998.\nOmicini, 1998, Coordination of mobile information agents in TuCSoN, J. Internet Res., 8, 10.1108\u002F10662249810241266\nPalamidessi, 2003, Comparing the expressive power of the synchronous and the asynchronous π-calculus, Math. Structures Comput. Sci., 13, 685, 10.1017\u002FS0960129503004043\nPapadopoulos, 1998, Coordination models and languages, Adv. Comput., 46, 329, 10.1016\u002FS0065-2458(08)60208-9\nG.P. Picco, A.L. Murphy, G.-C. Roman, Lime: Linda meets mobility, in: Proceedings of the 21st ICSE, 1999.\nReisig, 1985\nRowstron, 1998, WCL: a co-ordination language for geographically distributed agents, World Wide Web, 1, 167, 10.1023\u002FA:1019263731139\nWyckoff, 1998, T spaces, IBM Syst. J., 37, 10.1147\u002Fsj.373.0454\nG. Zavattaro, On the incomparability of Gamma and Linda, Technical Report SEN-R9827, Centrum voor Wiskunde en Informatica-CWI, 1998.\nZavattaro, 1998, Towards a hierarchy of negative test operators for generative communication, vol. 16(2)",{"EN":376},"A process algebraic view of shared dataspace coordination",{"VOID":378},"10.1016\u002Fj.jlap.2007.06.003","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832607000550",[381,396],{"id":382,"sortIndex":19,"researcher":18,"roles":383,"affiliations":384,"properties":393},"25be361d-3814-4f17-a68f-18a871752aa6",[83],[385],{"id":18,"sortIndex":19,"affiliation":386,"properties":18},{"id":387,"createTime":388,"updateTime":388,"relativeEntities":389,"slug":18,"properties":390,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"5b885287-fed6-44f3-b3d9-8e911d1bd200","2023-12-07T10:27:31.183+00:00",[],{"title":391},{"VI":392},"Dipartimento di Scienze dell’Informazione, Università di Bologna, Mura Anteo Zamboni 7, I-40127 Bologna, Italy",{"title":394},{"VI":395},"Nadia Busi",{"id":397,"sortIndex":111,"researcher":18,"roles":398,"affiliations":399,"properties":405},"2fea84ab-b6d7-41d0-8481-f4ee678a0ddd",[83],[400],{"id":18,"sortIndex":19,"affiliation":401,"properties":18},{"id":387,"createTime":388,"updateTime":388,"relativeEntities":402,"slug":18,"properties":403,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":404},{"VI":392},{"title":406},{"VI":407},"Gianluigi Zavattaro",{"url":379,"publisher":409,"properties":428},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":410,"slug":10,"properties":411,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":414,"manageAffiliations":415,"indexDatabases":416,"url":18,"thumbnailPath":18,"statistic":423,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":412,"title":413},{"VOID":13},{"EN":15},[],[],[417],{"id":24,"indexDatabase":418,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":419,"label":420,"description":421,"key":34,"publicationTags":422,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":424,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":425,"totalCitation":19,"totalCitationByYear":426,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":427,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":429,"pages":431},{"VOID":430},"75",{"VOID":432},"52-85","2008-02-01",{"id":435,"createTime":436,"updateTime":437,"relativeEntities":438,"slug":439,"properties":440,"entityType":74,"verifyStatus":75,"verifyTime":437,"verifyNote":76,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":447,"fullTextUrl":18,"authors":448,"publicationType":134,"publisherRelationship":490,"citationCount":18,"citationInfo":18,"publishDate":515,"publishYear":516,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"db8d720f-b8cf-4dbd-8daa-ee4c59392f4c","2024-02-05T19:25:13.397+00:00","2024-12-22T23:04:17.631+00:00",[],"Syntax-and-semantics-of-the-compositional-interchange-format-for-hybrid-systems",{"references":441,"title":443,"doi":445},{"VOID":442},"Baeten, 2009\nJ.C.M. Baeten, D.A. van Beek, D. Hendriks, A.T. Hofkamp, D.E. Nadales Agut, J.E. Rooda, R.R.H. Schiffelers, Definition of the Compositional Interchange Format, Technical Report Deliverable D1.1.2, MULTIFORM consortium, 2010.\nBengtsson, 2004, Timed automata: semantics, algorithms and tools, vol. 3098, 87\nBeohar, 2010, Hierarchical states in the compositional interchange format, vol. 32, 42\nBohnenkamp, 2006, Modest: a compositional modeling formalism for real-time and stochastic systems, IEEE Trans. Softw. Eng., 32, 812, 10.1109\u002FTSE.2006.104\nBornot, 2000, An algebraic framework for urgency, Inform. and Comput., 163, 172, 10.1006\u002Finco.2000.2999\nC4C consortium, Control for coordination of distributed systems, 2008. Available from: \u003Chttp:\u002F\u002Fwww.c4c-project.eu\u002F>.\nS.D. Cairano, A. Bemporad, M. Kvasnica, An Architecture for Data Interchange of Switched Linear Systems, Technical Report D 3.3.1, HYCON NoE, 2006.\nColumbus IST project, 2006. Available from: \u003Chttp:\u002F\u002Fwww.columbus.gr>.\nP.J.L. Cuijpers, Hybrid Process Algebra, Ph.D. thesis, Eindhoven University of Technology, 2004.\nCuijpers, 2008, Lost in translation: hybrid-time flows vs real-time transitions, vol. 4981, 116\nP.J.L. Cuijpers, M.A. Reniers, W.P.M.H. Heemels, Hybrid Transition Systems, Technical Report CS-Report 02-12, TU\u002Fe, Eindhoven, Netherlands, 2002.\nS. Di Cairano, A. Bemporad, An equivalence result between linear hybrid automata and piecewise affine systems, in: Proc. 45th IEEE Conference on Decision and Control, San Diego, pp. 2631–2636.\nEmbedded Systems Institute, Darwin project, 2006. Available from: \u003Chttp:\u002F\u002Fwww.esi.nl\u002Fsite\u002Fprojects\u002Fdarwin.html>.\nT.P. Engels, CIF to CIF Model Transformations, Master’s thesis, Eindhoven University of Technology, 2010.\nEtherCAT Technology Group, EtherCAT – internet for Control Automation Technology, 2011. Available from: \u003Chttp:\u002F\u002Fwww.ethercat.org\u002F>.\nS. Fisher, D.A. van Beek, R.J.M. Theunissen, D. Hendriks, C. Sonntag, Deliverable D2.4.1 Report on the Test Results of the Synthesis Tool Chain, Technical Report, MULTIFORM consortium, 2011.\nFrehse, 2005, PHAVer: algorithmic verification of hybrid systems past HyTech, vol. 3414, 258\nFrehse, 2011, SpaceEx: scalable verification of hybrid systems\nM. Goyal, G. Frehse, Translation Between CIF and SpaceEx\u002FPHAVer, Technical Report, MULTIFORM consortium, 2011.\nHeemels, 2001, Equivalence of hybrid dynamical models, Automatica, 37, 1085, 10.1016\u002FS0005-1098(01)00059-0\nD. Hendriks, R.R.H. Schiffelers, M. Hüfner, C. Sonntag, A transformation framework for the compositional interchange format for hybrid systems, in: Proc. 18th IFAC World Congress, Milan, pp. 12509–12514.\nHenzinger, 2000, The theory of hybrid automata, vol. 170, 265\nM. Hüfner, C. Sonntag, Deliverable D1.5.1 Realization of an interface to MUSCOD-II, Technical Report, MULTIFORM consortium, 2011.\nM. Hüfner, C. Sonntag, A. Jabrayilov, Finalization of the model exchange with Modelica and gPROMS, Technical Report, MULTIFORM consortium, 2010.\nHYCON Network of Excellence, Hybrid control: taming heterogeneity and complexity of networked embedded systems, 2005. Available from: \u003Chttp:\u002F\u002Fwww.ist-hycon.org\u002F>.\nHYCON 2 consortium, Highly-complex and networked control systems, 2010. Available from: \u003Chttp:\u002F\u002Fwww.hycon2.eu\u002F>.\nITEA Twins consortium, Optimizing HW-SW co-design flow for sofware intensive system development, 2009. Available from: \u003Chttp:\u002F\u002Fwww.twins-itea.org\u002F>.\nJohn, 2010\nLarsen, 1997, UPPAAL in a Nutshell, Int. J. Softw. Tools Technol. Transfer, 1, 134, 10.1007\u002Fs100090050010\nLynch, 2001, Hybrid I\u002FO automata revisited, 403\nMoBIES team, HSIF Semantics, Technical Report, University of Pennsylvania, 2002. Internal document.\nMousavi, 2005, Notions of bisimulation and congruence formats for SOS with data, Inform. and Comput., 200, 07, 10.1016\u002Fj.ic.2005.03.002\nMULTIFORM consortium, Integrated multi-formalism tool support for the design of networked embedded control systems MULTIFORM, 2008. Available from: \u003Chttp:\u002F\u002Fwww.multiform.bci.tu-dortmund.de>.\nD.E. Nadales Agut, M.A. Reniers, Deriving a simulator for a hybrid language using SOS rules, 2011. Available from: \u003Chttp:\u002F\u002Fse.wtb.tue.nl\u002Fsewiki\u002Fcif\u002Fpublications2>.\nD.E. Nadales Agut, M.A. Reniers, Linearization of CIF through SOS, in: B. Luttik, F. Valencia (Eds.), EXPRESS, EPTCS, vol. 64, 2011, pp. 74–88.\nD.E. Nadales Agut, D.A. van Beek, J.C.M. Baeten, Deliverable D1.2.1 Report on the Extension of Chi, Technical Report, MULTIFORM consortium, 2011.\nD.E. Nadales Agut, M.A. Reniers, R.R.H. Schiffelers, K.Y. Jørgensen, D.A. van Beek, A semantic-preserving transformation from the Compositional Interchange Format to UPPAAL, in: 18th Triennial World Congress of the International Federation of Automatic Control, Milano. CD-ROM.\nObject Management Group, Query\u002FView\u002FTransformation (QVT), version 1.0, 2009. Available from: \u003Chttp:\u002F\u002Fwww.omg.org\u002Fspec\u002FQVT\u002F1.0\u002F>.\nPinto, 2006, Interchange format for hybrid systems: abstract semantics, vol. 3927, 491\nPlotkin, 2004, A structural approach to operational semantics, J. Log. Algebr. Program., 60–61, 17\nReynolds, 1999\nR.R.H. Schiffelers, D.A. van Beek, K.L. Man, M.A. Reniers, J.E. Rooda, A hybrid language for modeling, simulation and verification, in: S. Engell, H. Guéguen, J. Zaytoon (Eds.), IFAC Conference on Analysis and Design of Hybrid Systems, Saint-Malo, Brittany, France, 2003, pp. 235–240.\nD.S. Scott, Outline of a Mathematical Theory of Computation, Technical Report PRG-2, Oxford University, Oxford, England, 1970.\nC. Sonntag, Deliverable D 1.4.2 Realisation of the Model Exchange of a Restricted Class of Models to Matlab\u002FSimulink, Technical Report, MULTIFORM consortium, 2011.\nC. Sonntag, S. Fisher, Translating sequential function charts to the compositional interchange format for hybrid systems, in: Proc. 49th IEEE Conference on Decision and Control, pp. 4250–4256.\nC. Sonntag, M. Hüfner, On the connection of equation- and automata-based languages: transforming the compositional interchange format to modelica, in: Proc. 18th IFAC World Congress, pp. 12515–12520.\nSteinberg, 2009\nStrubbe, 2005, A composition operator for systems with active and passive actions, 24\nR. Su, D.A. van Beek, J.E. Rooda, Deliverable D2.2.1 Report on Methods and Prototype Tool for the Supervisory Control of Complex Systems, Technical Report, MULTIFORM consortium, 2010.\nSystems Engineering, The Compositional Interchange Format for Hybrid Systems, 2010. Available from: \u003Chttp:\u002F\u002Fse.wtb.tue.nl\u002Fsewiki\u002Fcif\u002Fstart>.\nSystems Engineering Group TU\u002Fe, Overview of supervisory control tools, 2011. Available from: \u003Chttp:\u002F\u002Fse.wtb.tue.nl\u002Fsewiki\u002Fsupcon\u002Fcif_svc_overview>.\nSystems Engineering Group TU\u002Fe, CIF 2 tooling, 2011. Available from: \u003Chttp:\u002F\u002Fdevel.se.wtb.tue.nl\u002Ftrac\u002Fcif>.\nT.E. Foundation, Eclipse, 2011. Available from: \u003Chttp:\u002F\u002Fwww.eclipse.org\u002F>.\nThe MathWorks, Inc, Writing S-functions, version 6, 2005. Available from: \u003Chttp:\u002F\u002Fwww.mathworks.com>.\nR.J.M. Theunissen, R.R.H. Schiffelers, D.A. van Beek, J.E. Rooda, Supervisory control synthesis for a patient support system, in: Proceedings of the European Control Conference, Budapest, Hungary, pp. 4647–4652.\nD.A. van Beek, K.L. Man, M.A. Reniers, J.E. Rooda, R.R.H. Schiffelers, Syntax and Consistent Equation Semantics of Hybrid Chi, Technical Report CS-Report 04-37, Eindhoven University of Technology, Department of Computer Science, The Netherlands, 2004.\nvan Beek, 2006, Syntax and consistent equation semantics of hybrid Chi, J. Log. Algebr. Program., 68, 129, 10.1016\u002Fj.jlap.2005.10.005\nD.A. van Beek, M.A. Reniers, R.R.H. Schiffelers, J.E. Rooda, Foundations of a Compositional Interchange Format for Hybrid Systems, SE Report 2006-05, Eindhoven University of Technology, Systems Engineering Group, Department of Mechanical Engineering, Eindhoven, The Netherlands, 2006.\nvan Beek, 2007, Foundations of an interchange format for hybrid systems, vol. 4416, 587\nD.A. van Beek, A.T. Hofkamp, M.A. Reniers, J.E. Rooda, R.R.H. Schiffelers, Syntax and Formal Semantics of Chi 2.0, SE Report 2008-01, Eindhoven University of Technology, Systems Engineering Group, Department of Mechanical Engineering, Eindhoven, The Netherlands, 2008.\nvan Beek, 2010, Reconciling urgency and variable abstraction in a hybrid compositional setting, vol. 6246, 47\nD.A. van Beek, A. David, D. Hendriks, K.Y. Jörgensen, D.E. Nadales Agut, Deliverable D1.3.2 Software for Translations Between the CIF and UPPAAL, Technical Report, MULTIFORM consortium, 2011.\nD.A. van Beek, P. Collins, D.E. Nadales, J.E. Rooda, R.R.H. Schiffel-ers, New concepts in the abstract format of the compositional interchange format, in: A. Giua, C. Mahuela, M. Silva, J. Zaytoon (Eds.), 3rd IFAC Conference on Analysis and Design of Hybrid Systems, Zaragoza, Spain, 2009, pp. 250–255.\nvan Beek, 2006\nW3C, W3C SVG working group, 2011. Available from: \u003Chttp:\u002F\u002Fwww.w3.org\u002FGraphics\u002FSVG\u002F>.\nJ. Markovski, K. G. M. Jacobs, D. A. van Beek, L. J. A. M. Somers, J. E. Rooda, Coordination of Resources using Generalized State-Based Requirements. in: 10th International Workshop on Discrete Event Systems, 2010, pp. 300–305.",{"EN":444},"Syntax and semantics of the compositional interchange format for hybrid systems",{"VOID":446},"10.1016\u002Fj.jlap.2012.07.001","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832612000689",[449,466,478],{"id":450,"sortIndex":19,"researcher":18,"roles":451,"affiliations":452,"properties":463},"ba5eddc6-b8d4-49ac-9ed0-6b6f30d9074b",[83],[453],{"id":18,"sortIndex":19,"affiliation":454,"properties":18},{"id":455,"createTime":456,"updateTime":457,"relativeEntities":458,"slug":459,"properties":460,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"04b72363-5784-4280-b5d4-c70f0220d4d3","2024-02-05T19:25:13.427+00:00","2025-06-11T17:57:21.880+00:00",[],"Department-of-Mechanical-Engineering-Eindhoven-University-of-Technology-TU-e-Netherlands",{"title":461},{"VI":462},"Department of Mechanical Engineering, Eindhoven University of Technology (TU\u002Fe), Netherlands",{"title":464},{"VI":465},"D.E. Nadales Agut",{"id":467,"sortIndex":81,"researcher":18,"roles":468,"affiliations":469,"properties":475},"a8563dcb-b929-4cef-bd7a-6a5ed2e98e6b",[83],[470],{"id":18,"sortIndex":19,"affiliation":471,"properties":18},{"id":455,"createTime":456,"updateTime":457,"relativeEntities":472,"slug":459,"properties":473,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":474},{"VI":462},{"title":476},{"VI":477},"J.E. Rooda",{"id":479,"sortIndex":111,"researcher":18,"roles":480,"affiliations":481,"properties":487},"8565505c-5cd7-4974-979b-8678ae1bf35f",[83],[482],{"id":18,"sortIndex":19,"affiliation":483,"properties":18},{"id":455,"createTime":456,"updateTime":457,"relativeEntities":484,"slug":459,"properties":485,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":486},{"VI":462},{"title":488},{"VI":489},"D.A. van Beek",{"url":447,"publisher":491,"properties":510},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":492,"slug":10,"properties":493,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":496,"manageAffiliations":497,"indexDatabases":498,"url":18,"thumbnailPath":18,"statistic":505,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":494,"title":495},{"VOID":13},{"EN":15},[],[],[499],{"id":24,"indexDatabase":500,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":501,"label":502,"description":503,"key":34,"publicationTags":504,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":506,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":507,"totalCitation":19,"totalCitationByYear":508,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":509,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":511,"pages":513},{"VOID":512},"82",{"VOID":514},"1-52","2013-01-01",2013,{"id":518,"createTime":519,"updateTime":520,"relativeEntities":521,"slug":522,"properties":523,"entityType":74,"verifyStatus":75,"verifyTime":520,"verifyNote":76,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":530,"fullTextUrl":18,"authors":531,"publicationType":134,"publisherRelationship":559,"citationCount":18,"citationInfo":18,"publishDate":584,"publishYear":585,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"3f727f27-247b-4322-afed-7a36572ec63b","2024-01-10T17:22:57.803+00:00","2025-02-17T22:50:20.526+00:00",[],"Deriving-a-Floyd-Hoare-logic-for-non-local-jumps-from-a-formul%C3%A6-as-types-notion-of-control",{"references":524,"title":526,"doi":528},{"VOID":525},"Apt, 1981, Ten years of Hoare’s logic: a survey – part I, ACM Trans. Program. Lang. Syst., 3, 431, 10.1145\u002F357146.357150\nAudebaud, 1999, Deriving proof rules from continuation semantics, Formal Aspects Comput., 11, 426, 10.1007\u002Fs001650050041\nF. Barbanera, S. Berardi, Extracting constructive content from classical logic via control-like reductions, in: LNCS, vol. 662, Springer-Verlag, 1994, pp. 47–59.\nBarnes, 2003\nBenton, 1998, Computational types from a logical perspective, J. Funct. Programming, 8, 177, 10.1017\u002FS0956796898002998\nM. Berger, Program logics for sequential higher-order control, in: Proceedings of the Third IPM International Conference, FSEN 2009, Lecture Notes in Computer Science, vol. 5961, Springer, 2010, pp. 194–211.\nBerger, 2002, Refined program extraction from classical proofs, Ann. Pure Appl. Logic, 114, 3, 10.1016\u002FS0168-0072(01)00073-2\nU. Berger, H. Schwichtenberg, Program development by proof transformation, in: H. Schwichtenberg (Ed.), Proof and Computation, Series F: Computer and Systems Sciences, vol. 139, NATO Advanced Study Institute, International Summer School held in Marktoberdorf, Germany, July 20–August 1, 1993, Springer-Verlag, 1995, pp. 1–45.\nU. Berger, H. Schwichtenberg, Program extraction from classical proofs, in: Daniel Leivant (Ed.), Logic and Computational Complexity, Lecture Notes in Computer Science, vol. 139, Springer, Berlin\u002F Heidelberg, 1995, pp. 77–97.\nBorgida, 2002, On the frame problem in procedure specifications, IEEE Trans. Softw. Engrg., 21, 785, 10.1109\u002F32.469460\nClarke, 1979, Programming language constructs for which it is impossible to obtain good Hoare axioms, J. ACM, 26, 10.1145\u002F322108.322121\nClint, 1973, Program proving: coroutines, Acta Inform., 2, 50, 10.1007\u002FBF00571463\nClint, 1972, Program proving: jumps and functions, Acta Inform., 1, 214, 10.1007\u002FBF00288686\nColson, 1998, System T, call-by-value and the minimum problem, Theor. Comput. Sci., 206, 301, 10.1016\u002FS0304-3975(98)00011-5\nConstable, 1986\nT. Coquand, Computational content of classical logic, in: Semantics and Logics of Computation, Cambridge University Press, 1996, pp. 470–517.\nP. Cousot, Methods and logics for proving programs, in: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), Elsevier Science Publishers B.V., North Holland, 1990, pp. 841–994.\nCrolard, 2004, A formulæ-as-types interpretation of subtractive logic, J. Logic Comput., 14, 529, 10.1093\u002Flogcom\u002F14.4.529\nT. Crolard, Certification de programmes impératifs d’ordre supérieur avec mécanismes de contrôle, Habilitation Thesis, LACL, Université Paris-Est, 2010.\nT. Crolard, A formally specified program logic for higher-order procedural variables and non-local jumps, Technical Report TR-LACL-2011-5, Université Paris-Est, 2011. Also available as arXiv:1112.1848.\nT. Crolard, E. Polonowski, A program logic for higher-order procedural variables and non-local jumps, Technical Report TR-LACL-2011-4, Université Paris-Est, 2011, Chapter 3 of the first author’s Habilitation thesis. Also available as arXiv:1112.1554.\nCrolard, 2009, Extending the Loop Language with Higher-Order Procedural Variables, ACM TOCL Implicit Comput. Complex., 10, 1\nCurry, 1958\nDamm, 1983, A sound relatively complete Hoare-logic for a language with higher type procedures, Acta Inform., 20, 59, 10.1007\u002FBF00264295\nO. Danvy, Back to Direct Style, in: ESOP’92, Springer, 1992, pp. 130–150.\nDanvy, 1992, Back to direct style II: first-class continuations, SIGPLAN Lisp Pointers, V, 299, 10.1145\u002F141478.141564\nP. de Groote, A simple calculus of exception handling, in: Second International Conference on Typed Lambda Calculi and Applications, LNCS, Edinburgh, United Kingdom, 1995, pp. 201–215.\nDonahue, 1977, Locations considered unnecessary, Acta Inform., 8, 221, 10.1007\u002FBF00264468\nM. Felleisen, The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages, Ph.D. thesis, Indiana University, Indianapolis, IN, USA, 1987.\nX. Feng, Z. Shao, A. Vaynberg, S. Xiang, Z. Ni, Modular verification of assembly code with stack-based control abstractions, in: Proceedings of the 2006 ACM SIGPLAN, Conference on Programming Language Design and Implementation (PLDI’06), New York, NY, USA, June 2006, ACM Press, pp. 401–414.\nFloyd, 1967, Assigning meanings to programs, Math. Aspects Comput. Sci., 19, 1\nFriedman, 1978, Classically and intuitionistically provably recursive functions, Higher Set Theory, 21, 10.1007\u002FBFb0103100\nJ.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, vol. 7, Cambridge Tracts in Theorical Comp. Sci., 1989.\nGödel, 1958, Über eine bisher noch nicht benützteerweiterung des finiten standpunktes, Dialectica, 12, 280, 10.1111\u002Fj.1746-8361.1958.tb01464.x\nGordon, 1988\nT.G. Griffin, A formulæ-as-types notion of control, in: Conference Record of the 17th Annual ACM Symposium on Principles of Programming Langages, 1990, pp. 47–58.\nHarper, 1993, Typing first-class continuations in ML, J. Funct. Programming, 3, 465, 10.1017\u002FS095679680000085X\nJ. Hatcliff, O. Danvy, A generic account of continuation-passing styles, in: POPL ’94: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York, NY, USA, ACM, 1994, pp. 458–471.\nHenson, 1990, Information loss in the programming logic TK\nH. Herbelin, On the degeneracy of sigma-types in presence of computational classical logic, in: Pawel Urzyczyn (Ed.), Seventh International Conference, TLCA ’05, Nara, Japan, April 2005, Proceedings, Lecture Notes in Computer Science, vol. 3461, Springer, 2005, pp. 209–220.\nHoare, 1969, An axiomatic basis for computer programming, Commun. ACM, 12, 576, 10.1145\u002F363235.363259\nC.A.R. Hoare, Procedures and parameters: an axiomatic approach, in: Symposium on Semantics of Algorithmic Languages, vol. 188, Springer, 1971, pp. 102–116.\nHonda, 2006, Descriptive and relative completeness of logics for higher-order functions, Autom. Lang. Programming, 360, 10.1007\u002F11787006_31\nHonda, 2005, An observationally complete program logic for imperative higher-order functions, Symp. Logic Comput. Sci. LICS, 5, 270\nW.A. Howard, The formulæ-as-types notion of constructions, in: H.B. To, Curry: Essays on Combinatory Logic, Lambda-Calculs and Formalism, Academic Press, 1969, pp. 479–490.\nK. Jensen, Connection between Dijkstra’s predicate transformers and denotational continuation semantics, Technical Report DAIMI PB-86, Computer Science Dept., Aarhus Univ., 1978.\nJones, 1990\nKelsey, 1998, Revised5 report on the algorithmic language scheme, Higher-Order Symbolic Comput., 11, 7, 10.1023\u002FA:1010051815785\nKleymann, 1999, Hoare logic and auxiliary variables, Formal Aspects Comput., 11, 541, 10.1007\u002Fs001650050057\nKrivine, 1994, Classical logic, storage operators and second order λ-calculus, Ann. Pure Appl. Logic, 68, 53, 10.1016\u002F0168-0072(94)90047-7\nKrivine, 1990, Programming with proofs, J. Inf. Process. Cybernet. EIK, 26, 149\nLandin, 1964, The mechanical evaluation of expressions, Comput. J., 6, 308, 10.1093\u002Fcomjnl\u002F6.4.308\nLandin, 1965, A correspondence between ALGOL 60 and Church’s lambda-notations: part II, Commun. ACM, 8, 158, 10.1145\u002F363791.363804\nP.J. Landin, A generalization of jumps and labels, Technical Report, UNIVAC Systems Programming Research, 1965.\nLandin, 1965, A correspondence between ALGOL 60 and Church’s lambda-notation: part I, Commun. ACM, 8, 89, 10.1145\u002F363744.363749\nLeivant, 1990, Contracting proofs to programs, 279\nLeivant, 2002, Intrinsic reasoning about functional programs I: first order theories, Ann. Pure Appl. Logic, 114, 117, 10.1016\u002FS0168-0072(01)00078-1\nC. Lewington, Towards constructive program derivation in VDM, in: Kesav Nori, C. Veni Madhavan (Eds.), Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 472, Springer, Berlin\u002FHeidelberg, 1990, pp. 115–132.\nY. Makarov, Practical program extraction from classical proofs, Electron. Notes Theor. Comput. Sci. 155 (2006) 521–542 (in: Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI)).\nY. Makarov, Simplifying programs extracted from classical proofs, in: Stephen van Bakel, Stefano Berardi (Eds.), Workshop on Classical Logic and Computation, 2006.\nA.R. Meyer, D.M. Ritchie, The complexity of loop programs, in: Proceedings of the ACM Nat. Meeting, 1976.\nE. Moggi, An Abstract View of Programming Languages, University of Edinburgh, Department of Computer Science, Laboratory for Foundations of Computer Science, 1990.\nMoggi, 1991, Notions of computation and monads, Inform. and Comput., 93, 55, 10.1016\u002F0890-5401(91)90052-4\nC.R. Murthy, Extracting constructive content from classical proofs, Ph.D. thesis, Cornell University, Department of Computer Science, 1990.\nC.R. Murthy, An evaluation semantics for classical proofs, in: Proceedings of the 6th Annual IEEE Symp. on Logic in Computer Science, 1991, pp. 96–107.\nC.R. Murthy, Classical proofs as programs: how, when, and why, Technical Report 91-1215, Cornell University, Department of Computer Science, 1991.\nA. Nanevski, G. Morrisett, L. Birkedal, Polymorphism and separation in hoare type theory, in: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ACM, New York, NY, USA, 2006, pp. 62–73.\nA. Nanevski, G. Morrisett, A. Shinnar, P. Govereau, L. Birkedal, Ynot: reasoning with the awkward squad, in: ACM SIGPLAN International Conference on Functional Programming, Citeseer, 2008.\nO’Donnell, 1982, A critique of the foundations of Hoare style programming logics, Commun. ACM, 25, 927, 10.1145\u002F358728.358748\nO’Hearn, 2000, From Algol to polymorphic linear lambda-calculus, J. ACM, 47, 167, 10.1145\u002F331605.331611\nM. Parigot, Strong normalization for second order classical natural deduction, in: Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, 1993.\nPfenning, 2001, A judgmental reconstruction of modal logic, Math. Struct. Comput. Sci., 11, 511, 10.1017\u002FS0960129501003322\nF. Pfenning, C. Schürmann, System description: Twelf – a meta-logical framework for deductive systems, in: CADE-16: Proceedings of the 16th International Conference on Automated Deduction, London, UK, Springer-Verlag, 1999, pp. 202–206.\nPlotkin, 1975, Call-by-name, call-by-value and the lambda-calculus, TCS, 1, 125, 10.1016\u002F0304-3975(75)90017-1\nI. Poernomo, Proofs-as-imperative-programs: application to synthesis of contracts, in: Perspectives of System Informatics: 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9–12, 2003, Revised Papers, 2003.\nI. Poernomo, J.N. Crossley, The Curry–Howard isomorphism adapted for imperative program synthesis and reasoning, in: Proceedings of the 7th and 8th Asian Logic Conferences, World Scientific, 2003.\nN.J. Rehof, M.H. Sørensen, The λΔ-calculus, in: Theoretical Aspects of Computer Software, LNCS, vol. 542, Springer-Verlag, 1994, pp. 516–542.\nReus, 2005, About Hoare logics for higher-order store, Autom. Lang. Programming, 1337, 10.1007\u002F11523468_108\nReynolds, 1974, On the relation between direct and continuation semantics, Autom. Lang. Programming, 141, 10.1007\u002F3-540-06841-4_57\nSchmidt, 1986\nD. Sitaram, M. Felleisen, Reasoning with continuations II: full abstraction for models of control, in: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, LFP ’90, New York, NY, USA, ACM, 1990, pp. 161–175.\nM.H. Sørensen, P. Urzyczyn, Lectures on the Curry–Howard Isomorphism, Studies in Logic and the Foundations of Mathematics, vol. 149, Elsevier, 2006.\nSpivey, 1989\nW. Swierstra, A hoare logic for the state monad, in: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science, vol. 5674, Springer, 2009, pp. 440–451.\nG. Tan, A.W. Appel, A compositional logic for control flow, in: Verification, Model Checking, and Abstract Interpretation, Lecture Notes in Computer Science, vol. 3855, Springer, 2006, pp. 80–94.\nTennent, 1991, Continuations in possible-world semantics, Theor. Comput. Sci., 85, 283, 10.1016\u002F0304-3975(91)90184-4\nThielecke, 1998, An introduction to Landin’s “A Generalization of Jumps and Labels”, Higher-Order Symbolic Comput., 11, 117, 10.1023\u002FA:1010060315625\nThielecke, 2008, Control effects as a modality, J. Funct. Programming, 19, 17, 10.1017\u002FS0956796808006734\nA.S. Troelstra, Realizability, in: Handbook of Proof Theory, vol. 137, chapter VI, Elsevier, 1998, pp. 407–473.\nH. Xi, Imperative programming with dependent types, in: Proceedings of 15th IEEE Symposium on Logic in Computer Science, Santa Barbara, 2000, pp. 375–387.",{"EN":527},"Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control",{"VOID":529},"10.1016\u002Fj.jlap.2012.01.004","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832612000057",[532,547],{"id":533,"sortIndex":111,"researcher":18,"roles":534,"affiliations":535,"properties":544},"c9ead0a8-35e6-45bb-bae3-24d8de17b75a",[83],[536],{"id":18,"sortIndex":19,"affiliation":537,"properties":18},{"id":538,"createTime":539,"updateTime":539,"relativeEntities":540,"slug":18,"properties":541,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"15cdb5ee-a5f4-4635-a0cb-23c4feed6835","2024-01-10T17:22:57.825+00:00",[],{"title":542},{"VI":543},"LACL, Université Paris-Est, 61 avenue du Général de Gaulle, 94010 Créteil Cedex, France",{"title":545},{"VI":546},"E. Polonowski",{"id":548,"sortIndex":19,"researcher":18,"roles":549,"affiliations":550,"properties":556},"b8932fc0-0aef-4333-a9c2-cb505b5de169",[83],[551],{"id":18,"sortIndex":19,"affiliation":552,"properties":18},{"id":538,"createTime":539,"updateTime":539,"relativeEntities":553,"slug":18,"properties":554,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":555},{"VI":543},{"title":557},{"VI":558},"T. Crolard",{"url":530,"publisher":560,"properties":579},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":561,"slug":10,"properties":562,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":565,"manageAffiliations":566,"indexDatabases":567,"url":18,"thumbnailPath":18,"statistic":574,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":563,"title":564},{"VOID":13},{"EN":15},[],[],[568],{"id":24,"indexDatabase":569,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":570,"label":571,"description":572,"key":34,"publicationTags":573,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":575,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":576,"totalCitation":19,"totalCitationByYear":577,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":578,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":580,"pages":582},{"VOID":581},"81",{"VOID":583},"181-208","2012-04-01",2012,{"id":587,"createTime":588,"updateTime":589,"relativeEntities":590,"slug":591,"properties":592,"entityType":74,"verifyStatus":75,"verifyTime":589,"verifyNote":76,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":599,"fullTextUrl":18,"authors":600,"publicationType":134,"publisherRelationship":676,"citationCount":18,"citationInfo":18,"publishDate":701,"publishYear":702,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"beb4df31-b9bb-4747-a463-ce6bea4a1472","2024-01-12T02:32:00.007+00:00","2025-01-29T22:38:16.916+00:00",[],"Positive-loop-closed-automata-a-decidable-class-of-hybrid-systems",{"references":593,"title":595,"doi":597},{"VOID":594},"Chaochen, 1991, A calculus of durations, Information Processing Letter, 40, 269, 10.1016\u002F0020-0190(91)90122-X\nHenzinger, 1996, The theory of hybrid automata, 278\nAlur, 1995, The algorithmic analysis of hybrid systems, Theoretical Computer Science, 138, 3, 10.1016\u002F0304-3975(94)00202-T\nChaochen, 1994, Linear duration invariants, vol. 863, 88\nKesten, 1999, Decidable integration graphs, Information and Computation, 150, 209, 10.1006\u002Finco.1998.2774\nT.A. Henzinger, P.W. Kopke, Anuj Puri, Pravin Varaiya, What’s decidable about hybrid automata? Journal of Computer and System Sciences 57 (1998) 94–124\nHenzinger, 2000, Symbolic model checking for rectangular hybrid systems\nHenzinger, 1997, HYTECH: a model checker for hybrid systems, Software Tools for Technology Transfer, 1, 110, 10.1007\u002Fs100090050008\nAlur, 1993, Computing accumulated delays in real-time systmes, vol. 818, 181\nAlur, 1994, A theory of timed automata, Theoretical Computer Science, 126, 183, 10.1016\u002F0304-3975(94)90010-8\nHenzinger, 1998, Algorithmic analysis of nonlinear hybrid systems, IEEE Transactions on Automatic Control, 43, 540, 10.1109\u002F9.664156\nHenzinger, 1998, Reachability verification for hybrid automata, vol. 1386, 190\nHalbwachs, 1994, Verification of linear hybrid systems by means of convex approximations\nAvrunin, 1998, Analyzing partially-implemented real-time systems, IEEE Transactions on Software Engineering, 24, 602, 10.1109\u002F32.707696\nAsarin, 1997, A Kleene theorem for timed automata, 160\nJianhua, 1998, On checking parallel real-time systems for linear duration properties, vol. 1486, 241\nZ. Jianhua, D. Van Hung, Checking timed automata for some discretisable duration properties, Research Report 145, UNU\u002FIIST, Macau, 1998\nXuandong, 2001, Efficient verification of a class of linear hybrid automata using linear programming, vol. 2144, 465\nXuandong, 1997, Checking hybrid automata for linear duration invariants, vol. 1345, 166\nXuandong, 1998, Hybrid regular expressions, vol. 1386, 384",{"EN":596},"Positive loop-closed automata: a decidable class of hybrid systems",{"VOID":598},"10.1016\u002Fs1567-8326(02)00024-3","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832602000243",[601,616,628,640,652,664],{"id":602,"sortIndex":81,"researcher":18,"roles":603,"affiliations":604,"properties":613},"7f163f0c-4d4d-4bea-a19c-4b684c9c35b7",[83],[605],{"id":18,"sortIndex":19,"affiliation":606,"properties":18},{"id":607,"createTime":608,"updateTime":608,"relativeEntities":609,"slug":18,"properties":610,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"edcee684-2a81-4dbc-84ab-79d9f8217014","2024-01-12T02:32:00.087+00:00",[],{"title":611},{"VI":612},"Department of Computer Science and Technology, State Key Laboratory of Novel Software Technology, Nanjing University, Jiangsu, Nanjing 210093, People’s Republic of China",{"title":614},{"VI":615},"Yu Pei",{"id":617,"sortIndex":19,"researcher":18,"roles":618,"affiliations":619,"properties":625},"9764d5d3-6bb4-4ddf-b96b-97f7a202a9b0",[83],[620],{"id":18,"sortIndex":19,"affiliation":621,"properties":18},{"id":607,"createTime":608,"updateTime":608,"relativeEntities":622,"slug":18,"properties":623,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":624},{"VI":612},{"title":626},{"VI":627},"Xuandong Li",{"id":629,"sortIndex":111,"researcher":18,"roles":630,"affiliations":631,"properties":637},"3e8147d7-b679-4853-a82f-d5bb00b05dff",[83],[632],{"id":18,"sortIndex":19,"affiliation":633,"properties":18},{"id":607,"createTime":608,"updateTime":608,"relativeEntities":634,"slug":18,"properties":635,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":636},{"VI":612},{"title":638},{"VI":639},"Jianhua Zhao",{"id":641,"sortIndex":46,"researcher":18,"roles":642,"affiliations":643,"properties":649},"8bdbecde-4e08-4b83-97c5-23ee5ed3183c",[83],[644],{"id":18,"sortIndex":19,"affiliation":645,"properties":18},{"id":607,"createTime":608,"updateTime":608,"relativeEntities":646,"slug":18,"properties":647,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":648},{"VI":612},{"title":650},{"VI":651},"Guoliang Zheng",{"id":653,"sortIndex":44,"researcher":18,"roles":654,"affiliations":655,"properties":661},"27c18d8a-c239-4878-9470-1b438d0d818a",[83],[656],{"id":18,"sortIndex":19,"affiliation":657,"properties":18},{"id":607,"createTime":608,"updateTime":608,"relativeEntities":658,"slug":18,"properties":659,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":660},{"VI":612},{"title":662},{"VI":663},"Yong Li",{"id":665,"sortIndex":54,"researcher":18,"roles":666,"affiliations":667,"properties":673},"d64a944b-39bc-47bd-9947-94061a7262cc",[83],[668],{"id":18,"sortIndex":19,"affiliation":669,"properties":18},{"id":607,"createTime":608,"updateTime":608,"relativeEntities":670,"slug":18,"properties":671,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":672},{"VI":612},{"title":674},{"VI":675},"Tao Zheng",{"url":599,"publisher":677,"properties":696},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":678,"slug":10,"properties":679,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":682,"manageAffiliations":683,"indexDatabases":684,"url":18,"thumbnailPath":18,"statistic":691,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":680,"title":681},{"VOID":13},{"EN":15},[],[],[685],{"id":24,"indexDatabase":686,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":687,"label":688,"description":689,"key":34,"publicationTags":690,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":692,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":693,"totalCitation":19,"totalCitationByYear":694,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":695,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":697,"pages":699},{"VOID":698},"52",{"VOID":700},"79-108","2002-07-01",2002,{"id":704,"createTime":705,"updateTime":706,"relativeEntities":707,"slug":708,"properties":709,"entityType":74,"verifyStatus":75,"verifyTime":706,"verifyNote":76,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":716,"fullTextUrl":18,"authors":717,"publicationType":134,"publisherRelationship":740,"citationCount":18,"citationInfo":18,"publishDate":764,"publishYear":161,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"2591a764-4e84-4baa-901a-803dffaed0bd","2024-01-09T15:42:24.918+00:00","2024-12-26T22:34:26.756+00:00",[],"Contact-closure-topology-and-the-linking-of-row-and-column-types-of-relations",{"references":710,"title":712,"doi":714},{"VOID":711},"Aumann, 1970, Kontaktrelationen, Bayer. Akad. Wiss. Math.-Natur. Kl. Sitzungsber., 1970, 67\nAumann, 1974\nBehnke, 1998, RelView — a system for calculation with relations and relational programming, 318\nBerghammer, 2006, Relation-algebraic computation of fixed points with applications, J. Logic Algebraic Programming, 66, 112, 10.1016\u002Fj.jlap.2005.04.007\nBerghammer, 2009, Computing and visualizing closure objects using relations and RelView, 29\nBerghammer, 2005, Computing and visualizing closure objects using relations and RelView, 40\nR. Berghammer, G. Schmidt, H. Zierer, Symmetric quotients, Report TUM-I8620, Institut für Informatik, Technische Universität München, 1986.\nBerghammer, 1989, Symmetric quotients and domain constructions, Inform. Process. Lett., 33, 163, 10.1016\u002F0020-0190(89)90197-X\nBerghammer, 2010, Embedding mappings and splittings with applications, Acta Inform., 47, 77, 10.1007\u002Fs00236-009-0109-4\nG. Birkhoff, Mathematics and psychology, Text of a talk given at the General Motors Research Laboratories on November 28, 1967.\n1997\nCaspard, 2003, The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey, Discrete Appl. Math., 127, 241, 10.1016\u002FS0166-218X(02)00209-3\nDemetrovics, 1992, Functional dependencies in relational databases: a lattice point of view, Discrete Appl. Math., 40, 155, 10.1016\u002F0166-218X(92)90028-9\nDoignon, 1999\nDüntsch, 2000, A proof system for contact relation algebras, J. Philos. Logic, 29, 241, 10.1023\u002FA:1004764610651\nDüntsch, 2005, A representation theorem for Boolean contact algebras, Theoret. Comput. Sci. B, 347, 498, 10.1016\u002Fj.tcs.2005.06.030\nM. Erné, Ordnungskombinatorik (Combinatorics of Orders), Lecture Notes, Universität Hannover, Winter Semester 1998\u002F99, 1999.\nGanter, 1998\nPrivate communication with P. Jipsen 2008.\nKim, 1982\nSchmidt, 2011\nG. Schmidt, T. Ströhlein, Relationen und Graphen, Springer, 1989 (Available in English: Relations and graphs. Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science, Springer, 1993).\nTarski, 1941, On the calculus of relations, J. Symbolic Logic, 6, 73, 10.2307\u002F2268577\nA. Tarski, S. Givant, A Formalization of Set Theory without Variables, vol. 41, Colloquium Publications, American Mathematical Society, 1987.",{"EN":713},"Contact, closure, topology, and the linking of row and column types of relations",{"VOID":715},"10.1016\u002Fj.jlap.2011.04.007","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS156783261100018X",[718,729],{"id":719,"sortIndex":111,"researcher":18,"roles":720,"affiliations":721,"properties":727},"84786b65-3ee7-4bd6-8815-07d5ef3d2b0f",[83],[722],{"id":18,"sortIndex":19,"affiliation":723,"properties":18},{"id":182,"createTime":183,"updateTime":183,"relativeEntities":724,"slug":18,"properties":725,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":726},{"VI":187},{"title":728},{"VI":190},{"id":730,"sortIndex":19,"researcher":18,"roles":731,"affiliations":732,"properties":738},"1fe1e479-b9ca-4d09-be9e-9a2ada770698",[83],[733],{"id":18,"sortIndex":19,"affiliation":734,"properties":18},{"id":197,"createTime":198,"updateTime":198,"relativeEntities":735,"slug":18,"properties":736,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":737},{"VI":202},{"title":739},{"VI":205},{"url":716,"publisher":741,"properties":760},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":742,"slug":10,"properties":743,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":746,"manageAffiliations":747,"indexDatabases":748,"url":18,"thumbnailPath":18,"statistic":755,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":744,"title":745},{"VOID":13},{"EN":15},[],[],[749],{"id":24,"indexDatabase":750,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":751,"label":752,"description":753,"key":34,"publicationTags":754,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":756,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":757,"totalCitation":19,"totalCitationByYear":758,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":759,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":761,"pages":762},{"VOID":157},{"VOID":763},"339-361","2011-08-01",{"id":766,"createTime":767,"updateTime":768,"relativeEntities":769,"slug":770,"properties":771,"entityType":74,"verifyStatus":75,"verifyTime":778,"verifyNote":76,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":779,"fullTextUrl":18,"authors":780,"publicationType":134,"publisherRelationship":822,"citationCount":18,"citationInfo":18,"publishDate":847,"publishYear":848,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":162},"eeedb4b9-c189-4a5d-9cbb-2d3407a00130","2024-01-28T11:39:02.588+00:00","2025-01-16T22:08:29.295+00:00",[],"Formally-transforming-user-model-testing-problems-into-implementer-model-testing-problems-and-viceversa",{"references":772,"title":774,"doi":776},{"VOID":773},"C. Andrés, L. Llana, I. Rodríguez, Formally comparing user and implementer model-based testing methods, in: IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW’08, 4th Workshop on Advances in Model Based Testing, A-MOST 2008, IEEE Computer Society Press, 2008, pp. 1–10.\nC. Andrés, L. Llana, I. Rodríguez, Formally transforming user-model testing problems into implementer-model testing problems and viceversa: complete running example, 2008. \u003Chttp:\u002F\u002Fkimba.mat.ucm.es\u002Fjlap08\u002F>.\nBayse, 2005, A passive testing approach based on invariants: application to the WAP, Comput. Netw., 48, 247, 10.1016\u002Fj.comnet.2004.09.009\nBottaci, 1999, Efficiency of mutation operators and selective mutation strategies: an empirical study, Softw. Test. Verif. Reliab., 9, 205, 10.1002\u002F(SICI)1099-1689(199912)9:4\u003C205::AID-STVR186>3.0.CO;2-X\nJ. Bouchet, L. Madani, L. Nigay, C. Oriat, I. Parissis, Formal testing of multimodal interactive systems, in: Engineering Interactive Systems, EIS’07, 2007.\nE. Brinksma, J. Tretmans, Testing transition systems: an annotated bibliography, in: 4th Summer School on Modeling and Verification of Parallel Processes, MOVEP’00, LNCS, vol. 2067, Springer, 2001, pp. 187–195.\nCardell-Oliver, 2000, Conformance tests for real-time systems with timed automata specifications, Formal Aspects Comput., 12, 350, 10.1007\u002Fs001650070009\nChow, 1978, Testing software design modelled by finite state machines, IEEE Trans. Softw. Eng., 4, 178, 10.1109\u002FTSE.1978.231496\nFujiwara, 1991, Test selection based on finite-state models, IEEE Trans. Softw. Eng., 17, 591, 10.1109\u002F32.87284\nHamlet, 1977, Testing programs with the aid of a compiler, IEEE Trans. Softw. Eng., 3, 279, 10.1109\u002FTSE.1977.231145\nHierons, 2002, Comparing test sets and criteria in the presence of test hypotheses and fault domains, ACM Trans. Softw. Eng. Methodol., 11, 427, 10.1145\u002F606612.606615\nR. Hierons, M.G. Merayo, Mutation testing from probabilistic finite state machines, in: Third Workshop on Mutation Analysis, MUTATION’07. IEEE Computer Society Press, 2007, pp. 141–150.\nHierons, 1999, Using program slicing to assist in the detection of equivalent mutants, Softw. Test. Verif. Reliab., 9, 233, 10.1002\u002F(SICI)1099-1689(199912)9:4\u003C233::AID-STVR191>3.0.CO;2-3\nLee, 1996, Principles and methods of testing finite state machines: a survey, Proc. IEEE, 84, 1090, 10.1109\u002F5.533956\nL.F. Llana-Dı´az, M. Núñez, I. Rodrı´guez, Customized testing for probabilistic systems, in: 18th Int. Conf. on Testing Communicating Systems, TestCom’06, LNCS, vol. 3964, Springer, 2006, pp. 87–102.\nL.F. Llana-Dı´az, M. Núñez, and I. Rodrı´guez, Derivation of a suitable finite test suite for customized probabilistic systems, in: Formal Techniques for Networked and Distributed Systems, FORTE’06, LNCS, vol. 4229, Springer, 2006, pp. 467–483.\nLuo, 1994, Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method, IEEE Trans. Softw. Eng., 20, 149, 10.1109\u002F32.265636\nL. Madani, C. Oriat, I. Parissis, J. Bouchet, L. Nigay, Synchronous testing of multimodal systems: an operational profile-based approach, in: 17th International Symposium on Software Reliability Engineering, ISSRE’05, IEEE Computer Society Press, 2005, pp. 325–334.\nL. Madani, I. Parissis, Automated test of interactive applications using task trees, in: IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW’08, 4th Workshop on Advances in Model Based Testing, A-MOST 2008, IEEE Computer Society Press, 2008, pp. 53–62.\nMori, 2002, CTTE: Support for developing and analyzing task models for interactive system design, IEEE Trans. Softw. Eng., 28, 797, 10.1109\u002FTSE.2002.1027801\nNtafos, 1988, A comparison of some structural testing strategies, IEEE Trans. Softw. Eng., 14, 868, 10.1109\u002F32.6165\nA. Petrenko, Fault model-driven test derivation from finite state models: Annotated bibliography, in: 4th Summer School on Modeling and Verification of Parallel Processes, MOVEP’00, LNCS, vol. 2067, Springer, 2001, pp. 196–205.\nA. Petrenko, N. Yevtushenko, and G. von Bochmann, Fault models for testing in context, in: Formal Description Techniques for Distributed Systems and Communication Protocols (IX), and Protocol Specification, Testing, and Verification (XVI), Chapman & Hall, 1996, pp. 163–178.\nPfleeger, 1998\nRodrı´guez, 2008, HOTL: hypotheses and observations testing logic, J. Logic Algebraic Program., 74, 57, 10.1016\u002Fj.jlap.2007.03.002\nJ. Tretmans, A Formal Approach to Conformance Testing, PhD thesis, University of Twente, Enschede, The Netherlands, 1992.\nTretmans, 1996, Test generation with inputs, outputs and repetitive quiescence, Software – Concepts and Tools, 17, 103\nJ. Tretmans, Model based testing with labelled transition systems, in: Formal Methods and Testing, LNCS, vol. 4949, Springer, 2008, pp. 1–38.",{"EN":775},"Formally transforming user-model testing problems into implementer-model testing problems and viceversa",{"VOID":777},"10.1016\u002Fj.jlap.2009.01.003","2025-01-16T22:08:29.294+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1567832609000046",[781,798,810],{"id":782,"sortIndex":111,"researcher":18,"roles":783,"affiliations":784,"properties":795},"a6abc432-3677-4a49-941c-7bcab7da78ae",[83],[785],{"id":18,"sortIndex":19,"affiliation":786,"properties":18},{"id":787,"createTime":788,"updateTime":789,"relativeEntities":790,"slug":791,"properties":792,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"00f15cbf-a387-46ff-85d9-d46379734117","2024-01-28T11:39:02.597+00:00","2025-06-11T14:25:35.052+00:00",[],"Dept-Sistemas-Inform%C3%A1ticos-y-Computaci%C3%B3n-Universidad-Complutense-de-Madrid-28040-Madrid-Spain",{"title":793},{"VI":794},"Dept. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, 28040 Madrid, Spain",{"title":796},{"VI":797},"Luis Llana",{"id":799,"sortIndex":81,"researcher":18,"roles":800,"affiliations":801,"properties":807},"5b2444f8-1820-40d0-b140-8b17ae02a21f",[83],[802],{"id":18,"sortIndex":19,"affiliation":803,"properties":18},{"id":787,"createTime":788,"updateTime":789,"relativeEntities":804,"slug":791,"properties":805,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":806},{"VI":794},{"title":808},{"VI":809},"Ismael Rodríguez",{"id":811,"sortIndex":19,"researcher":18,"roles":812,"affiliations":813,"properties":819},"8a3b0332-6366-4e4e-91d9-814e43776584",[83],[814],{"id":18,"sortIndex":19,"affiliation":815,"properties":18},{"id":787,"createTime":788,"updateTime":789,"relativeEntities":816,"slug":791,"properties":817,"entityType":93,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":818},{"VI":794},{"title":820},{"VI":821},"César Andrés",{"url":779,"publisher":823,"properties":842},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":824,"slug":10,"properties":825,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":828,"manageAffiliations":829,"indexDatabases":830,"url":18,"thumbnailPath":18,"statistic":837,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":826,"title":827},{"VOID":13},{"EN":15},[],[],[831],{"id":24,"indexDatabase":832,"url":37,"indexYears":38,"academicFieldIds":18,"indexDatabaseRanking":39},{"id":26,"createTime":27,"updateTime":28,"relativeEntities":833,"label":834,"description":835,"key":34,"publicationTags":836,"standard":18},[],{"EN":31,"VI":31},{"EN":31,"VI":33},[36],{"impactFactor":19,"impactFactorByYear":838,"i10Index":19,"i10IndexLast5Year":19,"totalPublication":42,"totalPublicationByYear":839,"totalCitation":19,"totalCitationByYear":840,"totalCitationPerPublication":19,"totalCitationPerPublicationByYear":841,"hindexLast5Year":19,"hindex":19},{},{"2001":44,"2002":45,"2003":46,"2004":45,"2005":47,"2006":48,"2007":48,"2008":49,"2009":47,"2010":50,"2011":51,"2012":52,"2013":53,"2014":54},{},{},{"volume":843,"pages":845},{"VOID":844},"78",{"VOID":846},"425-453","2009-07-01",2009]