uu.seUppsala University Publications
Change search
Refine search result
123 1 - 50 of 133
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Oldest first
  • Newest first
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 1.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Sampled semantics of timed automata2010In: Logical Methods in Computer Science, ISSN 1860-5974, Vol. 6, no 3, 14:1-37 p.Article in journal (Refereed)
  • 2.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Universality of R-automata with value copying2009In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, Vol. 239, 131-141 p.Article in journal (Refereed)
  • 3.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    R-automata2008In: CONCUR 2008 - Concurrency Theory / [ed] VanBreugel F; Chechik M, Berlin: Springer-Verlag , 2008, 67-81 p.Conference paper (Refereed)
    Abstract [en]

    We introduce R-automata - finite state machines which operate on a finite number of unbounded counters. The values of the counters can be incremented, reset to zero, or left unchanged along the transitions. R-automata can be, for example, used to model systems with resources (modeled by the counters) which are consumed in small parts but which can be replenished at once. We define the language accepted by an R-automaton relative to a natural number D as the set of words allowing a run along which no counter value exceeds D. As the main result, we show decidability of the universality problem, i.e., the problem whether there is a number D such that the corresponding language is universal. We present a proof based on finite monoids and the factorization forest theorem. This theorem was applied for distance automata in [12] - a special case of R-automata with one counter which is never reset. As a second technical contribution, we extend the decidability result to R-automata with Buchi acceptance conditions.

  • 4.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Sampled universality of timed automata2007In: Foundations of Software Science and Computational Structures, Proceedings / [ed] Seidl, H, 2007, 2-16 p.Conference paper (Refereed)
    Abstract [en]

    Timed automata can be studied in not only a dense-time setting but also a discrete-time setting. The most common example of discrete-time semantics is the so called sampled semantics (i.e., discrete semantics with a fixed time granularity epsilon). In the real-time setting, the universality problem is known to be undecidable for timed automata. In this work, we study the universality question for the languages accepted by timed automata with sampled semantics. On the negative side, we show that deciding whether for all sampling periods epsilon a timed automaton accepts all timed words in epsilon-sampled semantics is as hard as in the real-time case, i.e., undecidable. On the positive side, we show that checking whether there is a sampling period such that a timed automaton accepts all untimed words in epsilon-sampled semantics is decidable. Our proof uses clock difference relations, developed to characterize the reachability relation for timed automata in connection with sampled semantics.

  • 5.
    Abdullah, Jakaria
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Mohaqeqi, Morteza
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Synthesis of Ada code from graph-based task models2017In: Proc. 32nd ACM Symposium on Applied Computing, New York: ACM Press, 2017, 1467-1472 p.Conference paper (Refereed)
  • 6.
    Abdullah, Syed Md Jakaria
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lampka, Kai
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Improving performance by monitoring while maintaining worst-case guarantees2016In: Proc. 19th Conference on Design, Automation and Test in Europe, Piscataway, NJ: IEEE, 2016, 257-260 p.Conference paper (Refereed)
  • 7. Amnell, Tobias
    et al.
    David, Alexandre
    Fersman, Elena
    Möller, Oliver
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Tools for Real-Time UML: Formal Verification and Code Synthesis2001In: Proceedings of the Workshop on Specification, Implementation and Validation of Object-oriented Embedded Systems, 2001Conference paper (Other (popular scientific, debate etc.))
  • 8.
    Amnell, Tobias
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Fersman, Elena
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Mokrushin, Leonid
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Pettersson, Paul
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    TIMES: A Tool for Modelling and Implementation of Embedded Systems2002In: Tools and Algorithms for the Construction and Analysis of Systems: TACAS 2002, Berlin: Springer-Verlag , 2002, 460-464 p.Conference paper (Refereed)
  • 9.
    Amnell, Tobias
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Fersman, Elena
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Mokrushin, Leonid
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    TIMES: a Tool for Schedulability Analysis and Code Generation of Real-Time Systems2003In: Proceedings of the International Conference of Formal Modeling and Analysis of Timed Systems, 2003Conference paper (Refereed)
    Abstract [en]

    TIMES is a tool suite designed mainly for symbolic schedulability analysis and synthesis of executable code with predictable behaviours for real-time systems. Given a system design model consisting of

    (1) a set of application tasks whose executions may be required to meet mixed timing, precedence, and resource constraints,

    (2) a network of timed automata describing the task arrival patterns and

    (3) a preemptive or non-preemptive scheduling policy,

    TIMES will generate a scheduler, and calculate the worst case response times for the tasks. The design model may be further validated using a model checker e.g. UPPAAL and then compiled to executable C-code using the TIMES compiler. In this paper, we present the design and main features of TIMES including a summary of theoretical results behind the tool. TIMES can be downloaded at www.timestool.com.

  • 10.
    Amnell, Tobias
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Fersman, Elena
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Sun, Hongyan
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Code Synthesis for Timed Automata2002In: Nordic Journal of Computing, Vol. 9, no 4, 269-300 p.Article in journal (Other scientific)
  • 11.
    Axer, Philip
    et al.
    Technical University Braunschweig.
    Ernst, Rolf
    Technical University Braunschweig.
    Falk, Heiko
    Ulm University.
    Girault, Alain
    INRIA Grenoble Rhône-Alpes.
    Grund, Daniel
    Saarland University.
    Guan, Nan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Marwedel, Peter
    Technical University Dortmund.
    Reineke, Jan
    Saarland University.
    Rochange, Christine
    University of Toulouse.
    Sebastian, Maurice
    Technical University Braunschweig.
    von Hanxleden, Reinhard
    Christian-Albrechts-Universität zu Kiel.
    Wilhelm, Reinhard
    Saarland University.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Building timing predictable embedded systems2014In: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 13, no 4, 82:1-37 p.Article in journal (Refereed)
  • 12.
    Behrmann Gerd,
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bengtsson, Johan
    David, Alexandre
    Larsen, Kim
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    UPPAAL Implementation Secrets2002In: International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems, 2002, 3- p.Conference paper (Refereed)
  • 13. Behrmann, Gerd
    et al.
    David, Alexandre
    Larsen, Kim G.
    Håkansson, John
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Hendriks, Martijn
    Uppaal 4.02006In: Proceedings of 3rd International Conference on Quantitative Evaluation of Systems, 2006Conference paper (Refereed)
    Abstract [en]

    UPPAAL 4.0 is the result of over two and a half years of development and contains many new features, additions to the modeling language, performance improvements, enhancements and polish to the the easy to use graphical user interface, and is accompanied by several open source libraries. The tool and libraries are available free of charge for academic, educational and evaluation purposes from http://www.uppaal.com/. We describe three of the new features: User defined functions, priorities and symmetry reduction.

  • 14. Behrmann, Gerd
    et al.
    David, Alexandre
    Larsen, Kim Guldstrand
    Pettersson, Paul
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Developing UPPAAL over 15 years2011In: Software, practice & experience, ISSN 0038-0644, E-ISSN 1097-024X, Vol. 41, no 2, 133-142 p.Article in journal (Refereed)
  • 15. Behrmann, Gerd
    et al.
    David, Alexandre
    Larsen, Kim
    Möller, Oliver
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Datorteknik.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Datorteknik.
    UPPAAL - Present and Future2001In: Proceedings of the 40th IEEE Conference on Decision and Control, 2001Conference paper (Refereed)
  • 16. Behrmann, Gerd
    et al.
    David, Alexandre
    Larsen, Kim
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    New UPPAAL Architecture2002In: Workshop on Real-Time Tools, 2002Conference paper (Refereed)
  • 17.
    Bengtsson, Johan
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Griffioen, David
    Kristoffersen, Kåre
    Larsen, Kim
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Larsson, Fredrik
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Automated Analysis of an Audio Control Protocol Using UPPAAL2002In: Journal of Logic and Algebraic Programming, Vol. 52-53, 163-181 p.Article in journal (Other scientific)
  • 18.
    Bengtsson, Johan
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Wang, Yi
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Timed Automata: Semantics, Algorithms and Tools2004In: In Lecture Notes on Concurrency and Petri Nets: LNCS 3098, 2004Conference paper (Other scientific)
  • 19. Bengtsson, Johan
    et al.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Timed Automata: Semantics, Algorithms and Tools2003In: Lectures on Concurrency and Petri Nets, Advances in Petri Nets, 2003, 87-124 p.Chapter in book (Refereed)
  • 20.
    Bengtsson, Johan
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata2003In: Formal Methods and Software Engineering, 5th International Conference on Formal Engineering Methods, ICFEM 2003, Singapore, November 5-7, 2003, 2003Conference paper (Refereed)
  • 21. Bi, Yin
    et al.
    Lv, Mingsong
    Song, Chen
    Xu, Wenyao
    Guan, Nan
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    AutoDietary: A wearable acoustic sensor system for food intake recognition in daily life2016In: IEEE Sensors Journal, ISSN 1530-437X, E-ISSN 1558-1748, Vol. 16, no 3, 806-816 p.Article in journal (Refereed)
  • 22. Bi, Yin
    et al.
    Lv, Mingsong
    Wei, Yangjie
    Guan, Nan
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Multi-feature fusion for thermal face recognition2016In: Infrared physics & technology, ISSN 1350-4495, E-ISSN 1879-0275, Vol. 77, 366-374 p.Article in journal (Refereed)
  • 23. David, Alexandre
    et al.
    Behrmann, Gerd
    Larsen, Kim
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    A Tool Architecture for the Next Generation of Uppaal2002In: Formal Methods at the Crossroads. From Panacea to Foundational Support, Springer , 2002, 352-366 p.Chapter in book (Refereed)
  • 24.
    David, Alexandre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Computer Systems.
    Behrmann, Gerd
    Larsen, Kim
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Unification & Sharing in Timed Automata Verification2003In: Model Checking Software, 10th International SPIN Workshop. Portland, OR, USA, May 9-10, 2003, 2003Conference paper (Refereed)
  • 25.
    David, Alexandre
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. COMPUTER SYSTEMS.
    Möller, M. Oliver
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Verification of UML Statecharts with Real-Time Extensions2003Report (Other scientific)
    Abstract [en]

    Mobile work situations within home care of the elderly require

    immediate and ubiquitous access to patient-oriented data. We intend to develop a mobile information system that provides correct information in a proper way to the right person in the appropriate occasion of care. This requires a thorough user needs analysis that so far often has been neglected during systems development in health care. We conducted the user needs analysis in interdisciplinary working groups in order to achieve a holistic view of the entire work process. This allows for the development of not only patient-oriented but care process oriented systems. In this paper, we describe how the user needs analysis was conducted, the impact of this work on the user group and some of the requirements found to be specific for mobile IT-support for home

    care of the elderly.

  • 26. David, Alexandre
    et al.
    Möller, Oliver
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Formal Verification of UML Statecharts with Real-Time Extensions2002In: Fundamental Approaches to Software Engineering, 5th International Conference, FASE 2002, held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002, 2002, 218-232 p.Conference paper (Refereed)
  • 27. de Boer, Frank S.
    et al.
    Grabe, Immo
    Jaghoori, Mohammad Mahdi
    Stam, Andries
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Modeling and analysis of thread-pools in an industrial communication platform2009In: Formal Methods and Software Engineering, Berlin: Springer-Verlag , 2009, 367-386 p.Conference paper (Refereed)
  • 28. Deng, Qingxu
    et al.
    Kong, Fanxin
    Guan, Nan
    Lv, Mingsong
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    On-line placement of real-time tasks on 2D partially run-time reconfigurable FPGAs2008In: Proc. 5th IEEE International Symposium on Embedded Computing, Piscataway, NJ: IEEE , 2008, 20-25 p.Conference paper (Refereed)
  • 29. Dong, Jin Song
    et al.
    Hao, Ping
    Qin, Shengchao
    Sun, Jun
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Timed Automata Patterns2008In: IEEE Transactions on Software Engineering, ISSN 0098-5589, Vol. 34, no 6, 844-859 p.Article in journal (Refereed)
  • 30.
    Ekberg, Pontus
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Guan, Nan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Stigge, Martin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    An optimal resource sharing protocol for generalized multiframe tasks2015In: The Journal of logical and algebraic methods in programming, ISSN 2352-2216, E-ISSN 2352-2208, Vol. 84, no 1, 92-105 p.Article in journal (Refereed)
  • 31.
    Ekberg, Pontus
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bounding and shaping the demand of generalized mixed-criticality sporadic task systems2014In: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 50, no 1, 48-86 p.Article in journal (Refereed)
    Abstract [en]

    We generalize the commonly used mixed-criticality sporadic task model to let all task parameters (execution-time, deadline and period) change between criticality modes. In addition, new tasks may be added in higher criticality modes and the modes may be arranged using any directed acyclic graph, where the nodes represent the different criticality modes and the edges the possible mode switches. We formulate demand bound functions for mixed-criticality sporadic tasks and use these to determine EDF-schedulability. Tasks have different demand bound functions for each criticality mode. We show how to shift execution demand between different criticality modes by tuning the relative deadlines. This allows us to shape the demand characteristics of each task. We propose efficient algorithms for tuning all relative deadlines of a task set in order to shape the total demand to the available supply of thecomputing platform. Experiments indicate that this approach is successful in practice. This new approach has the added benefit of supporting hierarchical scheduling frameworks.

  • 32.
    Ekberg, Pontus
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Schedulability analysis of a graph-based task model for mixed-criticality systems2016In: Real-time systems, ISSN 0922-6443, E-ISSN 1573-1383, Vol. 52, no 1, 1-37 p.Article in journal (Refereed)
  • 33.
    Ekberg, Pontus
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly coNP-complete2015In: Proc. 27th Euromicro Conference on Real-Time Systems, Piscataway, NJ: IEEE, 2015, 281-286 p.Conference paper (Refereed)
  • 34.
    Ekberg, Pontus
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization2015In: Proc. 36th Real-Time Systems Symposium, IEEE Computer Society, 2015, 87-95 p.Conference paper (Refereed)
  • 35.
    Ekberg, Pontus
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bounding and shaping the demand of mixed-criticality sporadic tasks2012In: Proc. 24th Euromicro Conference on Real-Time Systems, IEEE Computer Society, 2012, 135-144 p.Conference paper (Refereed)
  • 36. Fersman, Elena
    et al.
    Krcal, Pavel
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Pettersson, Paul
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Task automata: Schedulability, decidability and undecidability2007In: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 205, no 8, 1149-1172 p.Article in journal (Refereed)
  • 37.
    Fersman, Elena
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Mokrushin, Leonid
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Schedulability Analysis of Fixed Priority Systems using Timed Automata2006In: Theoretical Computer Science, Vol. 354, no 2, 301-317 p.Article in journal (Refereed)
  • 38.
    Fersman, Elena
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Mokrushin, Leonid
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Pettersson, Paul
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. DoCS.
    Schedulability Analysis using Two Clocks2003In: Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003Conference paper (Refereed)
    Abstract [en]

    In classic scheduling theory, real-time tasks are usually assumed to

    be periodic, i.e. tasks arrive and compute with fixed rates

    periodically. To relax the stringent constraints on task arrival

    times, we propose to use timed automata to describe task arrival

    patterns. In a previous work, it is shown that the general

    schedulability checking problem for such models is a reachability

    problem for a decidable class of timed automata extended with

    subtraction. Unfortunately, the number of clocks needed in the

    analysis is proportional to the maximal number of schedulable task

    instances associated with a model, which in many cases is huge.

    In this paper, we show that for fixed priority scheduling strategy,

    the schedulability checking problem can be solved by reachability

    analysis on standard timed automata using only two extra clocks

    in addition to the clocks used in the original model to describe task

    arrival times. The analysis can be done in a similar manner to

    response time analysis in classic Rate-Monotonic Scheduling.

    We believe that this is the optimal solution to the problem,

    a problem that was suspected undecidable previously.

    We also extend the result to systems in which the timed automata and the tasks may read and update shared data variables. Then the release time-point of a task may depend on the values of the shared variables, and hence on the time-point at which other tasks finish their exection. We show that this schedulability problem can be encoded as timed automata using n+1 extra clocks, where n is the number of tasks.

  • 39.
    Fersman, Elena
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    Wang, Yi
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Datorteknik.
    A generic approach to schedulability analysis of real-time tasks2004In: Nordic Journal of Computing, Vol. 11Article in journal (Refereed)
  • 40. Fersman, Elena
    et al.
    Yi, Wang
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    A Generic Approach to Schedulability Analysis of Real-Time Tasks2004In: Nordic Journal of Computing, ISSN 1236-6064, Vol. 12, no 2, 129-147 p.Article in journal (Refereed)
  • 41.
    Flodin, Jonas
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lampka, Kai
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Dynamic budgeting for settling DRAM contention of co-running hard and soft real-time tasks2014In: Proc. 9th International Symposium on Industrial Embedded Systems, Piscataway, NJ: IEEE, 2014, 151-159 p.Conference paper (Refereed)
  • 42. Gu, Chuancai
    et al.
    Guan, Nan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Deng, Qingxu
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Improving OCBP-based scheduling for mixed-criticality sporadic task systems2013In: Proc. 19th International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE Computer Society, 2013Conference paper (Refereed)
  • 43. Gu, Chuancai
    et al.
    Guan, Nan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Deng, Qingxu
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Partitioned mixed-criticality scheduling on multiprocessor platforms2014In: Proc. 17th Conference on Design, Automation and Test in Europe, Piscataway, NJ: IEEE , 2014Conference paper (Other academic)
  • 44. Gu, Chuancai
    et al.
    Guan, Nan
    Feng, Zhiwei
    Deng, Qingxu
    Sharon Hu, Xiaobo
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Transforming real-time task graphs to improve schedulability2016In: Proc. 22nd International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE Computer Society, 2016, 29-38 p.Conference paper (Refereed)
  • 45.
    Guan, Nan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Ekberg, Pontus
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Stigge, Martin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems2011In: Proc. Real-Time Systems Symposium, Piscataway, NJ: IEEE , 2011, 13-23 p.Conference paper (Refereed)
  • 46.
    Guan, Nan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Ekberg, Pontus
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Stigge, Martin
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Resource sharing protocols for real-time task graph systems2011In: Proc. 23rd Euromicro Conference on Real-Time Systems, Piscataway, NJ: IEEE , 2011, 272-281 p.Conference paper (Refereed)
  • 47. Guan, Nan
    et al.
    Gu, Zonghua
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yu, Ge
    Improving scalability of model-checking for minimizing buffer requirements of synchronous dataflow graphs2009In: Proc. 14th Asia and South Pacific Design Automation Conference, Piscataway, NJ: IEEE , 2009, 715-720 p.Conference paper (Refereed)
  • 48. Guan, Nan
    et al.
    Han, Meiling
    Gu, Chuancai
    Deng, Qingxu
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Bounding carry-in interference to improve fixed-priority global multiprocessor scheduling analysis2015In: Proc. 21st International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE Computer Society, 2015, 11-20 p.Conference paper (Refereed)
  • 49.
    Guan, Nan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lv, Mingsong
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yu, Ge
    WCET Analysis with MRU Cache: Challenging LRU for Predictability2014In: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 13, no 4s, 123Article in journal (Refereed)
    Abstract [en]

    Most previous work on cache analysis for WCET estimation assumes a particular replacement policy called LRU. In contrast, much less work has been done for non-LRU policies, since they are generally considered to be very unpredictable. However, most commercial processors are actually equipped with these non-LRU policies, since they are more efficient in terms of hardware cost, power consumption and thermal output, while still maintaining almost as good average-case performance as LRU. In this work, we study the analysis of MRU, a non-LRU replacement policy employed in mainstream processor architectures like Intel Nehalem. Our work shows that the predictability of MRU has been significantly underestimated before, mainly because the existing cache analysis techniques and metrics do not match MRU well. As our main technical contribution, we propose a new cache hit/miss classification, k-Miss, to better capture the MRU behavior, and develop formal conditions and efficient techniques to decide k-Miss memory accesses. A remarkable feature of our analysis is that the k-Miss classifications under MRU are derived by the analysis result of the same program under LRU. Therefore, our approach inherits the advantages in efficiency and precision of the state-of-the-art LRU analysis techniques based on abstract interpretation. Experiments with instruction caches show that our proposed MRU analysis has both good precision and high efficiency, and the obtained estimated WCET is rather close to (typically 1%similar to 8% more than) that obtained by the state-of-the-art LRU analysis, which indicates that MRU is also a good candidate for cache replacement policies in real-time systems.

  • 50.
    Guan, Nan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Lv, Mingsong
    Yi, Wang
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Yu, Ge
    WCET analysis with MRU caches: Challenging LRU for predictability2012In: Proc. 18th Real-Time and Embedded Technology and Applications Symposium, IEEE Computer Society, 2012, 55-64 p.Conference paper (Refereed)
    Abstract [en]

    Most previous work in cache analysis for WCET estimation assumes a particular replacement policy called LRU. In contrast, much less work has been done for non-LRU policies, since they are generally considered to be very "unpredictable". However, most commercial processors are actually equipped with these non-LRU policies, since they are more efficient in terms of hardware cost, power consumption and thermal output, but still maintaining almost as good average-case performance as LRU. In this work, we study the analysis of MRU, a non-LRU replacement policy employed in mainstream processor architectures like Intel Nehalem. Our work shows that the predictability of MRU has been significantly underestimated before, mainly because the existing cache analysis techniques and metrics, originally designed for LRU, do not match MRU well. As our main technical contribution, we propose a new cache hit/miss classification, k-Miss, to better capture the MRU behavior, and develop formal conditions and efficient techniques to decide the k-Miss memory accesses. A remarkable feature of our analysis is that the k-Miss classifications under MRU are derived by the analysis result of the same program under LRU. Therefore, our approach inherits all the advantages in efficiency, precision and composability of the state-of-the-art LRU analysis techniques based on abstract interpretation. Experiments with benchmarks show that the estimated WCET by our proposed MRU analysis is rather close to (5% similar to 20% more than) that obtained by the state-of-the-art LRU analysis, which indicates that MRU is also a good candidate for the cache replacement policy in real-time systems.

123 1 - 50 of 133
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf