Change search
Refine search result
123 1 - 50 of 111
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.
    Aceto, L.
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Birgisson, A.
    Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingolfsdottir, A.
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, TU/Eindhoven, Eindhoven, Netherlands.
    Decompositional Reasoning about the History of Parallel Processes2011In: Fundamentals of software engineering: revised selected papers, Heidelberg: Springer Berlin/Heidelberg, 2011, Vol. 4171, p. 32-47Conference paper (Refereed)
    Abstract [en]

    This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning techniques for parallel contexts in that language. © 2012 Springer-Verlag.

  • 2.
    Aceto, L.
    et al.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Fokkink, W. J.
    Department of Computer Science, Vrije Universiteit Amsterdam, 1081 HV Amsterdam, Netherlands.
    Ingólfsdóttir, A.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2010In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 47, no 3, p. 147-177Article in journal (Refereed)
    Abstract [en]

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioural (pre)congruences over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational provability over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller's celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied. In particular, it is shown that prebisimilarity is not finitely based over CCS with the divergent process Ω, but that this result cannot be proved by a reduction to the non-finite axiomatizability of CCS modulo bisimilarity. This negative result is the inspiration for the development of a sharpened reduction method that is powerful enough to show that prebisimilarity is not finitely based over CCS with the divergent process Ω. © 2010 Springer-Verlag.

  • 3.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland.
    Birgisson, Arnar
    Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Determinism and Idempotence2012In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 77, p. 889-907Article in journal (Refereed)
    Abstract [en]

    Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotence is a property of binary composition operators requiring that the composition of two identical specifications or programs will result in a piece of specification or program that is equivalent to the original components. In this paper, we propose (related) meta-theorems for guaranteeing the determinism and idempotence of binary operators. These meta-theorems are formulated in terms of syntactic templates for operational semantics, called rule formats. In order to obtain a powerful rule format for idempotence, we make use of the determinism of certain transition relations in the definition of the format for idempotence. We show the applicability of our formats by applying them to various operational semantics from the literature. © 2010 Elsevier B.V. All rights reserved.

  • 4.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Birgisson, Arnar
    School of Computer Science, Reykjavik University, Iceland & Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingólfsdóttir, Anna
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, TU/Eindhoven, Eindhoven, Netherlands.
    Decompositional Reasoning about the History of Parallel Processes2010Report (Other academic)
    Abstract [en]

    Decompositional reasoning aims at automatically decomposing a global property of a composite system into local properties of (possibly unknown) components. In concurrency theory, decompositional reasoning techniques date back to the seminal work of Larsen and Liu in the late 1980s and early 1990s. However, we are not aware of any such decomposition technique that applies to reasoning about the "past". In this paper, we address this problem and present a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. As a language for processes, we use a subset of Milner's CCS with parallel composition, non-deterministic choice, action prefixing and the inaction constant. We focus on developing decompositional reasoning techniques for parallel contexts in that language.

  • 5.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Distributivity2012In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 458, p. 1-28Article in journal (Refereed)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. Some conditions ensuring the invalidity of the left-distributivity law are also offered. © 2012 Elsevier B.V. All rights reserved.

  • 6.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    SOS Rule Formats for Zero and Unit Elements2011In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 412, no 28, p. 3045-3071Article in journal (Refereed)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain constants act as left or right unit/zero elements for a set of binary operators. Examples of left and right zero, as well as unit, elements from the literature are shown to fit the rule formats offered in this study. © 2011 Elsevier B.V. All rights reserved.

  • 7.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michael A.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    On Rule Formats for Zero and Unit Elements2010Report (Other academic)
    Abstract [en]

    This paper proposes a rule format for Structural Operational Semantics guaranteeing that certain constants act as left or right zero elements for a set of binary operators. Our design approach is also applied to reformulate an earlier rule format for unit elements developed by some of the authors. Examples of left and right zero, as well as unit, elements from the literature are shown to be checkable using the provided formats.

  • 8.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michael A.
    Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Rule Formats for Distributivity2010Report (Other academic)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats.

  • 9.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Cimini, Matteo
    School of Computer Science, Reykjavik University, Iceland.
    Ingólfsdóttir, Anna
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Distributivity2011In: Language and Automata Theory and Applications: 5th International Conference : Proceedings / [ed] Adrian Horia Dediu, Heidelberg: Springer Berlin/Heidelberg, 2011, Vol. 6638, p. 79-90Conference paper (Refereed)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. © 2011 Springer-Verlag.

  • 10.
    Aceto, Luca
    et al.
    Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Fokkink, Wan
    Vrije Universiteit Amsterdam, NL-1081HV, The Netherlands.
    Ingólfsdóttir, Anna
    Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, NL-5600MB Eindhoven, The Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2008In: Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008 / [ed] Ausiello, G, Karhumaki, J, Mauri, G, Ong, L, New York: Springer-Verlag New York, 2008, Vol. 273, p. 301-316Conference paper (Refereed)
    Abstract [en]

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.

  • 11.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Fokkink, Wan J.
    Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2008Report (Other academic)
  • 12.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Goriac, Eugen-Ioan
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Exploiting Algebraic Laws to Improve Mechanized Axiomatizations2013In: Algebra and Coalgebra in Computer Science: 5th International Conference, Calco 2013, Warsaw, Poland, September 2013, Proceedings, Berlin: Springer Berlin/Heidelberg, 2013, p. 36-50Conference paper (Refereed)
    Abstract [en]

    In the field of structural operational semantics (SOS), there have been several proposals both for syntactic rule formats guaranteeing the validity of algebraic laws, and for algorithms for automatically generating ground-complete axiomatizations. However, there has been no synergy between these two types of results. This paper takes the first steps in marrying these two areas of research in the meta-theory of SOS and shows that taking algebraic laws into account in the mechanical generation of axiomatizations results in simpler axiomatizations. The proposed theory is applied to a paradigmatic example from the literature, showing that, in this case, the generated axiomatization coincides with a classic hand-crafted one. © 2013 Springer-Verlag Berlin Heidelberg.

  • 13.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Ingólfsdóttir, A.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands.
    Reniers, M. A.
    Algebraic properties for free!2009In: Bulletin of the European Association for Theoretical Computer Science, ISSN 0252-9742, Vol. 99, p. 81-103Article in journal (Refereed)
    Abstract [en]

    Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational semantics.

  • 14.
    Aceto, Luca
    et al.
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Ingólfsdóttir, Anna
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Impossibility results for the equational theory of timed CCS2007In: Algebra and Coalgebra in Computer Science: Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007. Proceedings, Berlin: Springer Berlin/Heidelberg, 2007, Vol. 4624, p. 80-95Conference paper (Refereed)
    Abstract [en]

    We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR'90. Common to Wang Yi's paper, we particularly focus on a class of linearly-ordered time domains exemplified by the positive real or rational numbers. We show that, even when the set of basic actions is a singleton, there are parallel Timed CCS processes that do not have any sequential equivalent and thus improve on the Gap Theorem for Timed CCS presented by Godskesen and Larsen in FSTTCS'92. Furthermore, we show that timed bisimilarity is not finitely based both for single-sorted and two-sorted presentations of Timed CCS. We further strengthen this result by showing that, unlike in some other process algebras, adding the untimed or the timed left-merge operator to the syntax and semantics of Timed CCS does not solve the axiomatizability problem.

  • 15.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    A Rule Format for Unit Elements2009Report (Other academic)
    Abstract [en]

    This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.

  • 16.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University Kringlan 1, IS-103 Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University Kringlan 1, IS-103 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Ei ndhoven, The Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Ei ndhoven, The Netherlands.
    A rule format for unit elements2010In: SOFSEM 2010: Theory and Practice of Computer Science: Proceedings / [ed] VanLeeuwen, J, Muscholl, A, Peleg, D, Pokorny, J, Rumpe, B, Berlin: Springer Berlin/Heidelberg, 2010, Vol. 5901, p. 141-152Conference paper (Refereed)
    Abstract [en]

    This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.

  • 17.
    Aceto, Luca
    et al.
    Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad RezaEindhoven University of Technology, Eindhoven, The Netherlands.
    Proceedings First International Workshop on Process Algebra and Coordination2011Conference proceedings (editor) (Other academic)
    Abstract [en]

    Process algebra provides abstract and rigorous means for studying communicating concurrent systems. Coordination languages also provide abstract means for the specifying and programming communication of components. Hence, the two fields seem to have very much in common and the link between these two research areas have been established formally by means of several translations, mainly from coordination languages to process algebras. There have also been proposals of process algebras whose communication policy is inspired by the one underlying coordination languages. The aim of this workshop was to push the state of the art in the study of the connections between process algebra and coordination languages by bringing together experts as well as young researchers from the two fields to communicate their ideas and findings. It includes both contributed and invited papers that have been presented during the one day meeting on Process Algebra and Coordination (PACO 2011) which took place on June 9, 2011 in Reykjavik, Iceland.

  • 18.
    Aerts, Arend
    et al.
    Control Systems Technology Group, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Reniers, Michel A.
    Control Systems Technology Group, Eindhoven University of Technology, Eindhoven, The Netherlands.
    A Tool Prototype for Model-Based Testing of Cyber-Physical Systems2015In: Theoretical Aspects of Computing – ICTAC 2015: 12th International Colloquium Cali, Colombia, October 29–31, 2015, Proceedings / [ed] Martin Leucker, Camilo Rueda, and Frank D. Valencia, Cham: Springer, 2015, Vol. 9399, p. 563-572Conference paper (Refereed)
    Abstract [en]

    We report on a tool prototype for model-based testing of cyber-physical systems. Our starting point is a hybrid-system model specified in a domain-specific language called Acumen. Our prototype tool is implemented in Matlab and covers three stages of model-based testing, namely, test-case generation, test-case execution, and conformance analysis. We have applied our implementation to a number of typical examples of cyber-physical systems in order to analyze its applicability. In this paper, we report on the result of applying the prototype tool on a DC-DC boost converter. © Springer International Publishing Switzerland 2015

  • 19.
    Aerts, Arend
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Model-Based Testing of Cyber-Physical Systems2016In: Cyber-Physical Systems: Foundations, Principles and Applications / [ed] H. Song, D.B. Rawat, S. Jeschke, and Ch. Brecher, Saint Louis: Elsevier, 2016, p. 287-304Chapter in book (Refereed)
    Abstract [en]

    Cyber-physical systems (CPSs) are the result of the integration of connected computer systems with the physical world. They feature complex interactions that go beyond traditional communication schemes and protocols in computer systems. One distinguished feature of such complex interactions is the tight coupling between discrete and continuous interactions, captured by hybrid system models.

    Due to the complexity of CPSs, providing rigorous and model-based analysis methods and tools for verifying correctness of such systems is of the utmost importance. Model-based testing (MBT) is one such verification technique that can be used for checking the conformance of an implementation of a system to its specification (model).

    In this chapter, we first review the main concepts and techniques in MBT. Subsequently, we review the most common modeling formalisms for CPSs, with focus on hybrid system models. Subsequently, we provide a brief overview of conformance relations and conformance testing techniques for CPSs. © 2017 Elsevier Inc. All rights reserved.

  • 20.
    Aichernig, Bernhard K.
    et al.
    Graz University of Technology, Graz, Austria.
    Mostowski, Wojciech
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES). Department of Informatics, University of Leicester, Leicester, UK.
    Tappler, Martin
    Graz University of Technology, Graz, Austria.
    Taromirad, Masoumeh
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS).
    Model Learning and Model-Based Testing2018In: Machine Learning for Dynamic Software Analysis: Potentials and Limits / [ed] Amel Bennaceur, Reiner Hähnle, Karl Meinke, Heidelberg: Springer, 2018, p. 74-100Conference paper (Refereed)
    Abstract [en]

    We present a survey of the recent research efforts in integrating model learning with model-based testing. We distinguished two strands of work in this domain, namely test-based learning (also called test-based modeling) and learning-based testing. We classify the results in terms of their underlying models, their test purpose and techniques, and their target domains. © Springer International Publishing AG

  • 21.
    Araujo, Hugo
    et al.
    Universidade Federal de Pernambuco, Recife, PE, Brazil.
    Carvalho, Gustavo
    Universidade Federal de Pernambuco, Recife, PE, Brazil.
    Mohaqeqi, Morteza
    Uppsala University, Uppsala, Sweden.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES). University of Leicester, Leicester, UK.
    Sampaio, Augusto
    Universidade Federal de Pernambuco, Recife, PE, Brazil.
    Sound conformance testing for cyber-physical systems: Theory and implementation2017In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 162, p. 35-54Article in journal (Refereed)
    Abstract [en]

    Conformance testing is a formal and structured approach to verifying system correctness. We propose a conformance testing algorithm for cyber-physical systems, based on the notion of hybrid conformance by Abbas and Fainekos. We show how the dynamics of system specification and the sampling rate play an essential role in making sound verdicts. We specify and prove error bounds that lead to sound test-suites for a given specification and a given sampling rate. We use reachability analysis to find such bounds and implement the proposed approach using the CORA toolbox in Matlab. We apply the implemented approach on a case study from the automotive domain. © 2017 The Author(s).

  • 22.
    Araujo, Hugo
    et al.
    Universidade Federal de Pernambuco, Recife, PE, Brazil.
    Carvalho, Gustavo
    Universidade Federal de Pernambuco, Recife, PE, Brazil.
    Sampaio, Augusto
    Universidade Federal de Pernambuco, Recife, PE, Brazil.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Taromirad, Masoumeh
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS).
    A Process for Sound Conformance Testing of Cyber-Physical Systems2017In: 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) / [ed] Randall Bilof, Los Alamitos, CA: IEEE Computer Society, 2017, p. 46-50, article id 7899032Conference paper (Refereed)
    Abstract [en]

    We present a process for sound conformance testing of cyber-physical systems, which involves functional but also non-functional aspects. The process starts with a hybrid model of cyber-physical systems in which the correct behavior of the system (at its interface level) is specified. Such a model captures both discrete behavior and evolution of continuous dynamics of the system in time. Since conformance testing inherently involves comparing continuous dynamics, the key parameters of the process are (1) the conformance bounds defining when two signals are sufficiently close to each other, and (2) the permitted error margin in the conformance analysis introduced by sampling of continuous signals. The final parameter of this process is (3) finding (and adjusting) the sampling rate of the dynamic behavior. In the specified process, we provide different alternatives for fixing the error margin of the conformance testing if the sampling rate is fixed, establishing the sampling rate if the error margin is fixed and finding conformance bounds once the sampling rate and the error margin are fixed. © 2017 IEEE.

  • 23.
    Arts, Thomas
    et al.
    Quviq AB, Gothenburg, Sweden.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Automatic Consequence Analysis of Automotive Standards (AUTO-CAAS) [Position Paper]2015In: WASA '15: Proceedings of the First International Workshop on Automotive Software Architecture / [ed] Yanja Dajsuren, Harald Altinger & Miroslaw Staron, New York, NY: ACM Press, 2015, p. 35-38Conference paper (Refereed)
    Abstract [en]

    This paper provides some background and the roadmap of the AUTO-CAAS project, which is a 3-year project financed by the Swedish Knowledge Foundation and is ongoing as a joint project among three academic and industrial partners. The aim of the project is to exploit the formal models of the AUTOSAR standard, developed by the industrial partner of the project Quviq AB, in order to predict possible future failures in concrete implementations of components. To this end, the deviations from the formal specification will be exploited to generate test-cases that can push concrete components to the corners where such deviation will result in observable failures. The same information will also be used in the diagnosis of otherwise detected failures in order to pinpoint their root causes.

  • 24.
    Asadi, Hamid Reza
    et al.
    Department of ECE, University of Tehran, Tehran, Iran.
    Khosravi, Ramtin
    Department of ECE, University of Tehran, Tehran, Iran.
    Mousavi, Mohammad Reza
    Department of CS, TU/Eindhoven, Eindhoven, The Netherlands.
    Noroozi, Neda
    Department of CS, TU/Eindhoven, Eindhoven, The Netherlands.
    Towards Model-Based Testing of Electronic Funds Transfer Systems2011In: Proceedings of the 4th International on Fundamentals of Software Engineering (FSEN 2011) / [ed] Farhad Arbab & Marjan Sirjani, Heidelberg: Springer, 2011, Vol. 4171, p. 253-267Conference paper (Refereed)
  • 25.
    Atif, Muhammad
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Cranen, Sjoerd
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reconstruction and verification of group membership protocols2010Report (Other academic)
    Abstract [en]

    In this paper, we present a process-algebraic specication of group membership protocols specified in [Y. Amir, D. Dolev, S. Kramer and D. Malki, Membership Algorithms for Multicast Communication Groups, Springer-Verlag, 1992]. In order to formalise the protocol and its properties we disambiguate the informal specification provided by the paper. This requires trying different possible interpretations in the formal model and checking the consistency of the assumption and formally verifying the correctness properties. We thus present a formal reconstruction of the membership algorithms and model-check our reconstruction.

  • 26.
    Atif, Muhammad
    et al.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Formal specification and analysis of accelerated heartbeat protocols2009Report (Other academic)
  • 27.
    Atif, Muhammad
    et al.
    Eindhoven University of Technology, Department of Computer Science, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Department of Computer Science, Eindhoven, The Netherlands.
    Osaiweran, Ammar
    Eindhoven University of Technology, Department of Computer Science, Eindhoven, The Netherlands.
    Formal Verification of Unreliable Failure Detectors in Partially Synchronous Systems2012In: SAC '12 Proceedings of the 27th ACM Symposium on Applied Computing, New York, NY: ACM Press, 2012, p. 478-485Conference paper (Refereed)
  • 28.
    Beohar, Harsh
    et al.
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    A Pre-congruence Format for XY-simulation2015In: Fundamentals of Software Engineering: 6th International Conference, FSEN 2015 Tehran, Iran, April 22–24, 2015, Revised Selected Papers / [ed] Mehdi Dastani & Marjan Sirjani, Cham: Springer, 2015, Vol. 9392, p. 215-229Conference paper (Refereed)
    Abstract [en]

    XY-simulation is a generalization of bisimulation that is parameterized with two subsets of actions. XY-simulation is known in the literature under different names such as modal refinement, partial bisimulation, and alternating simulation. In this paper, we propose a precongruence rule format for XY-simulation. The format allows for checking compositionality of XY-simulation for an arbitrary language with structural operational semantics, by performing very simple checks on the syntactic shape of the rules. We apply our format to derive concrete compositionality results for different notions of behavioral pre-order with respect to different process calculi in the literature. © IFIP International Federation for Information Processing 2015

  • 29.
    Beohar, Harsh
    et al.
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Input-output conformance testing based on featured transition systems2014In: Proceedings of the 29th Annual ACM Symposium on Applied Computing, Association for Computing Machinery (ACM), 2014, p. 1272-1278Conference paper (Refereed)
    Abstract [en]

    We extend the theory of input-output conformance testing to the setting of software product lines. In particular, we allow for input-output featured transition systems to be used as the basis for generating test suites and test cases. We introduce refinement operators both at the level of models and at the level of test suites that allow for projecting them into a specific product configuration (or a product sub-line). We show that the two sorts of refinement are consistent and lead to the same set of test-cases. © Copyright 2014 ACM

  • 30.
    Beohar, Harsh
    et al.
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Input–output conformance testing for software product lines2016In: The Journal of logical and algebraic methods in programming, ISSN 2352-2208, E-ISSN 2352-2216, Vol. 85, no 6, p. 1131-1153Article in journal (Refereed)
    Abstract [en]

    We extend the theory of input-output conformance (IOCO) testing to accommodate behavioral models of software product lines (SPLs). We present the notions of residual and spinal testing. These notions allow for structuring the test process for SPLs by taking variability into account and extracting separate test suites for common and specific features of an SPL. The introduced notions of residual and spinal test suites allow for focusing on the newly introduced behavior and avoiding unnecessary re-test of the old one. Residual test suites are very conservative in that they require retesting the old behavior that can reach to new behavior. However, spinal test suites more aggressively prune the old tests and only focus on those test sequences that are necessary in reaching the new behavior. We show that residual testing is complete but does not usually lead to much reduction in the test-suite. In contrast, spinal testing is not necessarily complete but does reduce the test-suite. We give sufficient conditions on the implementation to guarantee completeness of spinal testing. Finally, we specify and analyze an example regarding the Ceiling Speed Monitoring Function from the European Train Control System. (C) 2016 The Author(s). Published by Elsevier Inc.

  • 31.
    Beohar, Harsh
    et al.
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Spinal test suites for software product lines2014In: Proceedings: Ninth Workshop on Model-Based Testing (MBT 2014) / [ed] Alexander K. Petrenko, Holger Schlingloff, Sydney: Open Publishing Association , 2014, Vol. 141, p. 44-55Conference paper (Refereed)
    Abstract [en]

    A major challenge in testing software product lines is efficiency. In particular, testing a product line should take less effort than testing each and every product individually. We address this issue in the context of input-output conformance testing, which is a formal theory of model-based testing. We extend the notion of conformance testing on input-output featured transition systems with the novel concept of spinal test suites. We show how this concept dispenses with retesting the common behavior among different, but similar, products of a software product line. © H. Beohar & M.R. Mousavi.

  • 32.
    Beohar, Harsh
    et al.
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Varshosaz, Mahsa
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Basic behavioral models for software product lines: Expressiveness and testing pre-orders2016In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 123, p. 42-60Article in journal (Refereed)
    Abstract [en]

    In order to provide a rigorous foundation for Software Product Lines (SPLs), several fundamental approaches have been proposed to their formal behavioral modeling. In this paper, we provide a structured overview of those formalisms based on labeled transition systems and compare their expressiveness in terms of the set of products they can specify. Moreover, we define the notion of tests for each of these formalisms and show that our notions of testing precisely capture product derivation, i.e., all valid products will pass the set of test cases of the product line and each invalid product fails at least one test case of the product line. © 2015 The Authors.

  • 33.
    Berger, Christian
    et al.
    University of Gothenburg, Gothenburg, Sweden.
    Mousavi, Mohammad RezaHalmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Cyber Physical Systems. Design, Modeling, and Evaluation: 5th International Workshop, CyPhy 2015, Amsterdam, The Netherlands, October 8, 2015, Proceedings2015Collection (editor) (Refereed)
  • 34.
    Caltais, Georgiana
    et al.
    University of Konstanz, Konstanz, Germany.
    Leue, Stefan
    University of Konstanz, Konstanz, Germany.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    (De-)Composing Causality in Labeled Transition Systems2016In: 1st Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies (CREST’16) / [ed] Gregor Gössler & Oleg Sokolsky, Open Publishing Association , 2016, Vol. 224, p. 10-24Conference paper (Refereed)
    Abstract [en]

    In this paper we introduce a notion of counterfactual causality in the Halpern and Pearl sense that is compositional with respect to the interleaving of transition systems. The formal framework for reasoning on what caused the violation of a safety property is established in the context of labeled transition systems and Hennessy Milner logic. The compositionality results are devised for non-communicating systems.

  • 35.
    Castellani, Ilaria
    et al.
    INRIA Sophia Antipolis Méditerranée, Valbonne, France.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Preface: Special issue on Trends in Concurrency Theory (selected invited contributions from the workshops TRENDS 2014 and 2015)2017In: The Journal of logical and algebraic methods in programming, ISSN 2352-2208, E-ISSN 2352-2216, Vol. 87, p. 93-93Article in journal (Other academic)
  • 36.
    Castellani, Ilaria
    et al.
    INRIA Sophia Antipolis Mediterranee, Biot, France.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Special issue on Trends in Concurrency Theory (selected invited contributions from the workshops TRENDS 2014 and 2015) Preface2017In: The Journal of logical and algebraic methods in programming, ISSN 2352-2208, E-ISSN 2352-2216, Vol. 87, p. 93-93Article in journal (Other academic)
  • 37.
    Churchill, Martin
    et al.
    Swansea University, Swansea, Wales, United Kingdom.
    Mosses, Peter D.
    Swansea University, Swansea, Wales, United Kingdom.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES). Eindhoven University of Technology, Eindhoven, The Netherlands.
    Modular Semantics for Transition System Specifications with Negative Premises2013In: Proceedings of the 24th International Conference on Concurrency Theory / [ed] Pedro R. D'Argenio & Hernán Melgratti, Heidelberg: Springer Berlin/Heidelberg, 2013, p. 46-60Conference paper (Refereed)
    Abstract [en]

    Transition rules with negative premises are needed in the structural operational semantics of programming and specification constructs such as priority and interrupt, as well as in timed extensions of specification languages. The well-known proof-theoretic semantics for transition system specifications involving such rules is based on well-supported proofs for closed transitions. Dealing with open formulae by considering all closed instances is inherently non-modular - proofs are not necessarily preserved by disjoint extensions of the transition system specification. Here, we conservatively extend the notion of well-supported proof to open transition rules. We prove that the resulting semantics is modular, consistent, and closed under instantiation. Our results provide the foundations for modular notions of bisimulation such that equivalence can be proved with reference only to the relevant rules, without appealing to all existing closed instantiations of terms. © 2013 Springer-Verlag.

  • 38.
    Cimini, Matteo
    et al.
    Department of Computer Science, Reykjavík University, Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Gabbay, Murdoch J.
    Computer Science Department, Heriot-Watt University, Edinburgh, United Kingdom.
    Nominal SOS2012In: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII) / [ed] Ulrich Berger & Michael Mislove, Amsterdam: Elsevier, 2012, p. 103-116Conference paper (Refereed)
    Abstract [en]

    Plotkin’s style of Structural Operational Semantics (SOS) has become a de facto standard in giving operational semantics to formalisms and process calculi. In many such formalisms and calculi, the concepts of names, variables and binders are essential ingredients. In this paper, we propose a formal framework for dealing with names in SOS. The framework is based on the Nominal Logic of Gabbay and Pitts and hence is called Nominal SOS. We define nominal bisimilarity, an adaptation of the notion of bisimilarity that is aware of binding. We provide evidence of the expressiveness of the framework by formulating the early π-calculus and Abramsky’s lazy λ-calculus within Nominal SOS. For both calculi we establish the operational correspondence with the original calculi. Moreover, in the context of the π-calculus, we prove that nominal bisimilarity coincides with Sangiorgi’s open bisimilarity and in the context of the λ-calculus we prove that nominal bisimilarity coincides with Abramsky’s applicative bisimilarity. © 2012 Elsevier B.V.

  • 39.
    Costa Paiva, Sofia
    et al.
    University of Sao Paolo, São Carlos, Brazil.
    Simao, Adenilso
    University of Sao Paolo, São Carlos, Brazil.
    Varshosaz, Mahsa
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Complete IOCO Test Cases: A Case Study2016In: A-TEST 2016 - Proceedings of the 7th International Workshop on Automating Test Case Design, Selection, and Evaluation, co-located with FSE 2016, New York, NY: ACM Press, 2016, p. 38-44Conference paper (Refereed)
    Abstract [en]

    Input/Output Transition Systems (IOTSs) have been widely used as test models in model-based testing. Traditionally, input output conformance testing (IOCO) has been used to generate random test cases from IOTSs. A recent test case generation method for IOTSs, called Complete IOCO, applies fault models to obtain complete test suites with guaranteed fault coverage for IOTSs. This paper measures the efficiency of Complete IOCO in comparison with the traditional IOCO test case generation implemented in the JTorX tool. To this end, we use a case study involving five specification models from the automotive and the railway domains. Faulty mutations of the specifications were produced in order to compare the efficiency of both test generation methods in killing them. The results indicate that Complete IOCO is more efficient in detecting deep faults in large state spaces while IOCO is more efficient in detecting shallow faults in small state spaces. © 2016 ACM.

  • 40.
    Cranen, Sjoerd
    et al.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    A rule format for associativity2008In: CONCUR 2008 - Concurrency Theory: 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings, Berlin: Springer Berlin/Heidelberg, 2008, Vol. 5201, p. 447-461Conference paper (Refereed)
    Abstract [en]

    We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek's spectrum. The initial format is a subset of the De Simone format. We show that all trivial generalizations of our format are bound for failure. We further extend the format in a few directions and illustrate its application to several formalisms in the literature. A subset of the format is studied to obtain associativity with respect to graph isomorphism.

  • 41.
    Dechesne, Francien
    et al.
    Philosophy Section, Faculty of Technology, Policy and Management, Delft University of Technology, Delft, The Netherlands.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Interpreted Systems Semantics for Process Algebra with Identity Annotations2013In: Logic, Language, and Computation: 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011, Revised Selected Papers / [ed] Guram Bezhanishvili, Sebastian Löbner, Vincenzo Marra & Frank Richter, Heidelberg: Springer Berlin/Heidelberg, 2013, Vol. 7758, p. 182-205Chapter in book (Refereed)
    Abstract [en]

    Process algebras have been developed as formalisms for specifying the behavioral aspects of protocols. Interpreted systems have been proposed as a semantic model for multi-agent communication. In this paper, we connect these two formalisms by defining an interpreted systems semantics for a generic process algebraic formalism. This allows us to translate and compare the vast body of knowledge and results for each of the two formalisms to the other and perform epistemic reasoning, e.g., using model-checking tools for interpreted systems, on process algebraic specifications. Based on our translation we formulate and prove some results about the interpreted systems generated by process algebraic specifications. © 2013 Springer-Verlag.

  • 42.
    Dechesne, Francien
    et al.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600MB, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600MB, Eindhoven, The Netherlands.
    Orzan, Simona
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600MB, Eindhoven, The Netherlands.
    Operational and epistemic approaches to protocol analysis: bridging the gap2007In: Logic for Programming, Artificial Intelligence, and Reasoning: 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007. Proceedings, Berlin: Springer Berlin/Heidelberg, 2007, Vol. 4790, p. 226-241Conference paper (Refereed)
    Abstract [en]

    Operational models of protocols, on one hand, are readable and conveniently match their implementation, at a certain abstraction level. Epistemic models, on the other hand, are appropriate for specifying knowledge-related properties such as anonymity. These two approaches to specification and analysis have so far developed in parallel and one has either to define ad hoc correctness criteria for the operational model or use complicated epistemic models to specify the operational behavior. We work towards bridging this gap by proposing a combined framework which allows modeling the behavior of a protocol in a process language with an operational semantics and supports reasoning about properties expressed in a rich logic with temporal and epistemic operators.

  • 43.
    Dechesne, Francien
    et al.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands & Department of Computer Science, Reykjavík University, Reykjavík, Iceland.
    Orzan, Simona M.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap2007Report (Other academic)
    Abstract [en]

    Operational models of (security) protocols, on one hand, are readable and conveniently match their implementation (at a certain abstraction level). Epistemic models, on the other hand, are appropriate for specifying knowledge-related properties such as anonymity or secrecy. These two approaches to specification and verification have so far developed in parallel and one has either to define ad hoc correctness criteria for the operational model or use complicated epistemic models to specify the operational behavior. We work towards bridging this gap by proposing a combined framework which allows for modeling the behavior of a protocol in a process language with an operational semantics and supports reasoning about properties expressed in a rich logic which combines temporal and epistemic operators.

  • 44.
    Fragal, Vanderson Hafemann
    et al.
    University of Sao Paulo, Sao Carlos, Brazil.
    Simao, Adenilso
    University of Sao Paulo, Sao Carlos, Brazil.
    Endo, Andre Takeshi
    Federal University of Paraná, Curitiba, Paraná, Brazil.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Reducing the Concretization Effort in FSM-Based Testing of Software Product Lines2017In: 10th IEEE International Conference on Software Testing, Verification and Validation Workshops - ICSTW 2017 / [ed] Randall Bilof, Los Alamitos, CA: IEEE , 2017, p. 329-336Conference paper (Refereed)
    Abstract [en]

    To test a Software Product Line (SPL), the test artifacts and the techniques must be extended to support variability. In general, when new SPL products are developed, more tests are generated to cover new or modified features. A dominant source of extra effort for such tests is the concretization of newly generated tests. Thus, minimizing the amount of new non-concretized tests required to perform conformance testing on new products reduces the overall test effort. In this paper, we propose a test reuse strategy for conformance testing of SPL products that aims at reducing test effort. We use incremental test generation methods based on finite state machines (FSMs) to maximize test reuse. We combine these methods with a selection algorithm used to identify non-redundant concretized tests. We illustrate our strategy using examples and a case study with an embedded mobile SPL. The results indicate that our strategy can save up to 36% of test effort in comparison to current test reuse strategies for the same fault detection capability. © 2017 IEEE.

  • 45.
    Fragal, Vanderson Hafemann
    et al.
    University of São Paolo, São Carlos, Brazil.
    Simao, Adenilso
    University of São Paolo, São Carlos, Brazil.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Validated Test Models for Software Product Lines: Featured Finite State Machines2016In: Formal Aspects of Component Software: 13th International Conference, FACS 2016, Besançon, France, October 19-21, 2016, Revised Selected Papers / [ed] Kouchnarenko, Olga & Khosravi, Ramtin, Cham: Springer, 2016, Vol. 10231, p. 210-227Conference paper (Refereed)
    Abstract [en]

    Variants of the finite state machine (FSM) model have been extensively used to describe the behaviour of reactive systems. In particular, several model-based testing techniques have been developed to support test case generation and test case executions from FSMs. Most such techniques require several validation properties to hold for the underlying test models. In this paper, we propose an extension of the FSM test model for software product lines (SPLs), named featured finite state machine (FFSM). As the first step towards using FFSMs as test models, we define feature-oriented variants of basic test model validation criteria. We show how the high-level validation properties coincide with the necessary properties on the product FSMs. Moreover, we provide a mechanised tool prototype for checking the feature-oriented properties using satisfiability modulo theory (SMT) solver tools. We investigate the applicability of our approach by applying it to both randomly generated FFSMs as well as those from a realistic case study (the Body Comfort System). The results of our study show that for random FFSMs over 16 independent non-mandatory features, our technique provides substantial efficiency gains for the set of proposed validity checks. © Springer International Publishing AG 2017

  • 46.
    Gebler, Daniel
    et al.
    Vrije Universiteit, Amsterdam, The Netherlands.
    Goriac, Eugen-Ioan
    Reykjavik University, Reyjkjavik, Iceland.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Algebraic Meta-Theory of Processes with Data2013In: Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics / [ed] Johannes Borgström & Bas Luttik, Open Publishing Association , 2013, p. 63-77Conference paper (Refereed)
    Abstract [en]

    There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations characterizing strong bisimilarity of processes. To our knowledge, this literature has never been extended to the setting with data (e.g. to model storage and memory). We show how the rule formats for algebraic properties can be exploited in a genericmanner in the setting with data. Moreover, we introduce a new approach for deriving sound and ground-complete axiom schemata for a notion of bisimilarity with data, called stateless bisimilarity, based on intuitive auxiliary function symbols for handling the store component. We do restrict, however, the axiomatization to the setting where the store component is only given in terms of constants. © Gebler, Goriac & Mousavi.

  • 47.
    Ghamarian, A. H.
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Geilen, M. C. W.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Stuijk, S.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Basten, T.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Moonen, A. J. M.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Bekooij, M. J. G.
    2Philips Research Laboratories Eindhoven, Eindhoven, The Netherlands.
    Theelen, B. D.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Throughput analysis of synchronous data flow graphs2006In: Proceedings: Sixth International Conference on Application of Concurrency to System Design (ACSD 2006) / [ed] Kees Goossens & Laure Petrucci, Washington, DC: IEEE Computer Society, 2006, p. 25-36Conference paper (Refereed)
  • 48.
    Ghassemi, Fatemeh
    et al.
    University of Tehran, Tehran, Iran.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Product Line Process Theory2016In: The Journal of logical and algebraic methods in programming, ISSN 2352-2208, E-ISSN 2352-2216, Vol. 85, no 1, part 2, p. 200-226Article in journal (Refereed)
    Abstract [en]

    Software product lines (SPLs) facilitate reuse and customization in software development by genuinely addressing the concept of variability. Product Line Calculus of Communicating Systems (PL-CCS) is a process calculus for behavioral modeling of SPLs, in which variability can be explicitly modeled by a binary variant operator. In this paper, we study different notions of behavioral equivalence for PL-CCS, based on Park and Milner's strong bisimilarity. These notions enable reasoning about the behavior of SPLs at different levels of abstraction. We study the compositionality property of these notions and the mutual relationship among them. We further show how the strengths of these notions can be consolidated in an equational reasoning method. Finally, we designate the notions of behavioral equivalence that are characterized by the property specification language for PL-CCS, called multi-valued modal μ-calculus. © 2015 The Authors. Published by Elsevier Inc.

  • 49.
    Groote, Jan Friso
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Book Announcement: Modeling and Analysis of Communicating Systems2014In: Bulletin of the European Association for Theoretical Computer Science, ISSN 0252-9742, no 114Article, book review (Other academic)
  • 50.
    Groote, Jan Friso
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
    Modeling and Analysis of Communicating Systems2014Book (Refereed)
123 1 - 50 of 111
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