hh.sePublikationer
Ändra sökning
Länk till posten
Permanent länk

Direktlänk
BETA
Publikationer (10 of 92) Visa alla publikationer
Duracz, A., Moggi, E., Taha, W. & Lin, Z. (2018). A Semantic Account of Rigorous Simulation. In: Marten LohstrohPatricia DerlerMarjan Sirjani (Ed.), Principles of Modeling: Essays Dedicated to Edward A. Lee on the Occasion of His 60th Birthday (pp. 223-239). Amsterdam: Springer Berlin/Heidelberg, 10760
Öppna denna publikation i ny flik eller fönster >>A Semantic Account of Rigorous Simulation
2018 (Engelska)Ingår i: Principles of Modeling: Essays Dedicated to Edward A. Lee on the Occasion of His 60th Birthday / [ed] Marten LohstrohPatricia DerlerMarjan Sirjani, Amsterdam: Springer Berlin/Heidelberg, 2018, Vol. 10760, s. 223-239Kapitel i bok, del av antologi (Refereegranskat)
Abstract [en]

Hybrid systems are a powerful formalism for modeling cyber-physical systems. Reachability analysis is a general method for checking safety properties, especially in the presence of uncertainty and non-determinism. Rigorous simulation is a convenient tool for reachability analysis of hybrid systems. However, to serve as proof tool, a rigorous simulator must be correct w.r.t. a clearly defined notion of reachability, which captures what is intuitively reachable in finite time. As a step towards addressing this challenge, this paper presents a rigorous simulator in the form of an operational semantics and a specification in the form of a denotational semantics. We show that, under certain conditions about the representation of enclosures, the rigorous simulator is correct. We also show that finding a representation satisfying these assumptions is non-trivial. © 2018, Springer International Publishing AG, part of Springer Nature.

Ort, förlag, år, upplaga, sidor
Amsterdam: Springer Berlin/Heidelberg, 2018
Serie
Lecture Notes In Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10760
Nyckelord
Correctness, Programming languages, Reachability analysis, Computer programming languages, Embedded systems, Hybrid systems, Semantics, Simulators, Denotational semantics, General method, Non Determinism, Operational semantics, Rigorous simulation, Safety property, Uncertainty analysis
Nationell ämneskategori
Datorsystem Inbäddad systemteknik
Identifikatorer
urn:nbn:se:hh:diva-38736 (URN)10.1007/978-3-319-95246-8_13 (DOI)2-s2.0-85052713247 (Scopus ID)978-3-319-95245-1 (ISBN)978-3-319-95246-8 (ISBN)
Tillgänglig från: 2019-01-09 Skapad: 2019-01-09 Senast uppdaterad: 2019-01-09Bibliografiskt granskad
Moggi, E., Farjudian, A., Duracz, A. & Taha, W. (2018). Safe & robust reachability analysis of hybrid systems. Theoretical Computer Science, 747, 75-99
Öppna denna publikation i ny flik eller fönster >>Safe & robust reachability analysis of hybrid systems
2018 (Engelska)Ingår i: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 747, s. 75-99Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Hybrid systems—more precisely, their mathematical models—can exhibit behaviors, like Zeno behaviors, that are absent in purely discrete or purely continuous systems. First, we observe that, in this context, the usual definition of reachability—namely, the reflexive and transitive closure of a transition relation—can be unsafe, i.e., it may compute a proper subset of the set of states reachable in finite time from a set of initial states. Therefore, we propose safe reachability, which always computes a superset of the set of reachable states. Second, in safety analysis of hybrid and continuous systems, it is important to ensure that a reachability analysis is also robust w.r.t. small perturbations to the set of initial states and to the system itself, since discrepancies between a system and its mathematical models are unavoidable. We show that, under certain conditions, the best Scott continuous approximation of an analysis A is also its best robust approximation. Finally, we exemplify the gap between the set of reachable states and the supersets computed by safe reachability and its best robust approximation. © 2018 The Authors

