mdh.sePublikationer
Ändra sökning
Avgränsa sökresultatet
1 - 6 av 6
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Bygde, Stefan
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Lisper, Björn
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Holsti, Niklas
    Tidorum Ltd, Helsinki, Finland.
    Fully Bounded Polyhedral Analysis of Integers with Wrapping2011Ingår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 288, s. 3-13Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    analysis technique to discover linear relationships among variables in a program. However, the classical way of performing polyhedral analysis does not model the fact that values typically are stored as fixed-size binary strings and usually have a wrap-around semantics in the case of overflows. In embedded systems where 16-bit or even 8-bit processors are used, wrapping behaviour may even be used intentionally. Thus, to accurately and correctly analyse such systems, the wrapping has to be modelled. We present an approach to polyhedral analysis which derives polyhedra that are bounded in all dimensions and thus provides polyhedra that contain a finite number of integer points. Our approach uses a previously suggested wrapping technique for polyhedra but combines it in a novel way with limited widening, a suitable placement of widening points and restrictions on unbounded variables. We show how our method has the potential to significantly increase the precision compared to the previously suggested wrapping method.

  • 2.
    Carlson, Jan
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Håkansson, J.
    Uppsala University, Sweden.
    Pettersson, P.
    Uppsala University, Sweden.
    SaveCCM: An Analysable Component Model for Real-Time Systems2006Ingår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 160, nr 1, s. 127-140Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essential dimension is time, since many embedded systems have real-time requirements. We define a formal semantics of a component language for embedded systems, SaveCCM, a language designed with vehicle applications and safety concerns in focus. The semantics is defined by a transformation into timed automata with tasks, a formalism that explicitly models timing and real-time task scheduling. A simple SaveCCM system with a PI controller is used as a case study. Temporal properties of the PI controller have been successfully verified using the timed automata model checker Uppaal.

  • 3.
    Carlson, Jan
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Åkerholm, Mikael
    Mälardalens högskola.
    An event algebra extension of the triggering mechanism in a component model for embedded systems2005Ingår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 141, nr 3, s. 107-121Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this article we present how the component triggering in SaveCCM, a component model intended for embedded vehicular systems, can be extended by means of an event algebra. The extension allows components to be triggered by complex event patterns, and not only by clock signals or single external events. Separating the detection of triggering conditions from the definition of the triggered services permits more general components and thus improves component reusability. Providing event detection mechanisms within the component model means that triggering conditions are explicitly available for system analysis at design time. An event algebra is used to define the complex triggering conditions. This algebra has a relatively simple declarative semantics and well documented algebraic properties, which facilitates formal and informal reasoning about the system. The algebra also ensures that detection of triggering conditions can be efficiently implemented with limited resources, which is critical in embedded applications.

  • 4.
    Enoiu, Eduard Paul
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Marinescu, Raluca
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Causevic, Aida
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Seceleanu, Cristina
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    A Design Tool for Service-oriented Systems2013Ingår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 295, s. 95-100Artikel i tidskrift (Övrigt vetenskapligt)
    Abstract [en]

    In this paper we present a modeling and analysis tool for service-oriented systems. The tool enables graphical modeling of service-based systems, within the resource-aware timed behavioral language Remes, as well as a textual system description. We have developed a graphical environment where services can be composed as desired by the user, together with a textual service composition interface in which compositions can also be checked for correctness. We also provide automated traceability between the two design interfaces, which results in a tool that enhances the potential of system design by intuitive service manipulation. The paper presents the design principles, infrastructure, and the user interface of our tool.

  • 5.
    Ouimet, Martin
    et al.
    Massachusetts Institute of Technology, United States .
    Lundqvist, Kristina
    Massachusetts Institute of Technology, United States .
    Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver2007Ingår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 190, nr 2, s. 85-97Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In the requirements engineering community, consistency and completeness have been identified as important properties of system specifications. Custom algorithms to verify these properties automatically have been devised for a number of specification languages, including SCR, RSML, and Statecharts. In this paper, we provide means to automatically verify completeness and consistencyof Abstract State Machine (ASM) specifications. The verification is performed using a widely available tool, a SAT solver. The use of a SAT solver removes the need for designing and fine tuning language specific verification algorithms. Furthermore, the use of a SAT solver automates the verification procedure and produces a counterexample automatically when a specification is incomplete or inconsistent. We provide an algorithm to translate ASM specifications to a SAT problem instance. The translation is illustrated using the TASM toolset in conjunction with the "production cell system" case study.

  • 6.
    Slutej, Davor
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Håkansson, J.
    Uppsala University.
    Suryadevara, Jagadish
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Seceleanu, Cristina
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Pettersson, Paul
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Analyzing a Pattern-Based Model of a Real-Time Turntable System.2009Ingår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 1, nr 6, s. 161-178Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Designers of industrial real-time systems are commonly faced with the problem of complex system modeling and analysis, even if a component-based design paradigm is employed. In this paper, we present a case-study in formal modeling and analysis of a turntable system, for which the components are described in the SaveCCM language. The search for general principles underlying the internal structure of our real-time system has motivated us to propose three modeling patterns of common behaviors of real-time components, which can be instantiated in appropriate design contexts. The benefits of such reusable patterns are shown in the case-study, by allowing us to produce easy-to-read and manageable models for the real-time components of the turntable system. Moreover, we believe that the patterns may pave the way toward a generic pattern-based modeling framework targeting real-time systems in particular.

1 - 6 av 6
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf