[{"oa":"1","project":[{"name":"DatenraumKultur: Use Case 1 - Kulturplattformen - Datenraum Kultur","_id":"160"},{"_id":"1250","name":"SHAPE : Gestaltung von Dienstleistungsentwicklungsprozessen und lnnovationspartnerschaften mit Unternehmen"}],"quality_controlled":"1","citation":{"chicago":"Schäfer, Jannika Marie, Philipp Hansmeier, Philipp zur Heiden, and Daniel Beverungen. “Resource, Actor, Beneficiary, or Agent? A Service‑dominant Perspective on Generative Artificial Intelligence.” <i>Electronic Markets</i> 36, no. 78 (2026). <a href=\"https://doi.org/10.1007/s12525-026-00932-w\">https://doi.org/10.1007/s12525-026-00932-w</a>.","short":"J.M. Schäfer, P. Hansmeier, P. zur Heiden, D. Beverungen, Electronic Markets 36 (2026).","apa":"Schäfer, J. M., Hansmeier, P., zur Heiden, P., &#38; Beverungen, D. (2026). Resource, actor, beneficiary, or agent? A service‑dominant perspective on generative artificial intelligence. <i>Electronic Markets</i>, <i>36</i>(78). <a href=\"https://doi.org/10.1007/s12525-026-00932-w\">https://doi.org/10.1007/s12525-026-00932-w</a>","ieee":"J. M. Schäfer, P. Hansmeier, P. zur Heiden, and D. Beverungen, “Resource, actor, beneficiary, or agent? A service‑dominant perspective on generative artificial intelligence,” <i>Electronic Markets</i>, vol. 36, no. 78, 2026, doi: <a href=\"https://doi.org/10.1007/s12525-026-00932-w\">https://doi.org/10.1007/s12525-026-00932-w</a>.","ama":"Schäfer JM, Hansmeier P, zur Heiden P, Beverungen D. Resource, actor, beneficiary, or agent? A service‑dominant perspective on generative artificial intelligence. <i>Electronic Markets</i>. 2026;36(78). doi:<a href=\"https://doi.org/10.1007/s12525-026-00932-w\">https://doi.org/10.1007/s12525-026-00932-w</a>","bibtex":"@article{Schäfer_Hansmeier_zur Heiden_Beverungen_2026, title={Resource, actor, beneficiary, or agent? A service‑dominant perspective on generative artificial intelligence}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s12525-026-00932-w\">https://doi.org/10.1007/s12525-026-00932-w</a>}, number={78}, journal={Electronic Markets}, publisher={Springer Nature}, author={Schäfer, Jannika Marie and Hansmeier, Philipp and zur Heiden, Philipp and Beverungen, Daniel}, year={2026} }","mla":"Schäfer, Jannika Marie, et al. “Resource, Actor, Beneficiary, or Agent? A Service‑dominant Perspective on Generative Artificial Intelligence.” <i>Electronic Markets</i>, vol. 36, no. 78, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s12525-026-00932-w\">https://doi.org/10.1007/s12525-026-00932-w</a>."},"file_date_updated":"2026-10-08T10:49:46Z","volume":36,"user_id":"59677","ddc":["380"],"_id":"67182","publisher":"Springer Nature","has_accepted_license":"1","jel":["L86"],"status":"public","department":[{"_id":"195"}],"keyword":["Generative artificial intelligence","Service-dominant logic","Service science","Actor","Beneficiary","Agent"],"type":"journal_article","date_created":"2026-09-18T09:52:01Z","file":[{"date_created":"2026-10-08T10:49:46Z","creator":"dabe","content_type":"application/pdf","success":1,"file_id":"67433","access_level":"closed","file_size":1520928,"file_name":"Schäfer_EM_A Service-Dominant Perspective on Generative Artificial Intelligence.pdf","date_updated":"2026-10-08T10:49:46Z","relation":"main_file"}],"abstract":[{"text":"Generative artificial intelligence (GenAI) challenges core concepts in service science by blurring boundaries among resources, actors, and beneficiaries. Using service-dominant logic (SDL) as a theoretical lens, we review the distinctive properties of these concepts, introduce the agent concept into SDL, and analyze GenAI’s precise role in service exchange processes. We employ a two-phase research approach: First, we conduct a systematic literature review to derive defining properties of resources, actors, beneficiaries, and agents. We then assess eight contemporary GenAI systems against these properties. Our evidence indicates that GenAI is best understood as an operant resource and, depending on design and context, as an actor and agent. Conversely, GenAI does not qualify as a beneficiary, as it is neither individually capable of phenomenologically experiencing and determining value nor a social system of individuals with such capacities. Our findings propose an update to SDL’s core concepts and understanding, as well as a nuanced conceptual clarification of GenAI’s role, offering guidance for researchers and practitioners seeking to understand and design service interactions that incorporate GenAI.","lang":"eng"}],"issue":"78","publication":"Electronic Markets","doi":"https://doi.org/10.1007/s12525-026-00932-w","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/s12525-026-00932-w","open_access":"1"}],"article_type":"original","intvolume":"        36","publication_status":"published","date_updated":"2026-10-08T10:52:07Z","author":[{"id":"74374","last_name":"Schäfer","first_name":"Jannika Marie","full_name":"Schäfer, Jannika Marie"},{"full_name":"Hansmeier, Philipp","first_name":"Philipp","last_name":"Hansmeier","id":"55603"},{"full_name":"zur Heiden, Philipp","last_name":"zur Heiden","first_name":"Philipp","id":"64394"},{"full_name":"Beverungen, Daniel","first_name":"Daniel","last_name":"Beverungen","id":"59677"}],"title":"Resource, actor, beneficiary, or agent? A service‑dominant perspective on generative artificial intelligence","year":"2026"},{"publisher":"Springer Nature Switzerland","_id":"62701","user_id":"114533","conference":{"location":"Porto, Portugal","name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases - ECML PKDD","start_date":"2025-09-15","end_date":"2025-09-19"},"status":"public","place":"Cham","citation":{"chicago":"Demir, Caglar, Moshood Yekini, Michael Röder, Yasir Mahmood, and Axel-Cyrille Ngonga Ngomo. “Tree-Based OWL Class Expression Learner over Large Graphs.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>.","short":"C. Demir, M. Yekini, M. Röder, Y. Mahmood, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","ieee":"C. Demir, M. Yekini, M. Röder, Y. Mahmood, and A.-C. Ngonga Ngomo, “Tree-Based OWL Class Expression Learner over Large Graphs,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2025.","apa":"Demir, C., Yekini, M., Röder, M., Mahmood, Y., &#38; Ngonga Ngomo, A.-C. (2025). Tree-Based OWL Class Expression Learner over Large Graphs. In <i>Lecture Notes in Computer Science</i>. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases - ECML PKDD, Porto, Portugal. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>","bibtex":"@inbook{Demir_Yekini_Röder_Mahmood_Ngonga Ngomo_2025, place={Cham}, title={Tree-Based OWL Class Expression Learner over Large Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Demir, Caglar and Yekini, Moshood and Röder, Michael and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","ama":"Demir C, Yekini M, Röder M, Mahmood Y, Ngonga Ngomo A-C. Tree-Based OWL Class Expression Learner over Large Graphs. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>","mla":"Demir, Caglar, et al. “Tree-Based OWL Class Expression Learner over Large Graphs.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>."},"project":[{"_id":"285","name":"SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-032-06066-2_29","author":[{"last_name":"Demir","first_name":"Caglar","full_name":"Demir, Caglar"},{"full_name":"Yekini, Moshood","last_name":"Yekini","first_name":"Moshood"},{"first_name":"Michael","last_name":"Röder","full_name":"Röder, Michael"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783032060655","9783032060662"]},"year":"2025","title":"Tree-Based OWL Class Expression Learner over Large Graphs","publication_status":"published","date_updated":"2025-11-28T14:57:39Z","date_created":"2025-11-28T14:09:17Z","department":[{"_id":"34"},{"_id":"574"}],"keyword":["Decision Tree","OWL Class Expression Learning","Description Logic","Knowledge Graph","Large Language Model","Verbalizer"],"type":"book_chapter","publication":"Lecture Notes in Computer Science","abstract":[{"text":"Learning  continuous  vector  representations  for  knowledge graphs has significantly improved state-of-the-art performances in many challenging tasks. Yet, deep-learning-based models are only post-hoc and locally explainable. In contrast, learning Web Ontology Language (OWL) class  expressions  in  Description  Logics  (DLs)  is  ante-hoc  and  globally explainable. However, state-of-the-art learners have two well-known lim-itations:  scaling  to  large  knowledge  graphs  and  handling  missing  infor-mation.  Here,  we  present  a  decision-tree-based  learner  (tDL)  to  learn Web  Ontology  Languages  (OWLs)  class  expressions  over  large  knowl-edge graphs, while imputing missing triples. Given positive and negative example individuals, tDL  firstly constructs unique OWL expressions in .SHOIN from  concise  bounded  descriptions  of  individuals.  Each  OWL class expression is used as a feature in a binary classification problem to represent input individuals. Thereafter, tDL  fits a CART decision tree to learn Boolean decision rules distinguishing positive examples from nega-tive examples. A final OWL expression in.SHOIN is built by traversing the  built  CART  decision  tree  from  the  root  node  to  leaf  nodes  for  each positive example. By this, tDL  can learn OWL class expressions without exploration, i.e., the number of queries to a knowledge graph is bounded by the number of input individuals. Our empirical results show that tDL outperforms  the  current state-of-the-art  models  across datasets. Impor-tantly, our experiments over a large knowledge graph (DBpedia with 1.1 billion triples) show that tDL  can effectively learn accurate OWL class expressions,  while  the  state-of-the-art  models  fail  to  return  any  results. Finally,  expressions  learned  by  tDL  can  be  seamlessly  translated  into natural language explanations using a pre-trained large language model and a DL verbalizer.","lang":"eng"}]},{"issue":"3","publication":"Athens Journal of Philosophy","abstract":[{"lang":"eng","text":"From 1901 to 1919, Russell persistently maintained that there were two kinds of logic and distinguished between one and the other as mathematical logic and philosophical logic. In this paper, we discuss the concept of philosophical logic, as used by Russell. This was only a tentative program that Russell did not clarify in detail; therefore, our task will be to make it explicit. We shall show that there are three (-and-a-half) kinds of Russellian philosophical logic: (i) “pure logic”; (ii) philosophical logic investigating the logical forms of propositions; (iii) philosophical logic exploring the logical forms of facts: in epistemology and in the external world. In particular, Russell’s program or philosophical logic of the facts of the external world remained less than sketchily outlined.  "}],"date_created":"2024-07-14T16:27:50Z","type":"journal_article","keyword":["Russell","mathematical logic","philosophical logic","Wittgenstein"],"department":[{"_id":"520"},{"_id":"813"}],"year":"2023","title":"Bertrand Russell’s Philosophical Logic and its Logical Forms","author":[{"last_name":"Milkov","first_name":"Nikolay","full_name":"Milkov, Nikolay","id":"357"}],"publication_status":"published","date_updated":"2025-02-24T18:47:46Z","intvolume":"         2","language":[{"iso":"eng"}],"doi":"10.30958/ajphil.2-3-3","citation":{"bibtex":"@article{Milkov_2023, title={Bertrand Russell’s Philosophical Logic and its Logical Forms}, volume={2}, DOI={<a href=\"https://doi.org/10.30958/ajphil.2-3-3\">10.30958/ajphil.2-3-3</a>}, number={3}, journal={Athens Journal of Philosophy}, author={Milkov, Nikolay}, year={2023}, pages={193–209} }","ama":"Milkov N. Bertrand Russell’s Philosophical Logic and its Logical Forms. <i>Athens Journal of Philosophy</i>. 2023;2(3):193-209. doi:<a href=\"https://doi.org/10.30958/ajphil.2-3-3\">10.30958/ajphil.2-3-3</a>","mla":"Milkov, Nikolay. “Bertrand Russell’s Philosophical Logic and Its Logical Forms.” <i>Athens Journal of Philosophy</i>, vol. 2, no. 3, 2023, pp. 193–209, doi:<a href=\"https://doi.org/10.30958/ajphil.2-3-3\">10.30958/ajphil.2-3-3</a>.","short":"N. Milkov, Athens Journal of Philosophy 2 (2023) 193–209.","chicago":"Milkov, Nikolay. “Bertrand Russell’s Philosophical Logic and Its Logical Forms.” <i>Athens Journal of Philosophy</i> 2, no. 3 (2023): 193–209. <a href=\"https://doi.org/10.30958/ajphil.2-3-3\">https://doi.org/10.30958/ajphil.2-3-3</a>.","ieee":"N. Milkov, “Bertrand Russell’s Philosophical Logic and its Logical Forms,” <i>Athens Journal of Philosophy</i>, vol. 2, no. 3, pp. 193–209, 2023, doi: <a href=\"https://doi.org/10.30958/ajphil.2-3-3\">10.30958/ajphil.2-3-3</a>.","apa":"Milkov, N. (2023). Bertrand Russell’s Philosophical Logic and its Logical Forms. <i>Athens Journal of Philosophy</i>, <i>2</i>(3), 193–209. <a href=\"https://doi.org/10.30958/ajphil.2-3-3\">https://doi.org/10.30958/ajphil.2-3-3</a>"},"status":"public","page":"193-209","_id":"55236","user_id":"357","volume":2},{"date_created":"2023-07-03T11:36:55Z","type":"journal_article","keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"publication":"Journal of Logic and Computation","issue":"8","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>In this paper, we investigate the parameterized complexity of model checking for Dependence and Independence logic, which are well studied logics in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem, namely the number of disjunctions (i.e. splits)/(free) variables/universal quantifiers, formula-size, the tree-width of the Gaifman graph of the input structure, the size of the universe/team and the arity of dependence atoms. We present a comprehensive picture of the parameterized complexity of model checking and obtain a division of the problem into tractable and various intractable degrees. Furthermore, we also consider the complexity of the most important variants (data and expression complexity) of the model checking problem by fixing parts of the input.</jats:p>"}],"extern":"1","language":[{"iso":"eng"}],"doi":"10.1093/logcom/exac070","publication_identifier":{"issn":["0955-792X","1465-363X"]},"author":[{"first_name":"Juha","last_name":"Kontinen","full_name":"Kontinen, Juha"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"},{"id":"99353","first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"}],"year":"2022","title":"A parameterized view on the complexity of dependence and independence logic","intvolume":"        32","date_updated":"2024-06-04T16:06:37Z","publication_status":"published","citation":{"short":"J. Kontinen, A. Meier, Y. Mahmood, Journal of Logic and Computation 32 (2022) 1624–1644.","chicago":"Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i> 32, no. 8 (2022): 1624–44. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>.","apa":"Kontinen, J., Meier, A., &#38; Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>, <i>32</i>(8), 1624–1644. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>","ieee":"J. Kontinen, A. Meier, and Y. Mahmood, “A parameterized view on the complexity of dependence and independence logic,” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, pp. 1624–1644, 2022, doi: <a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>.","ama":"Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>. 2022;32(8):1624-1644. doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>","bibtex":"@article{Kontinen_Meier_Mahmood_2022, title={A parameterized view on the complexity of dependence and independence logic}, volume={32}, DOI={<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>}, number={8}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022}, pages={1624–1644} }","mla":"Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, Oxford University Press (OUP), 2022, pp. 1624–44, doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>."},"publisher":"Oxford University Press (OUP)","_id":"45847","page":"1624-1644","volume":32,"user_id":"99353","status":"public"},{"citation":{"mla":"Mahmood, Yasir, et al. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, Oxford University Press (OUP), 2021, pp. 266–96, doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>.","bibtex":"@article{Mahmood_Meier_Schmidt_2021, title={Parameterized complexity of abduction in Schaefer’s framework}, volume={31}, DOI={<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>}, number={1}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2021}, pages={266–296} }","ama":"Mahmood Y, Meier A, Schmidt J. Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>. 2021;31(1):266-296. doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized complexity of abduction in Schaefer’s framework,” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, pp. 266–296, 2021, doi: <a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>.","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2021). Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>, <i>31</i>(1), 266–296. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>","short":"Y. Mahmood, A. Meier, J. Schmidt, Journal of Logic and Computation 31 (2021) 266–296.","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i> 31, no. 1 (2021): 266–96. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>."},"status":"public","page":"266-296","publisher":"Oxford University Press (OUP)","_id":"45844","user_id":"99353","volume":31,"publication":"Journal of Logic and Computation","issue":"1","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version, asking for sets of variables as explanations, we study, besides the problem of wether there exists a set of explanations, two explanation size limited variants of this reasoning problem (less than or equal to, and equal to a given size bound). In this paper, we present a thorough two-dimensional classification of these problems: the first dimension is regarding the parameterized complexity under a wealth of different parameterizations, and the second dimension spans through all possible Boolean fragments of these problems in Schaefer’s constraint satisfaction framework with co-clones (T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1–3, 1978, San Diego, California, USA, R.J. Lipton, W.A. Burkhard, W.J. Savitch, E.P. Friedman, A.V. Aho eds, pp. 216–226. ACM, 1978). Thereby, we almost complete the parameterized complexity classification program initiated by Fellows et al. (The parameterized complexity of abduction. In Proceedings of the Twenty-Sixth AAAI Conference on Articial Intelligence, July 22–26, 2012, Toronto, Ontario, Canada, J. Homann, B. Selman eds. AAAI Press, 2012), partially building on the results by Nordh and Zanuttini (What makes propositional abduction tractable. Artificial Intelligence, 172, 1245–1284, 2008). In this process, we outline a fine-grained analysis of the inherent parameterized intractability of these problems and pinpoint their FPT parts. As the standard algebraic approach is not applicable to our problems, we develop an alternative method that makes the algebraic tools partially available again.</jats:p>","lang":"eng"}],"date_created":"2023-07-03T11:35:23Z","type":"journal_article","keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"department":[{"_id":"574"}],"title":"Parameterized complexity of abduction in Schaefer’s framework","year":"2021","publication_identifier":{"issn":["0955-792X","1465-363X"]},"author":[{"full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"last_name":"Meier","first_name":"Arne","full_name":"Meier, Arne"},{"full_name":"Schmidt, Johannes","last_name":"Schmidt","first_name":"Johannes"}],"publication_status":"published","date_updated":"2024-06-04T16:03:14Z","intvolume":"        31","language":[{"iso":"eng"}],"doi":"10.1093/logcom/exaa079"},{"place":"Bizerte, Tunisia","citation":{"mla":"Biehler, Rolf, and Viviane Durand-Guerrier. “University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic.” <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>, edited by T. Hausberger et al., University of Carthage and INDRUM, 2020, pp. 283–87.","bibtex":"@inbook{Biehler_Durand-Guerrier_2020, place={Bizerte, Tunisia}, title={University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic}, booktitle={Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)}, publisher={University of Carthage and INDRUM}, author={Biehler, Rolf and Durand-Guerrier, Viviane}, editor={Hausberger, T. and Bosch, M. and Chelloughi, F.}, year={2020}, pages={283–287} }","ama":"Biehler R, Durand-Guerrier V. University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic. In: Hausberger T, Bosch M, Chelloughi F, eds. <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>. University of Carthage and INDRUM; 2020:283-287.","ieee":"R. Biehler and V. Durand-Guerrier, “University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic,” in <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>, T. Hausberger, M. Bosch, and F. Chelloughi, Eds. Bizerte, Tunisia: University of Carthage and INDRUM, 2020, pp. 283–287.","apa":"Biehler, R., &#38; Durand-Guerrier, V. (2020). University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic. In T. Hausberger, M. Bosch, &#38; F. Chelloughi (Eds.), <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i> (pp. 283–287). University of Carthage and INDRUM.","short":"R. Biehler, V. Durand-Guerrier, in: T. Hausberger, M. Bosch, F. Chelloughi (Eds.), Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020), University of Carthage and INDRUM, Bizerte, Tunisia, 2020, pp. 283–287.","chicago":"Biehler, Rolf, and Viviane Durand-Guerrier. “University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic.” In <i>Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)</i>, edited by T. Hausberger, M. Bosch, and F. Chelloughi, 283–87. Bizerte, Tunisia: University of Carthage and INDRUM, 2020."},"file_date_updated":"2024-11-11T11:58:37Z","editor":[{"full_name":"Hausberger, T.","last_name":"Hausberger","first_name":"T."},{"full_name":"Bosch, M.","first_name":"M.","last_name":"Bosch"},{"first_name":"F.","last_name":"Chelloughi","full_name":"Chelloughi, F."}],"ddc":["510"],"user_id":"37888","_id":"35811","publisher":"University of Carthage and INDRUM","page":"283-287","has_accepted_license":"1","status":"public","department":[{"_id":"363"}],"keyword":["Number Theory","Algebra","Discrete Mathematics","Logic","Research in University Mathematics Edcuation"],"type":"book_chapter","date_created":"2023-01-10T11:14:02Z","file":[{"access_level":"closed","file_size":576039,"file_name":"Biehler_INDRUM2020_283-287.pdf","date_updated":"2024-11-11T11:58:37Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"56978","creator":"krueter","date_created":"2024-11-11T11:58:37Z"}],"related_material":{"link":[{"url":"https://hal.science/hal-03114041/","relation":"confirmation"}]},"publication":"Proceedings of the Third Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)","language":[{"iso":"eng"}],"main_file_link":[{"url":"⟨hal-03114041⟩"}],"date_updated":"2024-11-11T11:59:12Z","author":[{"id":"16274","full_name":"Biehler, Rolf","first_name":"Rolf","last_name":"Biehler"},{"full_name":"Durand-Guerrier, Viviane","first_name":"Viviane","last_name":"Durand-Guerrier"}],"title":"University Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics, Logic","year":"2020"},{"ddc":["000"],"user_id":"315","page":"246 - 257","publisher":"Elsevier","_id":"3343","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"citation":{"apa":"Bubeck, U., &#38; Kleine Büning, H. (2015). Learning Boolean Specifications. <i>Artificial Intelligence</i>, 246–257. <a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">https://doi.org/10.1016/j.artint.2015.09.003</a>","ieee":"U. Bubeck and H. Kleine Büning, “Learning Boolean Specifications,” <i>Artificial Intelligence</i>, pp. 246–257, 2015.","chicago":"Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” <i>Artificial Intelligence</i>, 2015, 246–57. <a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">https://doi.org/10.1016/j.artint.2015.09.003</a>.","short":"U. Bubeck, H. Kleine Büning, Artificial Intelligence (2015) 246–257.","mla":"Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” <i>Artificial Intelligence</i>, Elsevier, 2015, pp. 246–57, doi:<a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">10.1016/j.artint.2015.09.003</a>.","ama":"Bubeck U, Kleine Büning H. Learning Boolean Specifications. <i>Artificial Intelligence</i>. 2015:246-257. doi:<a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">10.1016/j.artint.2015.09.003</a>","bibtex":"@article{Bubeck_Kleine Büning_2015, title={Learning Boolean Specifications}, DOI={<a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">10.1016/j.artint.2015.09.003</a>}, journal={Artificial Intelligence}, publisher={Elsevier}, author={Bubeck, Uwe and Kleine Büning, Hans}, year={2015}, pages={246–257} }"},"doi":"10.1016/j.artint.2015.09.003","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:10Z","year":"2015","title":"Learning Boolean Specifications","publication_identifier":{"issn":["0004-3702"]},"author":[{"last_name":"Bubeck","first_name":"Uwe","full_name":"Bubeck, Uwe"},{"last_name":"Kleine Büning","first_name":"Hans","full_name":"Kleine Büning, Hans"}],"type":"journal_article","keyword":["Query learning","Propositional logic"],"department":[{"_id":"34"}],"date_created":"2018-06-25T10:43:19Z","abstract":[{"text":"In this paper we consider an extended variant of query learning where the hidden concept is embedded in some Boolean circuit. This additional processing layer modifies query arguments and answers by fixed transformation functions which are known to the learner. For this scenario, we provide a characterization of the solution space and an ordering on it. We give a compact representation of the minimal and maximal solutions as quantified Boolean formulas and we adapt the original algorithms for exact learning of specific classes of propositional formulas.","lang":"eng"}],"publication":"Artificial Intelligence"},{"date_updated":"2022-01-06T06:50:49Z","year":"2014","title":"Towards self-adaptive caches: A run-time reconfigurable multi-core infrastructure","status":"public","author":[{"last_name":"Ho","first_name":"Nam","full_name":"Ho, Nam"},{"last_name":"Kaufmann","first_name":"Paul","full_name":"Kaufmann, Paul"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"user_id":"3118","doi":"10.1109/ICES.2014.7008719","page":"31-37","_id":"10677","language":[{"iso":"eng"}],"publication":"2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)","citation":{"ama":"Ho N, Kaufmann P, Platzner M. Towards self-adaptive caches: A run-time reconfigurable multi-core infrastructure. In: <i>2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)</i>. ; 2014:31-37. doi:<a href=\"https://doi.org/10.1109/ICES.2014.7008719\">10.1109/ICES.2014.7008719</a>","short":"N. Ho, P. Kaufmann, M. Platzner, in: 2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES), 2014, pp. 31–37.","chicago":"Ho, Nam, Paul Kaufmann, and Marco Platzner. “Towards Self-Adaptive Caches: A Run-Time Reconfigurable Multi-Core Infrastructure.” In <i>2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)</i>, 31–37, 2014. <a href=\"https://doi.org/10.1109/ICES.2014.7008719\">https://doi.org/10.1109/ICES.2014.7008719</a>.","bibtex":"@inproceedings{Ho_Kaufmann_Platzner_2014, title={Towards self-adaptive caches: A run-time reconfigurable multi-core infrastructure}, DOI={<a href=\"https://doi.org/10.1109/ICES.2014.7008719\">10.1109/ICES.2014.7008719</a>}, booktitle={2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)}, author={Ho, Nam and Kaufmann, Paul and Platzner, Marco}, year={2014}, pages={31–37} }","mla":"Ho, Nam, et al. “Towards Self-Adaptive Caches: A Run-Time Reconfigurable Multi-Core Infrastructure.” <i>2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)</i>, 2014, pp. 31–37, doi:<a href=\"https://doi.org/10.1109/ICES.2014.7008719\">10.1109/ICES.2014.7008719</a>.","apa":"Ho, N., Kaufmann, P., &#38; Platzner, M. (2014). Towards self-adaptive caches: A run-time reconfigurable multi-core infrastructure. In <i>2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)</i> (pp. 31–37). <a href=\"https://doi.org/10.1109/ICES.2014.7008719\">https://doi.org/10.1109/ICES.2014.7008719</a>","ieee":"N. Ho, P. Kaufmann, and M. Platzner, “Towards self-adaptive caches: A run-time reconfigurable multi-core infrastructure,” in <i>2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)</i>, 2014, pp. 31–37."},"type":"conference","keyword":["Linux","cache storage","embedded systems","granular computing","multiprocessing systems","reconfigurable architectures","Leon3 SPARe processor","custom logic events","evolvable-self-adaptable processor cache","fine granular profiling","integer unit events","measurement infrastructure","microarchitectural events","multicore embedded system","perf_event standard Linux performance measurement interface","processor properties","run-time reconfigurable memory-to-cache address mapping engine","run-time reconfigurable multicore infrastructure","split-level caching","Field programmable gate arrays","Frequency locked loops","Irrigation","Phasor measurement units","Registers","Weaving"],"department":[{"_id":"78"}],"date_created":"2019-07-10T11:23:00Z"},{"date_created":"2020-08-06T15:22:05Z","department":[{"_id":"63"},{"_id":"541"}],"type":"journal_article","keyword":["Approximation algorithms","Approximation methods","Bandwidth","Logic gates","Radar","Vectors","Wireless sensor networks","Dependent flow scheduling","sensor networks"],"issue":"5","publication":"Networking, IEEE/ACM Transactions on","abstract":[{"text":"In this paper, we define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but we believe it has important applications on the admission of large flows in other networks as well. In order to optimize the selection of flows transmitted to the gateway, D-UFP takes into account possible dependencies between flows. We show that D-UFP is more difficult than NP-hard problems for which no good approximation is known. Then, we address two special cases of this problem: the case where all the sensors have a shared channel and the case where the sensors form a mesh and route to the gateway over a spanning tree.","lang":"eng"}],"extern":"1","language":[{"iso":"eng"}],"doi":"10.1109/TNET.2012.2227792","publication_identifier":{"issn":["1063-6692"]},"author":[{"first_name":"R.","last_name":"Cohen","full_name":"Cohen, R."},{"full_name":"Nudelman, I.","first_name":"I.","last_name":"Nudelman"},{"last_name":"Polevoy","first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983"}],"year":"2013","title":"On the Admission of Dependent Flows in Powerful Sensor Networks","intvolume":"        21","date_updated":"2022-01-06T06:53:16Z","citation":{"short":"R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21 (2013) 1461–1471.","chicago":"Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent Flows in Powerful Sensor Networks.” <i>Networking, IEEE/ACM Transactions On</i> 21, no. 5 (2013): 1461–71. <a href=\"https://doi.org/10.1109/TNET.2012.2227792\">https://doi.org/10.1109/TNET.2012.2227792</a>.","ieee":"R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows in Powerful Sensor Networks,” <i>Networking, IEEE/ACM Transactions on</i>, vol. 21, no. 5, pp. 1461–1471, 2013.","apa":"Cohen, R., Nudelman, I., &#38; Polevoy, G. (2013). On the Admission of Dependent Flows in Powerful Sensor Networks. <i>Networking, IEEE/ACM Transactions On</i>, <i>21</i>(5), 1461–1471. <a href=\"https://doi.org/10.1109/TNET.2012.2227792\">https://doi.org/10.1109/TNET.2012.2227792</a>","bibtex":"@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent Flows in Powerful Sensor Networks}, volume={21}, DOI={<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>}, number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R. and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }","ama":"Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful Sensor Networks. <i>Networking, IEEE/ACM Transactions on</i>. 2013;21(5):1461-1471. doi:<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>","mla":"Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.” <i>Networking, IEEE/ACM Transactions On</i>, vol. 21, no. 5, 2013, pp. 1461–71, doi:<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>."},"_id":"17663","page":"1461-1471","volume":21,"user_id":"83983","status":"public"},{"page":"1-6","language":[{"iso":"eng"}],"_id":"10620","doi":"10.1109/ReConFig.2013.6732280","user_id":"3118","year":"2013","title":"Dynamic reliability management: Reconfiguring reliability-levels of hardware designs at runtime","status":"public","author":[{"first_name":"Jahanzeb","last_name":"Anwer","full_name":"Anwer, Jahanzeb"},{"full_name":"Meisner, Sebastian","first_name":"Sebastian","last_name":"Meisner"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"date_updated":"2022-01-06T06:50:48Z","date_created":"2019-07-10T09:32:57Z","keyword":["fault tolerant computing","field programmable gate arrays","logic design","reliability","BYU-LANL tool","DRM tool flow","FPGA based hardware designs","avionic application","device technologies","dynamic reliability management","fault-tolerant operation","hardware designs","reconfiguring reliability levels","space applications","Field programmable gate arrays","Hardware","Redundancy","Reliability engineering","Runtime","Tunneling magnetoresistance"],"type":"conference","department":[{"_id":"78"}],"publication":"Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference on","citation":{"chicago":"Anwer, Jahanzeb, Sebastian Meisner, and Marco Platzner. “Dynamic Reliability Management: Reconfiguring Reliability-Levels of Hardware Designs at Runtime.” In <i>Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference On</i>, 1–6, 2013. <a href=\"https://doi.org/10.1109/ReConFig.2013.6732280\">https://doi.org/10.1109/ReConFig.2013.6732280</a>.","short":"J. Anwer, S. Meisner, M. Platzner, in: Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference On, 2013, pp. 1–6.","apa":"Anwer, J., Meisner, S., &#38; Platzner, M. (2013). Dynamic reliability management: Reconfiguring reliability-levels of hardware designs at runtime. In <i>Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference on</i> (pp. 1–6). <a href=\"https://doi.org/10.1109/ReConFig.2013.6732280\">https://doi.org/10.1109/ReConFig.2013.6732280</a>","ieee":"J. Anwer, S. Meisner, and M. Platzner, “Dynamic reliability management: Reconfiguring reliability-levels of hardware designs at runtime,” in <i>Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference on</i>, 2013, pp. 1–6.","ama":"Anwer J, Meisner S, Platzner M. Dynamic reliability management: Reconfiguring reliability-levels of hardware designs at runtime. In: <i>Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference On</i>. ; 2013:1-6. doi:<a href=\"https://doi.org/10.1109/ReConFig.2013.6732280\">10.1109/ReConFig.2013.6732280</a>","bibtex":"@inproceedings{Anwer_Meisner_Platzner_2013, title={Dynamic reliability management: Reconfiguring reliability-levels of hardware designs at runtime}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2013.6732280\">10.1109/ReConFig.2013.6732280</a>}, booktitle={Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference on}, author={Anwer, Jahanzeb and Meisner, Sebastian and Platzner, Marco}, year={2013}, pages={1–6} }","mla":"Anwer, Jahanzeb, et al. “Dynamic Reliability Management: Reconfiguring Reliability-Levels of Hardware Designs at Runtime.” <i>Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference On</i>, 2013, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/ReConFig.2013.6732280\">10.1109/ReConFig.2013.6732280</a>."}},{"publication":"Integration of Software Specification Techniques for Applications in Engineering","abstract":[{"lang":"eng","text":"This article describes our approach for the specification and verification of production automation systems with real-time properties. We focus on the graphical MFERT notation and RT-OCL (Real-Time Object Constraint Language) for the specification of state-oriented real-time properties. RT-OCL is an extension of the Object Constraint Language (OCL) that is part of the Unified Modeling Language (UML). We introduce the formal semantics of RT-OCL based on a formal model of UML Class and State Diagrams and provide a mapping to temporal logics. The applicability of our approach is demonstrated by the case study of a manufacturing system with automated guided vehicles."}],"date_created":"2022-10-20T09:25:53Z","department":[{"_id":"672"}],"type":"book_chapter","keyword":["Model Check","Temporal Logic","Object Constraint Language","Abstract Syntax","Temporal Logic Formula"],"publication_identifier":{"isbn":["978-3-540-27863-4"]},"author":[{"last_name":"Flake","first_name":"Stephan","full_name":"Flake, Stephan"},{"full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller","id":"16243"},{"full_name":"Pape, Ulrich","first_name":"Ulrich","last_name":"Pape"},{"full_name":"Ruf, Jürgen","last_name":"Ruf","first_name":"Jürgen"}],"year":"2004","title":"Specification and Formal Verification of Temporal Properties of Production Automation Systems","intvolume":"      3147","date_updated":"2022-10-20T09:26:15Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-540-27863-4_13","citation":{"bibtex":"@inbook{Flake_Müller_Pape_Ruf_2004, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Specification and Formal Verification of Temporal Properties of Production Automation Systems}, volume={3147}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-27863-4_13\">10.1007/978-3-540-27863-4_13</a>}, booktitle={Integration of Software Specification Techniques for Applications in Engineering}, publisher={Springer-Verlag}, author={Flake, Stephan and Müller, Wolfgang and Pape, Ulrich and Ruf, Jürgen}, editor={Ehrig, Hartmut and Damm, Werner and Desel, Jörg and Große-Rhode, Martin and Reif, Wolfgang and Schnieder, Eckehard and Westkämper, Engelbert}, year={2004}, pages={206–226}, collection={Lecture Notes in Computer Science} }","ama":"Flake S, Müller W, Pape U, Ruf J. Specification and Formal Verification of Temporal Properties of Production Automation Systems. In: Ehrig H, Damm W, Desel J, et al., eds. <i>Integration of Software Specification Techniques for Applications in Engineering</i>. Vol 3147. Lecture Notes in Computer Science. Springer-Verlag; 2004:206-226. doi:<a href=\"https://doi.org/10.1007/978-3-540-27863-4_13\">10.1007/978-3-540-27863-4_13</a>","mla":"Flake, Stephan, et al. “Specification and Formal Verification of Temporal Properties of Production Automation Systems.” <i>Integration of Software Specification Techniques for Applications in Engineering</i>, edited by Hartmut Ehrig et al., vol. 3147, Springer-Verlag, 2004, pp. 206–26, doi:<a href=\"https://doi.org/10.1007/978-3-540-27863-4_13\">10.1007/978-3-540-27863-4_13</a>.","short":"S. Flake, W. Müller, U. Pape, J. Ruf, in: H. Ehrig, W. Damm, J. Desel, M. Große-Rhode, W. Reif, E. Schnieder, E. Westkämper (Eds.), Integration of Software Specification Techniques for Applications in Engineering, Springer-Verlag, Berlin, Heidelberg, 2004, pp. 206–226.","chicago":"Flake, Stephan, Wolfgang Müller, Ulrich Pape, and Jürgen Ruf. “Specification and Formal Verification of Temporal Properties of Production Automation Systems.” In <i>Integration of Software Specification Techniques for Applications in Engineering</i>, edited by Hartmut Ehrig, Werner Damm, Jörg Desel, Martin Große-Rhode, Wolfgang Reif, Eckehard Schnieder, and Engelbert Westkämper, 3147:206–26. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2004. <a href=\"https://doi.org/10.1007/978-3-540-27863-4_13\">https://doi.org/10.1007/978-3-540-27863-4_13</a>.","ieee":"S. Flake, W. Müller, U. Pape, and J. Ruf, “Specification and Formal Verification of Temporal Properties of Production Automation Systems,” in <i>Integration of Software Specification Techniques for Applications in Engineering</i>, vol. 3147, H. Ehrig, W. Damm, J. Desel, M. Große-Rhode, W. Reif, E. Schnieder, and E. Westkämper, Eds. Berlin, Heidelberg: Springer-Verlag, 2004, pp. 206–226.","apa":"Flake, S., Müller, W., Pape, U., &#38; Ruf, J. (2004). Specification and Formal Verification of Temporal Properties of Production Automation Systems. In H. Ehrig, W. Damm, J. Desel, M. Große-Rhode, W. Reif, E. Schnieder, &#38; E. Westkämper (Eds.), <i>Integration of Software Specification Techniques for Applications in Engineering</i> (Vol. 3147, pp. 206–226). Springer-Verlag. <a href=\"https://doi.org/10.1007/978-3-540-27863-4_13\">https://doi.org/10.1007/978-3-540-27863-4_13</a>"},"place":"Berlin, Heidelberg","status":"public","_id":"33825","publisher":"Springer-Verlag","page":"206-226","volume":3147,"editor":[{"full_name":"Ehrig, Hartmut","last_name":"Ehrig","first_name":"Hartmut"},{"first_name":"Werner","last_name":"Damm","full_name":"Damm, Werner"},{"first_name":"Jörg","last_name":"Desel","full_name":"Desel, Jörg"},{"last_name":"Große-Rhode","first_name":"Martin","full_name":"Große-Rhode, Martin"},{"full_name":"Reif, Wolfgang","last_name":"Reif","first_name":"Wolfgang"},{"last_name":"Schnieder","first_name":"Eckehard","full_name":"Schnieder, Eckehard"},{"full_name":"Westkämper, Engelbert","last_name":"Westkämper","first_name":"Engelbert"}],"user_id":"5786"},{"_id":"39061","language":[{"iso":"eng"}],"doi":"10.1109/DATE.2004.1269214","user_id":"5786","year":"2004","title":"Formal Refinement and Model Checking of An Echo Cancellation Unit","status":"public","conference":{"name":"Proceedings Design, Automation and Test in Europe Conference and Exhibition"},"publication_identifier":{"isbn":["0-7695-2085-5"]},"author":[{"full_name":"Krupp, Alexander","first_name":"Alexander","last_name":"Krupp"},{"id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller"},{"full_name":"Oliver, Ian","first_name":"Ian","last_name":"Oliver"}],"date_updated":"2023-01-24T08:53:31Z","place":"Paris","date_created":"2023-01-24T08:53:26Z","keyword":["Echo cancellers","Logic","Unified modeling language","Automata","Data structures","Boolean functions","Electronic design automation and methodology","Prototypes","Specification languages","Constraint theory"],"type":"conference","department":[{"_id":"672"}],"publication":"Proceedings of DATE’04 Designers' Forum","citation":{"short":"A. Krupp, W. Müller, I. Oliver, in: Proceedings of DATE’04 Designers’ Forum, Paris, 2004.","chicago":"Krupp, Alexander, Wolfgang Müller, and Ian Oliver. “Formal Refinement and Model Checking of An Echo Cancellation Unit.” In <i>Proceedings of DATE’04 Designers’ Forum</i>. Paris, 2004. <a href=\"https://doi.org/10.1109/DATE.2004.1269214\">https://doi.org/10.1109/DATE.2004.1269214</a>.","ieee":"A. Krupp, W. Müller, and I. Oliver, “Formal Refinement and Model Checking of An Echo Cancellation Unit,” presented at the Proceedings Design, Automation and Test in Europe Conference and Exhibition, 2004, doi: <a href=\"https://doi.org/10.1109/DATE.2004.1269214\">10.1109/DATE.2004.1269214</a>.","apa":"Krupp, A., Müller, W., &#38; Oliver, I. (2004). Formal Refinement and Model Checking of An Echo Cancellation Unit. <i>Proceedings of DATE’04 Designers’ Forum</i>. Proceedings Design, Automation and Test in Europe Conference and Exhibition. <a href=\"https://doi.org/10.1109/DATE.2004.1269214\">https://doi.org/10.1109/DATE.2004.1269214</a>","bibtex":"@inproceedings{Krupp_Müller_Oliver_2004, place={Paris}, title={Formal Refinement and Model Checking of An Echo Cancellation Unit}, DOI={<a href=\"https://doi.org/10.1109/DATE.2004.1269214\">10.1109/DATE.2004.1269214</a>}, booktitle={Proceedings of DATE’04 Designers’ Forum}, author={Krupp, Alexander and Müller, Wolfgang and Oliver, Ian}, year={2004} }","ama":"Krupp A, Müller W, Oliver I. Formal Refinement and Model Checking of An Echo Cancellation Unit. In: <i>Proceedings of DATE’04 Designers’ Forum</i>. ; 2004. doi:<a href=\"https://doi.org/10.1109/DATE.2004.1269214\">10.1109/DATE.2004.1269214</a>","mla":"Krupp, Alexander, et al. “Formal Refinement and Model Checking of An Echo Cancellation Unit.” <i>Proceedings of DATE’04 Designers’ Forum</i>, 2004, doi:<a href=\"https://doi.org/10.1109/DATE.2004.1269214\">10.1109/DATE.2004.1269214</a>."},"abstract":[{"lang":"eng","text":"This article presents an approach, which combines theorem proving-based refinement with model checking for state based real-time systems. Our verification flow starts from UML state diagrams, which are translated to the formal B language and are model checked for real-time properties. By means of the B language and a B theorem prover, refined state diagrams are verified against their abstract representation. The approach is presented by means of the refinement of a digital echo cancellation unit."}]},{"place":"Beijing, China","date_created":"2023-01-24T09:03:36Z","department":[{"_id":"672"}],"keyword":["Unified modeling language","Logic","Clocks","Boolean functions","Application software","Time factors","Real time systems","Formal verification","Buffer storage","Software packages"],"type":"conference","citation":{"ama":"Flake S, Müller W. Past- and Future-Oriented Time-Bound Temporal Properties with OCL. In: <i>Proceedings of SEFM´04</i>. IEEE; 2004. doi:<a href=\"https://doi.org/10.1109/SEFM.2004.1347516\">10.1109/SEFM.2004.1347516</a>","bibtex":"@inproceedings{Flake_Müller_2004, place={Beijing, China}, title={Past- and Future-Oriented Time-Bound Temporal Properties with OCL}, DOI={<a href=\"https://doi.org/10.1109/SEFM.2004.1347516\">10.1109/SEFM.2004.1347516</a>}, booktitle={Proceedings of SEFM´04}, publisher={IEEE}, author={Flake, Stephan and Müller, Wolfgang}, year={2004} }","mla":"Flake, Stephan, and Wolfgang Müller. “Past- and Future-Oriented Time-Bound Temporal Properties with OCL.” <i>Proceedings of SEFM´04</i>, IEEE, 2004, doi:<a href=\"https://doi.org/10.1109/SEFM.2004.1347516\">10.1109/SEFM.2004.1347516</a>.","short":"S. Flake, W. Müller, in: Proceedings of SEFM´04, IEEE, Beijing, China, 2004.","chicago":"Flake, Stephan, and Wolfgang Müller. “Past- and Future-Oriented Time-Bound Temporal Properties with OCL.” In <i>Proceedings of SEFM´04</i>. Beijing, China: IEEE, 2004. <a href=\"https://doi.org/10.1109/SEFM.2004.1347516\">https://doi.org/10.1109/SEFM.2004.1347516</a>.","apa":"Flake, S., &#38; Müller, W. (2004). Past- and Future-Oriented Time-Bound Temporal Properties with OCL. <i>Proceedings of SEFM´04</i>.  Proceedings of the Second International Conference on Software Engineering and Formal Methods. <a href=\"https://doi.org/10.1109/SEFM.2004.1347516\">https://doi.org/10.1109/SEFM.2004.1347516</a>","ieee":"S. Flake and W. Müller, “Past- and Future-Oriented Time-Bound Temporal Properties with OCL,” presented at the  Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004, doi: <a href=\"https://doi.org/10.1109/SEFM.2004.1347516\">10.1109/SEFM.2004.1347516</a>."},"publication":"Proceedings of SEFM´04","abstract":[{"lang":"eng","text":"We present the syntax and semantics of a past- and future-oriented temporal extension of the Object Constraint Language (OCL). Our extension supports designers to express time-bounded properties over a state-oriented UML model of a system under development. The semantics is formally defined over the system states of a mathematical object model. Additionally, we present a mapping to Clocked Linear Temporal Logic (Clocked LTL) formulae, which is the basis for further application in verification with model checking. We demonstrate the applicability of the approach by the example of a buffer specification in the context of a production system."}],"publisher":"IEEE","_id":"39069","language":[{"iso":"eng"}],"doi":"10.1109/SEFM.2004.1347516","user_id":"5786","conference":{"name":" Proceedings of the Second International Conference on Software Engineering and Formal Methods"},"author":[{"first_name":"Stephan","last_name":"Flake","full_name":"Flake, Stephan"},{"id":"16243","first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang"}],"publication_identifier":{"isbn":["0-7695-2222-X"]},"year":"2004","title":"Past- and Future-Oriented Time-Bound Temporal Properties with OCL","status":"public","date_updated":"2023-01-24T09:03:41Z"},{"date_created":"2022-12-15T11:38:20Z","type":"book_chapter","keyword":["Model Check     Temporal Logic     Object Constraint Language     Execution Path     Kripke Structure"],"department":[{"_id":"672"}],"publication":"Advances in Object Modelling with the OCL","abstract":[{"text":"The Object Constraint Language (OCL) was introduced to support the specification of constraints for UML diagrams and is mainly used to formulate invariants and operation pre- and postconditions. Though OCL is also applied in behavioral diagrams, e.g., as guards for state transitions, it is currently not possible to specify constraints concerning the dynamic behavior and timing properties of such diagrams.\r\n\r\nThis article discusses OCL’s application for the dynamic behavior of UML Statechart diagrams and presents an OCL extension for specification of state-oriented time-bounded constraints.We introduce operations to extract state configurations from diagrams and define additional predicates over states and state configurations. The semantics of our OCL extension is given by employing time-bounded Computational Tree Logic (CTL) formulae. An example of a flexible manufacturing system with automated guided vehicles demonstrates the application of our extension.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1007/3-540-45669-4_8","year":"2002","title":"An OCL Extension for Real-Time Constraints","author":[{"full_name":"Flake, Stephan","first_name":"Stephan","last_name":"Flake"},{"id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller"}],"publication_identifier":{"isbn":["978-3-540-45669-8"]},"date_updated":"2022-12-15T11:38:47Z","place":"Berlin, Heidelberg","citation":{"mla":"Flake, Stephan, and Wolfgang Müller. “An OCL Extension for Real-Time Constraints.” <i>Advances in Object Modelling with the OCL</i>, edited by T. Clark and J. Warmer, Springer-Verlag, 2002, pp. 150–71, doi:<a href=\"https://doi.org/10.1007/3-540-45669-4_8\">10.1007/3-540-45669-4_8</a>.","bibtex":"@inbook{Flake_Müller_2002, place={Berlin, Heidelberg}, title={An OCL Extension for Real-Time Constraints}, DOI={<a href=\"https://doi.org/10.1007/3-540-45669-4_8\">10.1007/3-540-45669-4_8</a>}, booktitle={Advances in Object Modelling with the OCL}, publisher={Springer-Verlag}, author={Flake, Stephan and Müller, Wolfgang}, editor={Clark, T. and Warmer, J.}, year={2002}, pages={150–171} }","ama":"Flake S, Müller W. An OCL Extension for Real-Time Constraints. In: Clark T, Warmer J, eds. <i>Advances in Object Modelling with the OCL</i>. Springer-Verlag; 2002:150-171. doi:<a href=\"https://doi.org/10.1007/3-540-45669-4_8\">10.1007/3-540-45669-4_8</a>","ieee":"S. Flake and W. Müller, “An OCL Extension for Real-Time Constraints,” in <i>Advances in Object Modelling with the OCL</i>, T. Clark and J. Warmer, Eds. Berlin, Heidelberg: Springer-Verlag, 2002, pp. 150–171.","apa":"Flake, S., &#38; Müller, W. (2002). An OCL Extension for Real-Time Constraints. In T. Clark &#38; J. Warmer (Eds.), <i>Advances in Object Modelling with the OCL</i> (pp. 150–171). Springer-Verlag. <a href=\"https://doi.org/10.1007/3-540-45669-4_8\">https://doi.org/10.1007/3-540-45669-4_8</a>","short":"S. Flake, W. Müller, in: T. Clark, J. Warmer (Eds.), Advances in Object Modelling with the OCL, Springer-Verlag, Berlin, Heidelberg, 2002, pp. 150–171.","chicago":"Flake, Stephan, and Wolfgang Müller. “An OCL Extension for Real-Time Constraints.” In <i>Advances in Object Modelling with the OCL</i>, edited by T. Clark and J. Warmer, 150–71. Berlin, Heidelberg: Springer-Verlag, 2002. <a href=\"https://doi.org/10.1007/3-540-45669-4_8\">https://doi.org/10.1007/3-540-45669-4_8</a>."},"page":"150 - 171","_id":"34447","publisher":"Springer-Verlag","user_id":"5786","editor":[{"full_name":"Clark, T.","first_name":"T.","last_name":"Clark"},{"full_name":"Warmer, J.","first_name":"J.","last_name":"Warmer"}],"status":"public"},{"date_updated":"2023-01-24T10:10:28Z","publication_identifier":{"isbn":["1-58113-576-9"]},"author":[{"id":"16243","first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang"},{"full_name":"Dömer, Rainer","last_name":"Dömer","first_name":"Rainer"},{"full_name":"Gerstlauer, Andreas","first_name":"Andreas","last_name":"Gerstlauer"}],"status":"public","title":"The Formal Execution Semantics of SpecC","year":"2002","doi":"10.1145/581199.581234 ","user_id":"5786","_id":"39382","language":[{"iso":"eng"}],"abstract":[{"text":"We present a rigorous but transparent semantics definition of the SpecC language that covers the execution of SpecC behaviors and their interaction with the kernel process. The semantics include wait, wait for, par, and try statements as they are introduced in SpecC. We present our definition in form of distributed abstract state machine (ASM) rules strictly following the lines of the SpecC Language Reference Manual. We mainly see our formal semantics in three application areas. First, it is a concise, unambiguous description for documentation and standardization. Second, it applies as a high-level, pseudo code-oriented specification for the implementation of a SpecC simulator. Finally, it is a first step for SpecC synthesis in order to identify similar concepts with other languages like VHDL and SystemC for the definition of common patterns and language subsets.","lang":"eng"}],"citation":{"apa":"Müller, W., Dömer, R., &#38; Gerstlauer, A. (2002). The Formal Execution Semantics of SpecC. <i>Proceedings of the ISSS02</i>. <a href=\"https://doi.org/10.1145/581199.581234 \">https://doi.org/10.1145/581199.581234 </a>","ieee":"W. Müller, R. Dömer, and A. Gerstlauer, “The Formal Execution Semantics of SpecC,” 2002, doi: <a href=\"https://doi.org/10.1145/581199.581234 \">10.1145/581199.581234 </a>.","chicago":"Müller, Wolfgang, Rainer Dömer, and Andreas Gerstlauer. “The Formal Execution Semantics of SpecC.” In <i>Proceedings of the ISSS02</i>. Nagoya, Japan, 2002. <a href=\"https://doi.org/10.1145/581199.581234 \">https://doi.org/10.1145/581199.581234 </a>.","short":"W. Müller, R. Dömer, A. Gerstlauer, in: Proceedings of the ISSS02, Nagoya, Japan, 2002.","mla":"Müller, Wolfgang, et al. “The Formal Execution Semantics of SpecC.” <i>Proceedings of the ISSS02</i>, 2002, doi:<a href=\"https://doi.org/10.1145/581199.581234 \">10.1145/581199.581234 </a>.","ama":"Müller W, Dömer R, Gerstlauer A. The Formal Execution Semantics of SpecC. In: <i>Proceedings of the ISSS02</i>. ; 2002. doi:<a href=\"https://doi.org/10.1145/581199.581234 \">10.1145/581199.581234 </a>","bibtex":"@inproceedings{Müller_Dömer_Gerstlauer_2002, place={Nagoya, Japan}, title={The Formal Execution Semantics of SpecC}, DOI={<a href=\"https://doi.org/10.1145/581199.581234 \">10.1145/581199.581234 </a>}, booktitle={Proceedings of the ISSS02}, author={Müller, Wolfgang and Dömer, Rainer and Gerstlauer, Andreas}, year={2002} }"},"publication":"Proceedings of the ISSS02","department":[{"_id":"672"}],"type":"conference","keyword":["Standardization","Kernel","Permission","Formal verification","Logic functions","Documentation","Reasoning about programs","Specification languages","Formal specifications","Software systems"],"place":"Nagoya, Japan","date_created":"2023-01-24T10:10:24Z"},{"_id":"39403","language":[{"iso":"eng"}],"user_id":"5786","doi":"10.1109/HICSS.2002.994469","author":[{"full_name":"Flake, Stephan","first_name":"Stephan","last_name":"Flake"},{"id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller"}],"publication_identifier":{"isbn":["0-7695-1435-9"]},"conference":{"name":"Proceedings of the 35th Annual Hawaii International Conference on System Sciences","location":"Big Island, HI, USA "},"year":"2002","status":"public","title":"Specification of Real-Time Properties for UML Models","date_updated":"2023-01-24T10:22:16Z","date_created":"2023-01-24T10:22:12Z","place":"Big Island, HI, USA ","department":[{"_id":"672"}],"keyword":["Unified modeling language","Logic","Formal verification","Real time systems","Programming profession","Vehicle dynamics","Software standards","Flexible manufacturing systems","Electronics industry","Protocols"],"type":"conference","citation":{"ama":"Flake S, Müller W. Specification of Real-Time Properties for UML Models. In: <i>Proceedings of HICSS-35</i>. ; 2002. doi:<a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>","bibtex":"@inproceedings{Flake_Müller_2002, place={Big Island, HI, USA }, title={Specification of Real-Time Properties for UML Models}, DOI={<a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>}, booktitle={Proceedings of HICSS-35}, author={Flake, Stephan and Müller, Wolfgang}, year={2002} }","mla":"Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties for UML Models.” <i>Proceedings of HICSS-35</i>, 2002, doi:<a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>.","short":"S. Flake, W. Müller, in: Proceedings of HICSS-35, Big Island, HI, USA , 2002.","chicago":"Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties for UML Models.” In <i>Proceedings of HICSS-35</i>. Big Island, HI, USA , 2002. <a href=\"https://doi.org/10.1109/HICSS.2002.994469\">https://doi.org/10.1109/HICSS.2002.994469</a>.","apa":"Flake, S., &#38; Müller, W. (2002). Specification of Real-Time Properties for UML Models. <i>Proceedings of HICSS-35</i>. Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Big Island, HI, USA . <a href=\"https://doi.org/10.1109/HICSS.2002.994469\">https://doi.org/10.1109/HICSS.2002.994469</a>","ieee":"S. Flake and W. Müller, “Specification of Real-Time Properties for UML Models,” presented at the Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Big Island, HI, USA , 2002, doi: <a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>."},"publication":"Proceedings of HICSS-35","abstract":[{"lang":"eng","text":"The Unified Modeling Language (UML) has received wide acceptance as a standard language in the field of software specification by means of different diagram types. In a recent version of UML, the textual Object Constraint Language (OCL) was introduced to support specification of constraints for UML models. But OCL currently does not provide sufficient means to specify constraints over the dynamic behavior of a model. This article presents an OCL extension that is consistent with current OCL and enables modelers to specify state-related time-bounded constraints. We consider the case study of a flexible manufacturing system and identify typical real-time constraints. The constraints are presented in our temporal OCL extension as well as in temporal logic formulae. For general application, we define a semantics of our OCL extension by means of a time-bounded temporal logic based on Computational Tree Logic (CTL)."}]},{"date_created":"2023-01-24T10:39:33Z","place":"Munich, Germany ","department":[{"_id":"672"}],"keyword":["Yarn","Formal verification","Kernel","Hardware design languages","Electronic design automation and methodology","Algebra","Computational modeling","Logic functions","Computer languages","Clocks"],"type":"conference","citation":{"apa":"Müller, W., Ruf, J., Hoffmann, D. W., Gerlach, J., Kropf, T., &#38; Rosenstiehl, W. (2001). The Simulation Semantics of SystemC. <i>Proceedings of the Design, Automation, and Test in Europe (DATE’01)</i>.  Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001. <a href=\"https://doi.org/10.1109/DATE.2001.915002\">https://doi.org/10.1109/DATE.2001.915002</a>","ieee":"W. Müller, J. Ruf, D. W. Hoffmann, J. Gerlach, T. Kropf, and W. Rosenstiehl, “The Simulation Semantics of SystemC,” presented at the  Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001, 2001, doi: <a href=\"https://doi.org/10.1109/DATE.2001.915002\">10.1109/DATE.2001.915002</a>.","short":"W. Müller, J. Ruf, D.W. Hoffmann, J. Gerlach, T. Kropf, W. Rosenstiehl, in: Proceedings of the Design, Automation, and Test in Europe (DATE’01), IEEE, Munich, Germany , 2001.","chicago":"Müller, Wolfgang, Jürgen Ruf, D. W. Hoffmann, Joachim Gerlach, Thomas Kropf, and W. Rosenstiehl. “The Simulation Semantics of SystemC.” In <i>Proceedings of the Design, Automation, and Test in Europe (DATE’01)</i>. Munich, Germany : IEEE, 2001. <a href=\"https://doi.org/10.1109/DATE.2001.915002\">https://doi.org/10.1109/DATE.2001.915002</a>.","mla":"Müller, Wolfgang, et al. “The Simulation Semantics of SystemC.” <i>Proceedings of the Design, Automation, and Test in Europe (DATE’01)</i>, IEEE, 2001, doi:<a href=\"https://doi.org/10.1109/DATE.2001.915002\">10.1109/DATE.2001.915002</a>.","ama":"Müller W, Ruf J, Hoffmann DW, Gerlach J, Kropf T, Rosenstiehl W. The Simulation Semantics of SystemC. In: <i>Proceedings of the Design, Automation, and Test in Europe (DATE’01)</i>. IEEE; 2001. doi:<a href=\"https://doi.org/10.1109/DATE.2001.915002\">10.1109/DATE.2001.915002</a>","bibtex":"@inproceedings{Müller_Ruf_Hoffmann_Gerlach_Kropf_Rosenstiehl_2001, place={Munich, Germany }, title={The Simulation Semantics of SystemC}, DOI={<a href=\"https://doi.org/10.1109/DATE.2001.915002\">10.1109/DATE.2001.915002</a>}, booktitle={Proceedings of the Design, Automation, and Test in Europe (DATE’01)}, publisher={IEEE}, author={Müller, Wolfgang and Ruf, Jürgen and Hoffmann, D. W. and Gerlach, Joachim and Kropf, Thomas and Rosenstiehl, W.}, year={2001} }"},"publication":"Proceedings of the Design, Automation, and Test in Europe (DATE’01)","abstract":[{"text":"We present a rigorous but transparent semantics definition of SystemC that covers method, thread, and clocked thread behavior as well as their interaction with the simulation kernel process. The semantics includes watching statements, signal assignment, and wait statements as they are introduced in SystemC V1.O. We present our definition in form of distributed Abstract State Machines (ASMs) rules reflecting the view given in the SystemC User's Manual and the reference implementation. We mainly see our formal semantics as a concise, unambiguous, high-level specification for SystemC-based implementations and for standardization. Additionally, it can be used as a sound basis to investigate SystemC interoperability with Verilog and VHDL.","lang":"eng"}],"_id":"39421","language":[{"iso":"eng"}],"publisher":"IEEE","user_id":"5786","doi":"10.1109/DATE.2001.915002","publication_identifier":{"isbn":["0-7695-0993-2"]},"author":[{"id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller"},{"full_name":"Ruf, Jürgen","first_name":"Jürgen","last_name":"Ruf"},{"last_name":"Hoffmann","first_name":"D. W.","full_name":"Hoffmann, D. W."},{"first_name":"Joachim","last_name":"Gerlach","full_name":"Gerlach, Joachim"},{"full_name":"Kropf, Thomas","first_name":"Thomas","last_name":"Kropf"},{"full_name":"Rosenstiehl, W.","first_name":"W.","last_name":"Rosenstiehl"}],"conference":{"name":" Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001"},"title":"The Simulation Semantics of SystemC","status":"public","year":"2001","date_updated":"2023-01-24T10:39:38Z"}]