Ort, förlag, år, upplaga, sidor
Amsterdam: Elsevier, 2018
Nyckelord
Computational methods, Computer science, Robustness (control systems), Continuous approximations, Domain theory, Reachability, Reachability analysis, Robust approximations, Small perturbations, Transition relations, Transitive closure, Hybrid systems
Nationell ämneskategori
Reglerteknik Beräkningsmatematik Inbäddad systemteknik
Identifikatorer
urn:nbn:se:hh:diva-38699 (URN)10.1016/j.tcs.2018.06.020 (DOI)000447571900005 ()2-s2.0-85048949865 (Scopus ID)
Forskningsfinansiär
KK-stiftelsenELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Anmärkning

Funding: US NSF Grant number: 1736759

Tillgänglig från: 2019-01-08 Skapad: 2019-01-08 Senast uppdaterad: 2019-01-08Bibliografiskt granskad
Zeng, Y., Bartha, F. & Taha, W. (2017). Compile-Time Extensions to Hybrid ODEs. Electronic Proceedings in Theoretical Computer Science, 52-70
Öppna denna publikation i ny flik eller fönster >>Compile-Time Extensions to Hybrid ODEs
2017 (Engelska)Ingår i: Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180, E-ISSN 2075-2180, s. 52-70Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Reachability analysis for hybrid systems is an active area of development and has resulted in many promising prototype tools. Most of these tools allow users to express hybrid system as automata with a set of ordinary differential equations (ODEs) associated with each state, as well as rules for transitions between states. Significant effort goes into developing and verifying and correctly implementing those tools. As such, it is desirable to expand the scope of applicability tools of such as far as possible. With this goal, we show how compile-time transformations can be used to extend the basic hybrid ODE formalism traditionally supported in hybrid reachability tools such as SpaceEx or Flow*. The extension supports certain types of partial derivatives and equational constraints. These extensions allow users to express, among other things, the Euler-Lagrangian equation, and to capture practically relevant constraints that arise naturally in mechanical systems. Achieving this level of expressiveness requires using a binding time-analysis (BTA), program differentiation, symbolic Gaussian elimination, and abstract interpretation using interval analysis. Except for BTA, the other components are either readily available or can be easily added to most reachability tools. The paper therefore focuses on presenting both the declarative and algorithmic specifications for the BTA phase, and establishes the soundness of the algorithmic specifications with respect to the declarative one.

Ort, förlag, år, upplaga, sidor
Sydney: Open Publishing Association, 2017
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:hh:diva-35613 (URN)10.4204/EPTCS.247.5 (DOI)000405454600006 ()2-s2.0-85019253166 (Scopus ID)
Tillgänglig från: 2017-11-30 Skapad: 2017-11-30 Senast uppdaterad: 2018-01-13Bibliografiskt granskad
Lierler, Y. & Taha, W. (Eds.). (2017). Practical Aspects of Declarative Languages: 19th International Symposium, PADL 2017, Paris, France, January 16-17, 2017, Proceedings. Paper presented at 19th International Symposium, PADL 2017, Paris, France, January 16-17, 2017. Heidelberg: Springer Publishing Company
Öppna denna publikation i ny flik eller fönster >>Practical Aspects of Declarative Languages: 19th International Symposium, PADL 2017, Paris, France, January 16-17, 2017, Proceedings
2017 (Engelska)Proceedings (redaktörskap) (Refereegranskat)
Abstract [en]

The proceedings contain 14 papers. The special focus in this conference is on Practical Aspects of Declarative Languages. The topics include: Eliminating irrelevant non determinism in functional logic programs; canonicalizing high-level constructs in picat; integrating answer set programming with object-oriented languages; extending answer set programs with interpreted functions as first-class citizens; lowering the learning curve for declarative programming; overlapping patterns for property-based testing; Boltzmann samplers for closed simply-typed lambda terms; selection equilibria of higher-order games; principles and prototype implementation; declarative programming of full-fledged musical applications; a domain-specific language for software-defined radio; a declarative DSL for customizing ASCII art and using iterative deepening for probabilistic logic inference. © Copyright 2017 Elsevier B.V., All rights reserved

Ort, förlag, år, upplaga, sidor
Heidelberg: Springer Publishing Company, 2017. s. 215
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 10137
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:hh:diva-36710 (URN)10.1007/978-3-319-51676-9 (DOI)978-3-319-51675-2 (ISBN)978-3-319-51676-9 (ISBN)
Konferens
19th International Symposium, PADL 2017, Paris, France, January 16-17, 2017
Anmärkning

Scopus-ID: 2-s2.0-85010203601

Tillgänglig från: 2018-05-01 Skapad: 2018-05-01 Senast uppdaterad: 2018-05-02Bibliografiskt granskad
Duracz, A., Bartha, F. Á. & Taha, W. (2016). Accurate Rigorous Simulation Should be Possible for Good Designs. In: Erika Ábrahám & Sergiy Bogomolov (Ed.), Proceedings of the 2016 International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR): . Paper presented at 2nd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR’16), Vienna, Austria, April 11, 2016. Piscataway, NJ: IEEE conference proceedings, Article ID 7479376.
Öppna denna publikation i ny flik eller fönster >>Accurate Rigorous Simulation Should be Possible for Good Designs
2016 (Engelska)Ingår i: Proceedings of the 2016 International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR) / [ed] Erika Ábrahám & Sergiy Bogomolov, Piscataway, NJ: IEEE conference proceedings, 2016, artikel-id 7479376Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

The development of Cyber-Physical Systems benefits from better methods and tools to support the simulation and verification of hybrid (continuous/discrete) models. Acumen is an open source testbed for exploring the design space of what rigorous-but-practical next-generation tools can deliver to developers. Central to Acumen is the notion of rigorous simulation. Like verification tools, rigorous simulation is intended to provide guarantees about the behavior of the system. Like traditional simulation tools, it is intended to be intuitive, practical, and scalable. Whether these two goals can be achieved simultaneously is an important, long-term challenge.

This paper proposes a design principle that can play an important role in meeting this challenge. The principle addresses the criticism that accumulating numerical errors is a serious impediment to practical rigorous simulation. It is inspired by a twofold insight: one relating to the nature of systems engineered in the real world, and the other relating to how numerical errors in the simulation of a model can be recast as errors in the state or parameters of the model in the simulation. We present a suite of small, concrete benchmarks that can be used to assess the extent to which a rigorous simulator upholds the proposed principle. We also report on which benchmarks Acumen's current rigorous simulator already succeeds and which ones remain challenging.

Ort, förlag, år, upplaga, sidor
Piscataway, NJ: IEEE conference proceedings, 2016
Nyckelord
modeling, simulation, interval analysis, stability
Nationell ämneskategori
Beräkningsmatematik
Identifikatorer
urn:nbn:se:hh:diva-30577 (URN)10.1109/SNR.2016.7479376 (DOI)000382758100001 ()2-s2.0-84978544274 (Scopus ID)978-1-5090-3079-8 (ISBN)
Konferens
2nd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR’16), Vienna, Austria, April 11, 2016
Forskningsfinansiär
KK-stiftelsenVINNOVA, 2011-01819
Anmärkning

Funding: US NSF award CPS-1136099, the Swedish Knowledge Foundation (KK), The CERES Center, and VINNOVA (Dnr. 2011-01819).

