mdh.sePublications
Change search
Refine search result
1 - 5 of 5
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest 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.
    Berhmann, Gerd
    et al.
    Aalborg University, Denmark .
    David, Alexandre
    Aalborg University, Denmark .
    Guldstrand Larsen, Kim
    Aalborg University, Denmark .
    Håkansson, John
    Uppsala University, Sweden .
    Pettersson, Paul
    Uppsala University, Sweden.
    Wang, Yi
    Uppsala University, Sweden.
    Hendriks, Martijn
    Radboud University Nijmegen, Netherlands .
    UPPAAL 4.02006In: Third International Conference on the Quantitative Evaluation of Systems, QEST 2006, 2006, p. 125-126Conference 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. 

  • 2.
    Berhmann, Gerd
    et al.
    NORDUnet A/S, Copenhagen, Denmark.
    David, Alexandre
    Department of Computer Science, Aalborg University.
    Guldstrand Larsen, Kim
    Department of Computer Science, Aalborg University.
    Pettersson, Paul
    Mälardalen University, School of Innovation, Design and Engineering.
    Yi, Wang
    Department of Information Technology, Uppsala University.
    Developing UPPAAL over 15 years2011In: Software - Practice and Experience, ISSN 0038-0644, Vol. 41, no 2, p. 133-142Article in journal (Refereed)
    Abstract [en]

    UPPAAL is a tool suitable for model checking real-time systems described as networks of timed automata communicating by channel synchronizations and extended with integer variables. Its first version was released in 1995 and its development is still very active. It now features an advanced modeling language, a user-friendly graphical interface, and a performant model checker engine. In addition, several flavors of the tool have matured in recent years. In this paper, we present how we managed to maintain the tool during 15 years, its current architecture with its challenges, and we give the future directions of the tool.

  • 3. David, Alexandre
    et al.
    Berhmann, Gerd
    Mälardalen University, School of Innovation, Design and Engineering.
    Guldstrand Larsen, Kim
    Pettersson, Paul
    Mälardalen University, School of Innovation, Design and Engineering.
    Illum Rasmussen, Jacob
    Mälardalen University, School of Innovation, Design and Engineering.
    Yi, Wang
    Mälardalen University, School of Innovation, Design and Engineering.
    Magnin, Morgan
    Outils pour le Model-Checking de Systèmes Temporisés2008In: Approches formelles des systèmes embarqués communicants / [ed] Roux, Olivier H. and Jard, Claude, Paris: Hermès science publications , 2008Chapter in book (Other academic)
  • 4.
    Fersman, Elena
    et al.
    Uppsala University, Sweden.
    Krcal, Pavel
    Uppsala University, Sweden.
    Pettersson, Paul
    Mälardalen University, Department of Computer Science and Electronics. Uppsala University, Sweden.
    Yi, Wang
    Uppsala University, Sweden.
    Task Automata: Schedulability, Decidability and Undecidability2007In: International Journal of Information and Computation, ISSN 0890-5401, Vol. 205, p. 1149-1172Article in journal (Refereed)
    Abstract [en]

    We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes that are computation tasks generated (or triggered) by timed events. Compared with classical task models for real time systems, task automata may be used to describe tasks (1) that are generated non-deterministically according to timing constraints in timed automata, (2) that may have interval execution times representing the best case and the worst case execution times, and (3) whose completion times may influence the releases of task instances. We generalize the classical notion of schedulability to task automata. A task automaton is schedulable if there exists a scheduling strategy such that all possible sequences of events generated by the automaton are schedulable in the sense that all associated tasks can be computed within their deadlines. Our first technical result is that the schedulability for a given scheduling strategy can be checked algorithmically for the class of task automata when the best case and the worst case execution times of tasks are equal. The proof is based on a decidable class of suspension automata: timed automata with bounded subtraction in which clocks may be updated by subtractions within a bounded zone. We shall also study the borderline between decidable and undecidable cases. Our second technical result shows that the schedulability checking problem will be undecidable if the following three conditions hold: (1) the execution times of tasks are intervals, (2) the precise finishing time of a task instance may influence new task releases, and (3) a task is allowed to preempt another running task.

  • 5.
    Fersman, Elena
    et al.
    Uppsala University, Sweden.
    Mokrushin, Leonid
    Uppsala University, Sweden.
    Pettersson, Paul
    Uppsala University, Sweden.
    Yi, Wang
    Uppsala University, Sweden.
    Schedulability Analysis of Fixed Priority Systems using Timed Automata2006In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 354, no 2, p. 301-317Article in journal (Refereed)
    Abstract [en]

    In classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks are released and computed 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 is in many cases huge. In this paper, we show that for fixed-priority scheduling strategy, the schedulability checking problem can be solved using standard timed automata with 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 Analysis (RMA). The result is further extended to systems with data-dependent control, in which the release time of a task may depend on the time-point at which other tasks finish their execution. For the case when the execution times of tasks are constants, we show that the schedulability problem can be solved using n+1 extra clocks, where n is the number of tasks. The presented analysis techniques have been implemented in the Times tool. For systems with only periodic tasks, the performance of the tool is comparable with tools implementing the classic RMA technique based on equation-solving, without suffering from the exponential explosion in the number of tasks.

1 - 5 of 5
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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