| 1. |
- Ahlford, Marianne, et al.
(författare)
-
Uppsala Underdogs - A Robot Soccer Project
- 2006
-
Rapport (populärvet., debatt m.m.)abstract
- In this paper, we describe the four-legged soccer team Uppsala Underdogs developed by a group of 4th year computer science students at Uppsala University during the fall of 2004. The project is based on the experience from two similar previous projects. This year the emphasis of the project has been on distribution of data and on support for evaluation and reconfiguration of strategies. To support data distribution, a middleware has been developed, which implements a replication algorithm and provides a clean interface for the other software modules (or behaviors). To enable easy reconfiguration of strategies, an automata-based graphical description language has been developed, which can be compiled into code that uses the database and the lower level modules, such as tactics and positioning, to make decisions and control the robot. In addition, a graphical simulator has been developed in which the strategies can be evaluated.
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Amnell, Tobias, et al.
(författare)
-
TIMES: a Tool for Schedulability Analysis and Code Generation of Real-Time Systems
- 2003
-
Ingår i: Proceedings of the International Conference of Formal Modeling and Analysis of Timed Systems. - 9783540216711
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 5. |
- Andreasson, Mattias, et al.
(författare)
-
Project Avatar Developing a Distributed Mobile Phone Game
- 2006
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Team Avatar, as the members of Project Avatar have come to be known by, is a group of 4th year computer science students at Uppsala University that have been developing a distributed mobile phone game during the fall of 2005. In this paper we describe the general design and environment of the result of Project Avatar - the game Three Crowns.
|
|
| 6. |
- Bahar, Bahram, et al.
(författare)
-
Developing A-GPS as a Student Project
- 2006
-
Rapport (populärvet., debatt m.m.)abstract
- The project consists of ten fourth-year computer science students at Uppsala University developing an A-GPS (Assisted-GPS) system. During the fall term of 2005 the students have developed a module for GPS-calculations in a GSM-network and an application that demonstrates a possible way of using the calculations module. This paper describes the design, the development process and the results of the project.
|
|
| 7. |
- Berezovskyi, Andrii, 1991-, et al.
(författare)
-
Integrating systems of systems with a federation of rule engines
- 2024
-
Ingår i: Journal of Industrial Information Integration. - : Elsevier BV. - 2467-964X .- 2452-414X. ; 38
-
Tidskriftsartikel (refereegranskat)abstract
- Systems of Systems (SoSs) integrate many critical systems our society relies on. In designing individual systems, stakeholders use bespoke protocols, custom information models, and proprietary components with limited computational resources from various vendors. We present a reference architecture that allows multiple stakeholders to carry out a flexible integration without giving up control to a single entity in the presence of the aforementioned limitations. Our architecture relies on rule engines and graph data model to integrated systems flexibly even when black-box components are used. At the same time, a federation of the rule engines allows each stakeholder to retain control over the rules that reflect their policies. We also rely on a common information model based on ontologies to account for the information model mismatch and reduce the duplication of integration efforts. Moving rule execution to the standalone rule engines allows deployment in resource-constrained and proprietary environments. A uniform application programming interface (API) is used to integrate rule engines across systems as well as components within each system with a respective rule engine. We also present a novel algorithm to determine dependencies across rules deployed in different rule engines within the federation. This allows domain experts to develop rules as usual without having to deal with the distributed aspect of the system. We also present a proof of the sufficient condition to ensure all necessary notifications will be sent to ensure correct rule activation across different rule engines. Compared to other systems involving distributed rules, the proposed architecture is well-suited for the integration of transactional workloads commonly found in enterprises. The qualitative evaluation based on the Architecture Tradeoff Analysis Method (ATAM), applied to a telecommunications use case, shows that the architecture possesses the “interoperability”, “modifiability”, and the “functional completeness” quality attributes with a trade-off around rule expressiveness. The quantitative evaluation demonstrates speedup over the single-node setup in most scenarios except in case of highly optimized rules and a poor network performance simultaneously (tr<10ms, tn=100ms).
|
|
| 8. |
- Cedheim, Erik, et al.
(författare)
-
Kelb - A Real-Time Programming Environment for the Sony Aibo
- 2004
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Kelb is a new real-time programming environment developed at Uppsala University for the Sony AIBO ERS-210. It is aimed to provide efficiency by introducing a notion of light-weight tasks executing according to well-known real-time scheduling algorithms and resource protocols, while still allowing applications to be developed in a high-level abstract programming language. In this paper we give an overview of the design of Kelb and describe the status of the environment, currently including: a real-time programming language and compiler extending gcc for MIPS with support for time- and event-triggered tasks, a runtime library with support for static and dynamic preemptive scheduling algorithms (e.g. fixed priority and earliest deadline first), and a prototype connection to the Times tool allowing Kelb designs to be analysed for schedulabilty.
|
|
| 9. |
- Fersman, Elena, et al.
(författare)
-
Schedulability Analysis of Fixed-Priority Systems using Timed Automata
- 2006
-
Ingår i: Theoretical Computer Science. - : Elsevier. - 0304-3975 .- 1879-2294. ; 354:2, s. 301-317
-
Tidskriftsartikel (refereegranskat)abstract
- 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+1n+1 extra clocks, where nn 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.
|
|
| 10. |
|
|
| 11. |
|
|
| 12. |
- Fersman, Elena, et al.
(författare)
-
Schedulability Analysis using Two Clocks
- 2003
-
Ingår i: Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems. - 9783540008989
-
Konferensbidrag (refereegranskat)abstract
- In classic scheduling theory, real-time tasks are usually assumed tobe periodic, i.e. tasks arrive and compute with fixed ratesperiodically. To relax the stringent constraints on task arrivaltimes, we propose to use timed automata to describe task arrivalpatterns. In a previous work, it is shown that the generalschedulability checking problem for such models is a reachabilityproblem for a decidable class of timed automata extended withsubtraction. Unfortunately, the number of clocks needed in theanalysis is proportional to the maximal number of schedulable taskinstances 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 reachabilityanalysis on standard timed automata using only two extra clocksin addition to the clocks used in the original model to describe taskarrival times. The analysis can be done in a similar manner toresponse 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.
|
|
| 13. |
- Håkansson, John, et al.
(författare)
-
An Analysis Tool for UML Models with SPT Annotations
- 2004
-
Ingår i: Proceedings of the International Workshop on Specification and Validation of UML models for Real Time and Embedded Systems.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 14. |
- Inam, Rafia, et al.
(författare)
-
Feasibility Assessment to Realise Vehicle Teleoperation using Cellular Networks
- 2016
-
Ingår i: Proceedings of the 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC). - IEEE.
-
Konferensbidrag (refereegranskat)abstract
- Future cellular networks (5G) will be used for a diversity of use cases. Transportation is one domain where cellular networks can play a significant role not only in connecting autonomous vehicles to other vehicles, infrastructures, and people, but also in realizing vehicle teleoperation i.e., vehicle driven by an operator from a distance. In this paper, we assess the feasibility of using a cellular network to realise vehicle teleoperation. We identify the network requirements for a teleoperated vehicle use case in an urban environment using a test setup of an LTE network and simulations. Testbed measurements reveal that teleoperation use cases can be supported even with less than excellent signal strength. Through simulation we show that the testbed can scale to cover greater distances and support teleoperation
|
|
| 15. |
- Inam, Rafia, et al.
(författare)
-
Towards Automated Service-Oriented Lifecycle Management for 5G Networks
- 2015
-
Ingår i: Proceedings of the 2015 IEEE Conference on Emerging Technologies & Factory Automation (ETFA).
-
Konferensbidrag (refereegranskat)abstract
- 5G networks will be a key enabler for the Internet of Things by providing a platform to connect a massive number of devices with heterogeneous sets of network quality requirements. In this environment, 5G network operators will have to solve the complex challenge of managing network services for diverse customer sectors (such as automotive, health or energy) with different requirements throughout their lifecycle.In this paper, we present current state of our work on automating part of the network service lifecycle management using knowledge management- and decision support techniques. We also present our ongoing implementation steps for such management function in 5G networks.
|
|
| 16. |
|
|
| 17. |
- Vulgarakis Feljan, Aneta, et al.
(författare)
-
A Framework for Knowledge Management and Automated Reasoning Applied on Intelligent Transport Systems
- 2017
-
Rapport (populärvet., debatt m.m.)abstract
- Cyber-Physical Systems in general, and Intelligent Transport Systems (ITS) in particular use heterogeneous data sources combined with problem solving expertise in order to make critical decisions that may lead to some form of actions e.g., driver notifications, change of traffic light signals and braking to prevent an accident. Currently, a major part of the decision process is done by human domain experts, which is time-consuming, tedious and error-prone. Additionally, due to the intrinsic nature of knowledge possession this decision process cannot be easily replicated or reused. Therefore, there is a need for automating the reasoning processes by providing computational systems a formal representation of the domain knowledge and a set of methods to process that knowledge. In this paper, we propose a knowledge model that can be used to express both declarative knowledge about the systems’ components, their relations and their current state, as well as procedural knowledge representing possible system behavior. In addition, we introduce a framework for knowledge management and automated reasoning (KMARF). The idea behind KMARF is to automatically select an appropriate problem solver based on formalized reasoning expertise in the knowledge base, and convert a problem definition to the corresponding format. This approach automates reasoning, thus reducing operational costs, and enables reusability of knowledge and methods across different domains. We illustrate the approach on a transportation planning use case.
|
|