Tillgänglig från: 2016-03-23 Skapad: 2016-03-23 Senast uppdaterad: 2018-03-22Bibliografiskt granskad
Taha, W., Duracz, A., Zeng, Y., Atkinson, K., Bartha, F. Á., Brauner, P., . . . Grante, C. (2016). Acumen: An Open-source Testbed for Cyber-Physical Systems Research. In: Benny Mandler, Johann Marquez-Barja, Miguel Elias Mitre Campista, Dagmar Cagáňová, Hakima Chaouchi, Sherali Zeadally, Mohamad Badra, Stefano Giordano, Maria Fazio, Andrey Somov & Radu-Laurentiu Vieriu (Ed.), Internet of Things. IoT Infrastructures: Second International Summit, IoT 360° 2015, Rome, Italy, October 27-29, 2015. Revised Selected Papers, Part I. Paper presented at EAI International Conference on CYber physiCaL systems, iOt and sensors Networks (CYCLONE '15), Rome, Italy, October 26, 2015 (pp. 118-130). Heidelberg: Springer, 169
Öppna denna publikation i ny flik eller fönster >>Acumen: An Open-source Testbed for Cyber-Physical Systems Research
Visa övriga...
2016 (Engelska)Ingår i: Internet of Things. IoT Infrastructures: Second International Summit, IoT 360° 2015, Rome, Italy, October 27-29, 2015. Revised Selected Papers, Part I / [ed] Benny Mandler, Johann Marquez-Barja, Miguel Elias Mitre Campista, Dagmar Cagáňová, Hakima Chaouchi, Sherali Zeadally, Mohamad Badra, Stefano Giordano, Maria Fazio, Andrey Somov & Radu-Laurentiu Vieriu, Heidelberg: Springer, 2016, Vol. 169, s. 118-130Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Developing Cyber-Physical Systems requires methods and tools to support simulation and verification of hybrid (both continuous and discrete) models. The Acumen modeling and simulation language is an open source testbed for exploring the design space of what rigorous-but-practical next-generation tools can deliver to developers of Cyber-Physical Systems. Like verification tools, a design goal for Acumen is to provide rigorous results. Like simulation tools, it aims to be intuitive, practical, and scalable. However, it is far from evident whether these two goals can be achieved simultaneously.

This paper explains the primary design goals for Acumen, the core challenges that must be addressed in order to achieve these goals, the "agile research method" taken by the project, the steps taken to realize these goals, the key lessons learned, and the emerging language design. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2016.

Ort, förlag, år, upplaga, sidor
Heidelberg: Springer, 2016
Serie
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, ISSN 1867-8211 ; 169
Nyckelord
Testbed, Cyber-Physical Systems (CPS), Modeling, Simulation, Hybrid Systems, Open Source Software
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:hh:diva-29592 (URN)10.1007/978-3-319-47063-4_11 (DOI)000398616500011 ()2-s2.0-85000500985 (Scopus ID)978-3-319-47062-7 (ISBN)978-3-319-47063-4 (ISBN)
Konferens
EAI International Conference on CYber physiCaL systems, iOt and sensors Networks (CYCLONE '15), Rome, Italy, October 26, 2015
Forskningsfinansiär
KK-stiftelsenVINNOVA, 2011-01819
Anmärkning

This work was supported by US NSF award CPS-1136099, the Swedish Knowledge Foundation (KK), The Center for Research on Embedded Systems (CERES), and VINNOVA (Dnr. 2011-01819).

Tillgänglig från: 2015-10-08 Skapad: 2015-10-08 Senast uppdaterad: 2018-03-22Bibliografiskt granskad
Aljarbouh, A., Zeng, Y., Duracz, A., Caillaud, B. & Taha, W. (2016). Chattering-Free Simulation for Hybrid Dynamical Systems: Semantics and Prototype Implementation. In: Randall Bilof (Ed.), 2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES): . Paper presented at 19th IEEE International Conference on Computational Science and Engineering (CSE 2016), Paris, France, August 24-26, 2016 (pp. 412-422). Los Alamitos: IEEE Computer Society, Article ID 7982279.
Öppna denna publikation i ny flik eller fönster >>Chattering-Free Simulation for Hybrid Dynamical Systems: Semantics and Prototype Implementation
Visa övriga...
2016 (Engelska)Ingår i: 2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES) / [ed] Randall Bilof, Los Alamitos: IEEE Computer Society, 2016, s. 412-422, artikel-id 7982279Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Chattering is a fundamental phenomenon that is unique to hybrid systems, due to the complex interaction between discrete dynamics (in the form of discrete transitions) and continuous dynamics (in the form of time). In practice, simulating chattering hybrid systems is challenging in that simulation effectively halts near the chattering time point, as an infinite number of discrete transitions would need to be simulated. In this paper, formal conditions are provided for when the simulated models of hybrid systems display chattering behavior, and methods are proposed for avoiding chattering “on the fly” in runtime. We utilize dynamical behavior analysis to derive conditions for detecting chattering without enumeration of modes. We also present a new iterative algorithm to allow for solutions to be carried past the chattering point, and we show by a prototypical implementation how to generate the equivalent chattering-free dynamics internally by the simulator in the main simulation loop. The concepts are illustrated with examples throughout the paper. © 2016 IEEE.

Ort, förlag, år, upplaga, sidor
Los Alamitos: IEEE Computer Society, 2016
Nyckelord
Hybrid systems, Numerical simulations, Chattering execution, Modeling and simulation, Model verification and completeness
Nationell ämneskategori
Datavetenskap (datalogi) Beräkningsmatematik
Identifikatorer
urn:nbn:se:hh:diva-32092 (URN)10.1109/CSE-EUC-DCABES.2016.217 (DOI)2-s2.0-85026642957 (Scopus ID)978-1-5090-3593-9 (ISBN)978-1-5090-3594-6 (ISBN)
Konferens
19th IEEE International Conference on Computational Science and Engineering (CSE 2016), Paris, France, August 24-26, 2016
Forskningsfinansiär
KK-stiftelsen
Anmärkning

Funding: Collège Doctoral International (CDI) of the European University of Brittany, Brittany Regional Council, ITEA2 MODRIO project, the US National Science Foundation award CPS-1136099, the Swedish Knowledge Foundation (KK), and the Center for Research on Embedded Systems (CERES)

Tillgänglig från: 2016-09-27 Skapad: 2016-09-27 Senast uppdaterad: 2018-03-22Bibliografiskt granskad
Taha, W., Zeng, Y., Duracz, A., Xu, F., Atkinson, K., Brauner, P., . . . Philippsen, R. (2016). Developing a first course on cyber-physical systems. ACM SIGBED Review, 14(1), 44-52
Öppna denna publikation i ny flik eller fönster >>Developing a first course on cyber-physical systems
Visa övriga...
2016 (Engelska)Ingår i: ACM SIGBED Review, E-ISSN 1551-3688, Vol. 14, nr 1, s. 44-52Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Effective and creative Cyber-Physical Systems (CPS) development requires expertise in disparate fields that have traditionally been taught in several distinct disciplines. At the same time, students seeking a CPS education generally come from diverse educational backgrounds. In this paper, we report on our recent experience of developing and teaching a course on CPS. The course addresses the following three questions: What are the core elements of CPS? How should these core concepts be integrated in the CPS design process? What types of modeling tools can assist in the design of Cyber-Physical Systems? Our experience with the first four offerings of the course has been positive overall. We also discuss the lessons we learned from some issues that were not handled well. All material including lecture notes and software used for the course are openly available online.

Ort, förlag, år, upplaga, sidor
New York, NY: Association for Computing Machinery (ACM), 2016
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:hh:diva-36619 (URN)10.1145/3036686.3036692 (DOI)
Anmärkning

This work is based on an earlier work: Developing a First Course on Cyber-Physical Systems, in Workshop on Embedded and Cyber-Physical Systems Education, WESE, © ACM, 2014. http://dx.doi.org/10.1145/2829957.2829964. The primary support for the development of the course comes from Halmstad University, the Swedish Knowledge Foundation’s CERES centre at Halmstad University, the Swedish Knowledge Foundation’s FAR-EIS project, and the US National Science Foundation CPS Robot Design project. 

Tillgänglig från: 2018-04-16 Skapad: 2018-04-16 Senast uppdaterad: 2018-04-17Bibliografiskt granskad
Konečný, M., Taha, W., Bartha, F. Á., Duracz, J., Duracz, A. & Ames, A. D. (2016). Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point. Nonlinear Analysis: Hybrid Systems, 20, 1-20
Öppna denna publikation i ny flik eller fönster >>Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point
Visa övriga...
2016 (Engelska)Ingår i: Nonlinear Analysis: Hybrid Systems, ISSN 1751-570X, E-ISSN 1878-7460, Vol. 20, s. 1-20Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Even simple hybrid automata like the classic bouncing ball can exhibit Zeno behavior. The existence of this type of behavior has so far forced a large class of simulators to either ignore some events or risk looping indefinitely. This in turn forces modelers to either insert ad-hoc restrictions to circumvent Zeno behavior or to abandon hybrid automata. To address this problem, we take a fresh look at event detection and localization. A key insight that emerges from this investigation is that an enclosure for a given time interval can be valid independent of the occurrence of a given event. Such an event can then even occur an unbounded number of times. This insight makes it possible to handle some types of Zeno behavior. If the post-Zeno state is defined explicitly in the given model of the hybrid automaton, the computed enclosure covers the corresponding trajectory that starts from the Zeno point through a restarted evolution. ©2015 The Authors. Published by Elsevier Ltd.

Ort, förlag, år, upplaga, sidor
London: Elsevier, 2016
Nyckelord
hybrid automata, hybrid systems, validated numerics, simulation, model validation, reliability
Nationell ämneskategori
Beräkningsmatematik
Identifikatorer
urn:nbn:se:hh:diva-29869 (URN)10.1016/j.nahs.2015.10.004 (DOI)000370898700001 ()2-s2.0-84947996983 (Scopus ID)
Forskningsfinansiär
KK-stiftelsen, 20100314
Anmärkning

A preliminary version of this paper was published in the proceedings of CPSNA 2013. This work was supported by the US National Science Foundation, awards NSF-CPS-1136099/1136104, the Swedish Knowledge Foundation (KK) and the Center for Research on Embedded Systems (CERES) grant number 20100314, and EPSRC grant number EP/C01037X/1.

Tillgänglig från: 2015-12-02 Skapad: 2015-12-02 Senast uppdaterad: 2018-03-22Bibliografiskt granskad
Taha, W., Hedström, L.-G., Xu, F., Duracz, A., Bartha, F. A., Zeng, Y., . . . Gunjan, G. (2016). Flipping a First Course on Cyber-Physical Systems – An Experience Report. In: Proceedings Of The 2016 Workshop On Embedded And Cyber-Physical Systems Education (Wese): . Paper presented at Workshop on Embedded and Cyber-Physical Systems Education (WESE 2016), Pittsburgh, PA, USA, Oct. 1-6, 2016. New York: ACM Press
Öppna denna publikation i ny flik eller fönster >>Flipping a First Course on Cyber-Physical Systems – An Experience Report
Visa övriga...
2016 (Engelska)Ingår i: Proceedings Of The 2016 Workshop On Embedded And Cyber-Physical Systems Education (Wese), New York: ACM Press, 2016Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

The flipped classroom format involves swapping activities traditionally performed inside and outside the classroom. The expected effects from this swap include increased student engagement and peer-to-peer interaction in the classroom, as well as more flexible access to learning materials. Key criteria for successful outcomes from these effects include improved test scores and enhanced student satisfaction. Unfortunately, while many researchers have reported positive outcomes from the approach, some instructors can still encounter difficulties in reproducing this success.

In this paper we report our experiences with flipping a first course on Cyber-Physical Systems at Halmstad University. The course is required for a Masters level program and is available as an elective for undergraduates. The focus of this report is on three separate editions of the course taught over three years. In the first year, lectures were recorded. In the second, the same instructor taught the course using the flipped format. In the third, new instructors taught it using the flipped classroom format.

Our experience suggests that flipping a classroom can lead to improved student performance and satisfaction from the first edition. It can also enable new instructors to take over the course and perform at a level comparable to an experienced instructor. On the other hand, it also suggests that the format may require more effort to prepare for, and to teach, than the traditional format, and that a higher level of attention to detail is needed to execute it with positive outcomes. Thus, the format can be demanding for instructors. It is also the case that not all students preferred this format.

Ort, förlag, år, upplaga, sidor
New York: ACM Press, 2016
Nyckelord
Flipped Classroom, Cyber-Physical Systems, Embedded Systems
Nationell ämneskategori
Didaktik
Identifikatorer
urn:nbn:se:hh:diva-32093 (URN)10.1145/3005329.3005337 (DOI)000406149500008 ()2-s2.0-85009773542 (Scopus ID)978-1-450-34657-3 (ISBN)
Konferens
Workshop on Embedded and Cyber-Physical Systems Education (WESE 2016), Pittsburgh, PA, USA, Oct. 1-6, 2016
Projekt
FAR-EIS
Forskningsfinansiär
KK-stiftelsen
Anmärkning

Funding: US National Science Foundation (NSF) through the NSF CPS Project #1136099, and the Swedish Knowledge Foundation (KK) Project FAR-EIS.

Tillgänglig från: 2016-09-27 Skapad: 2016-09-27 Senast uppdaterad: 2018-03-22Bibliografiskt granskad
Organisationer
Identifikatorer
ORCID-id: ORCID iD iconorcid.org/0000-0003-3160-9188

Sök vidare i DiVA

Visa alla publikationer