SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Åkesson Johan 1964) ;hsvcat:2"

Search: WFRF:(Åkesson Johan 1964) > Engineering and Technology

  • Result 1-3 of 3
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Tidstam, Anna, 1983, et al. (author)
  • Formal Methods for the Inspection of Vehicle Configuration Rules
  • 2014
  • Journal article (other academic/artistic)abstract
    • Vehicle configuration is the activity to create a vehicle specification from a set of predefined components that can only be combined in certain ways. These certain ways are defined by logic expressions called vehicle configuration rules. The vehicle configuration rules can be visualized, and then manually inspected by a product developer. The inspection of vehicle configuration rules aims at preventing errors, and is used when collaborating on the development of new vehicle configurations. This paper proposes formal methods supporting the inspection of vehicle configuration rules, by addressing the 1) reformulation of vehicle configuration rules, 2) testing of feature variant combinations, and 3) counting of item quantities from an item set. The formal methods were tested on industrial vehicle configuration rules for computational performance. The results show that the time for execution is within seconds. The future work is to implement the formal methods with a demonstrator that could be tested by product developers.
  •  
2.
  • Tidstam, Anna, 1983, et al. (author)
  • Formulating Constraint Satisfaction Problems for the Inspection of Configuration Rules
  • 2016
  • In: Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM. - 0890-0604 .- 1469-1760. ; 30:3, s. 313-328
  • Journal article (peer-reviewed)abstract
    • Product configuration is when an artifact from a product family is assembled from a set of predefined components that can only be combined in certain ways. These ways are defined by configuration rules. The product developers inspect the configuration rules when they develop new configuration rules or modify the configuration rules set. The inspection of configuration rules is thereby an important activity to avoid errors in the configuration rules set. Several formulations of constraint satisfaction problems (CSPs) are proposed that facilitate the inspection of configuration rules in propositional logic (IF-THEN, AND, NOT, OR, etc.). Many of the configuration rules are so called production rules; that is, a configuration rule is an IF-THEN expression that fires when the IF condition is met. Several configuration rules build chains that fire during the product configuration. It is therefore important not only to inspect single configuration rules but also to analyze the effect of multiple configuration rules. Formulating the tasks as variations of the CSP can support the inspection activity. More specifically, we address the reformulation of configuration rules, testing of feature variant combinations, and counting of item quantities from an item set. The suggested CSPs are tested on industrial vehicle configuration rules for computational performance. The results show that the time for achieving results from the solving of the CSP is within seconds. Our future work will be to implement the various CSPs into a demonstrator that could be tested by product developers.
  •  
3.
  • Voronov, Alexey, 1983, et al. (author)
  • Verification of Item Usage Rules in Product Configuration
  • 2012
  • In: IFIP Advances in Information and Communication Technology. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1868-4238 .- 1868-422X. ; , s. 182-191
  • Conference paper (peer-reviewed)abstract
    • In the development of complex products product configuration systems are often used to support the development process. Item Usage Rules (IURs) are conditions for including specific items in products bills of materials based on a high-level product description. Large number of items and significant complexity of IURs make it difficult to maintain and analyze IURs manually. In this paper we present an automated approach for verifying IURs, which guarantees the presence of exactly one item from a predefined set in each product, as well as that an IUR can be reformulated without changing the set of products for which the item was included.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-3 of 3
Type of publication
journal article (2)
conference paper (1)
Type of content
peer-reviewed (2)
other academic/artistic (1)
Author/Editor
Åkesson, Knut, 1972 (3)
Malmqvist, Johan, 19 ... (3)
Tidstam, Anna, 1983 (3)
Voronov, Alexey, 198 ... (3)
Fabian, Martin, 1960 (2)
University
Chalmers University of Technology (3)
Language
English (3)
Research subject (UKÄ/SCB)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view