hh.sePublikasjoner
Endre søk
Begrens søket
1 - 7 of 7
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    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 Elements2010Rapport (Annet vitenskapelig)
    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.

  • 2.
    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 Distributivity2010Rapport (Annet vitenskapelig)
    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.

  • 3.
    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 Elements2009Rapport (Annet vitenskapelig)
    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.

  • 4.
    Aerts, Arend
    et al.
    Control Systems Technology Group, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (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 Systems2015Inngår i: 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, s. 563-572Konferansepaper (Fagfellevurdert)
    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

  • 5.
    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 SOS2012Inngår i: Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII) / [ed] Ulrich Berger & Michael Mislove, Amsterdam: Elsevier, 2012, s. 103-116Konferansepaper (Fagfellevurdert)
    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.

  • 6.
    Mosses, Peter D.
    et al.
    Department of Computer Science, Swansea University, Swansea, United Kingdom.
    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.
    Robustness of Behavioral Equivalence on Open Terms2010Rapport (Annet vitenskapelig)
    Abstract [en]

    Sound behavioral equations on open terms may become unsound after conservative extensions of the underlying operational semantics. Providing criteria under which such equations are preserved is extremely useful; in particular, it can avoid the need to repeat proofs when extending the specified language. This paper investigates preservation of sound equations for several notions of bisimilarity on open terms: closed-instance (ci-)bisimilarity and formal-hypothesis (fh-)bisimilarity, both due to Robert de Simone, and hypothesis-preserving (hp-)bisimilarity, due to Arend Rensink. For both fh-bisimilarity and hp-bisimilarity, we prove that arbitrary sound equations on open terms are preserved by all disjoint extensions which do not add labels. We also define slight variations of fh- and hp-bisimilarity such that all sound equations are preserved by arbitrary disjoint extensions. Finally, we give two sets of syntactic criteria (on equations, resp. operational extensions) and prove each of them to be sufficient for preserving ci-bisimilarity.

  • 7.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Phillips, Iain C. C.
    Imperial College London, London, United Kingdom.
    Reniers, Michel A.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Ulidowski, Irek
    University of Leicester, University Road, Leicester, United Kingdom.
    Semantics and expressiveness of ordered SOS2007Rapport (Annet vitenskapelig)
    Abstract [en]

    Structured Operational Semantics (SOS) is a popular method for defining semantics by means of transition rules. An important feature of SOS rules is negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. However, the inclusion of negative premises in SOS rules also introduces doubts as to the preferred meaning of SOS specifications. Orderings on SOS rules were proposed by Phillips and Ulidowski as an alternative to negative premises. Apart from the definition of the semantics of positive GSOS rules with orderings, the meaning of more general types of SOS rules with orderings has not been studied hitherto. This paper presents several candidates for the meaning of general SOS rules with orderings and discusses their conformance to our intuition for such rules. We take two general frameworks (rule formats) for SOS with negative premises and SOS with orderings, and present semantics-preserving translations between them with respect to our preferred notion of semantics. Thanks to our semantics-preserving translation, we take existing congruence meta-results for strong bisimilarity from the setting of SOS with negative premises into the setting of SOS with orderings. We further compare the expressiveness of rule formats for SOS with orderings and SOS with negative premises. The paper contains also many examples that illustrate the benefits of SOS with orderings and the properties of the presented definitions of meaning.

1 - 7 of 7
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf