Andrzej Wąsowski

Andrzej Wąsowski

Auto-generated profile, based on publicly available information

Andrzej Wąsowski

IT University of Copenhagen, Copenhagen, Denmark

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 April 2023 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
RGRazan Ghzouli
Razan Ghzouli
TBThorsten Berger
Thorsten Berger
EJEinar Broch Johnsen
Einar Broch Johnsen
AWAndrzej Wasowski
Andrzej Wasowski
SDSwaib Dragule
Swaib Dragule
Autonomous robots combine skills to form increasingly complex behaviors, called missions. While skills are often programmed at a relatively low abstraction level, their coordination is architecturally separated and often expressed in higher-level languages or frameworks. State machines have been the go-to language to model behavior for decades, but recently, behavior trees have gained attention among roboticists. Originally designed to model autonomous actors in computer games, behavior trees offer an extensible tree-based representation of missions and are claimed to support modular design and code reuse. Although several implementations of behavior trees are in use, little is known about their usage and scope in the real world. How do concepts offered by behavior trees relate to traditional languages, such as state machines? How are concepts in behavior trees and state machines used in actual applications? This paper is a study of the key language concepts in behavior trees as realized in domain-specific languages (DSLs), internal and external DSLs offered as libraries, and their use in open-source robotic applications supported by the Robot Operating System (ROS). We analyze behavior-tree DSLs and compare them to the standard language for behavior models in robotics: state machines. We identify DSLs for both behavior-modeling languages, and we analyze five in-depth. We mine open-source repositories for robotic applications that use the analyzed DSLs and analyze their usage. We identify similarities between behavior trees and state machines in terms of language design and the concepts offered to accommodate the needs of the robotics domain. We observed that the usage of behavior-tree DSLs in open-source projects is increasing rapidly. We observed similar usage patterns at model structure and at code reuse in the behavior-tree and state-machine models within the mined open-source projects. We contribute all extracted models as a dataset, hoping to inspire the community to use and further develop behavior trees, associated tools, and analysis techniques.

13 December 2014 in Software and Systems Modeling
Verified
Journal Article
Closed access
PDF file
KBKacper Bąk
Kacper Bąk
ZDZinovy Diskin
Zinovy Diskin
MAMichał Antkiewicz
Michał Antkiewicz
KCKrzysztof Czarnecki
Krzysztof Czarnecki
AWAndrzej Wąsowski
Andrzej Wąsowski

5 May 2015 in Empirical Software Engineering
Verified
Journal Article
Closed access
PDF file
LPLeonardo Passos
Leonardo Passos
LTLeopoldo Teixeira
Leopoldo Teixeira
NDNicolas Dintzner
Nicolas Dintzner
SASven Apel
Sven Apel
AWAndrzej Wąsowski
Andrzej Wąsowski
JGJianmei Guo
Jianmei Guo

5 August 2011 in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
BCBenoît Caillaud
Benoît Caillaud
BDBenoît Delahaye
Benoît Delahaye
KLKim Guldstrand Larsen
Kim Guldstrand Larsen
ALAxel Legay
Axel Legay
MPMikkel L. Pedersen
Mikkel L. Pedersen
AWAndrzej Wąsowski
Andrzej Wąsowski
Notions of specification, implementation, satisfaction, and refinement, together with operators supporting stepwise design, constitute a specification theory. We construct such a theory for Markov Chains (MCs) employing a new abstraction of a Constraint MC. Constraint MCs permit rich constraints on probability distributions and thus generalize prior abstractions such as Interval MCs. Linear (polynomial) constraints suffice for closure under conjunction (respectively parallel composition). This is the first specification theory for MCs with such closure properties. We discuss its relation to simpler operators for known languages such as probabilistic process algebra. Despite the generality, all operators and relations are computable.

16 November 2021 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
AAAdam Alami
Adam Alami
RPRaul Pardo
Raul Pardo
MCMarisa Leavitt Cohn
Marisa Leavitt Cohn
AWAndrzej Wasowski
Andrzej Wasowski
Pull requests facilitate inclusion and improvement of contributions in distributed software projects, especially in open source communities. An author makes a pull request to present a contribution as a candidate for inclusion in a code base. The request is inspected by maintainers and reviewers. The initiated process of review and collaborative improvement can be loaded with debates, opinions, and emotions. It heavily influences the atmosphere in the community. It can demotivate and detract contributors or it can fail to guard the code quality. Both problems put the existence of a community at risk. This mixed methods study aims to elucidate the mechanisms of evaluating pull requests in diverse open source software communities from the perspectives of developers and maintainers. We interviewed 30 participants from five different communities and conducted a survey with N=387 respondents. The data shows that acceptance of contributions in open source depends not only on technical criteria, but also significantly on social and strategic aspects. As a result, we identify three governance styles for pull requests: (1) protective, (2) equitable, and (3) lenient. While the protective style values trustworthiness and reliability of the contributor, the lenient style believes in creating a positive and welcoming environment where contributors are mentored to evolve contributions until the community standards are met. Each of the governance styles safeguards the quality of the project code in different ways. We hope that this material will help researchers and community managers to obtain a more nuanced view on the peculiarities of different communities and the strengths and weakness of their pull requests evaluation process.

23 July 2018 in The Art, Science, and Engineering of Programming
Verified
Journal Article
Open access
PDF file
PJPaulius Juodisius
Paulius Juodisius
ASAtrisha Sarkar
Atrisha Sarkar
Raghava MukkamalaRaghava Mukkamala
Raghava Mukkamala
MAMichal Antkiewicz
Michal Antkiewicz
KCKrzysztof Czarnecki
Krzysztof Czarnecki
AWAndrzej Wasowski
Andrzej Wasowski
Embedded software is growing fast in size and complexity, leading to intimate mixture of complex architectures and complex control. Consequently, software speci cation requires modeling both structures and behaviour of systems. Unfortunately, existing languages do not integrate these aspects well, usually prioritizing one of them. It is common to develop a separate language for each of these facets In this paper, we contribute Clafer: a small language that attempts to tackle this challenge. It combines rich structural modeling with state of the art behavioural formalisms. We are not aware of any other modeling language that seamlessly combines these facets common to system and software modeling. We show how Clafer, in a single unified syntax and semantics, allows capturing feature models (variability), component models, discrete control models (automata) and variability encompassing all these aspects. The language is built on top of first order logic with quantifiers over basic entities (for modeling structures) combined with linear temporal logic (for modeling behaviour). On top of this semantic foundation we build a simple but expressive syntax, enriched with carefully selected syntactic expansions that cover hierarchical modeling, associations, automata, scenarios, and Dwyer’s property patterns. We evaluate Clafer using a power window case study, and comparing it against other notations that substantially overlap with its scope (SysML, AADL, Temporal OCL and Live Sequence Charts), discussing benefits and perils of using a single notation for the purpose.