SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Mousavi Mohammad Reza 1978 ) "

Sökning: WFRF:(Mousavi Mohammad Reza 1978 )

  • Resultat 41-50 av 62
  • Föregående 1234[5]67Nästa
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
41.
  • Mohaqeqi, Morteza, et al. (författare)
  • Towards an Approximate Conformance Relation for Hybrid I/O Automata
  • 2016
  • Ingår i: ; , s. 53-64
  • Konferensbidrag (refereegranskat)abstract
    • Several notions of conformance have been proposed for checking the behavior of cyber-physical systems against their hybrid systems models. In this paper, we explore the initial idea of a notion of approximate conformance that allows for comparison of both observable discrete actions and (sampled) continuous trajectories. As such, this notion will consolidate two earlier notions, namely the notion of Hybrid Input-Output Conformance (HIOCO) by M. van Osch and the notion of Hybrid Conformance by H. Abbas and G.E. Fainekos. We prove that our proposed notion of conformance satisfies a semi-transitivity property, which makes it suitable for a step-wise proof of conformance or refinement.
  •  
42.
  • Mosses, Peter D., et al. (författare)
  • Robustness of Behavioral Equivalence on Open Terms
  • 2010
  • Rapport (övrigt vetenskapligt)abstract
    • 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.
  •  
43.
  •  
44.
  •  
45.
  • Mousavi, Mohammad Reza, 1978-, et al. (författare)
  • Modeling and Validating Globally Asynchronous Design in Synchronous Frameworks
  • 2004
  • Ingår i: Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’04), Volume 1. - Los Alamitos, CA : IEEE Computer Society. - 0769520855 ; , s. 384-389
  • Konferensbidrag (refereegranskat)abstract
    • We lay a foundation for modeling and validation of asynchronous designs in a multi-clock synchronous programming model. This allows us to study properties of globally asynchronous systems using synchronous simulation and model-checking toolkits. Our approach can be summarized as automatic transformation of a design consisting of two asynchronously composed synchronous components into a fully synchronous multi-clock model preserving behavioral equivalence. The ultimate goal of this research is to provide the ability to model and build GALS systems in a fully synchronous design framework and deploy it on an asynchronous network preserving all properties of the system proven in the synchronous framework.
  •  
46.
  •  
47.
  • Mousavi, Mohammad Reza, 1978-, et al. (författare)
  • Semantics and expressiveness of ordered SOS
  • 2007
  • Rapport (övrigt vetenskapligt)abstract
    • 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.
  •  
48.
  •  
49.
  •  
50.
  • Mousavi, Mohammad Reza, 1978-, et al. (författare)
  • Timed-Gamma and Its Coordination Language
  • 2015
  • Ingår i: Nordic Journal of Computing. - Helsinki : University of Helsinki. - 1236-6064. ; 15:2, s. 75-111
  • Tidskriftsartikel (refereegranskat)abstract
    • This paper proposes a theoretical framework for separation of concerns in the formal specification of reactive and real-time systems. This framework consists of the syntax and the semantics of three languages (and all meaningful combinations thereof) that each address a separate concern. The first language, Gamma (a variant of an existing language) is used to define the functionality of a system (by means of a set of basic data transformations). Our additions are a simple language of intervals specifying timing-properties of basic transformations and a language (called Schedules) for specifying the coordination of the basic Gamma transformations. Each of these languages formally models a separate aspect of a system and statements in these languages can be reused, changed or analyzed in their own right. Our key contribution is that we provide a formal framework in which different combinations of aspects have a well-defined semantics.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 41-50 av 62
  • Föregående 1234[5]67Nästa
Typ av publikation
konferensbidrag (29)
tidskriftsartikel (14)
rapport (8)
proceedings (redaktörskap) (4)
doktorsavhandling (2)
bokkapitel (2)
visa fler...
samlingsverk (redaktörskap) (1)
bok (1)
recension (1)
visa färre...
Typ av innehåll
refereegranskat (43)
övrigt vetenskapligt (19)
Författare/redaktör
Mousavi, Mohammad Re ... (61)
Reniers, Michel A. (8)
Beohar, Harsh, 1984- (7)
Varshosaz, Mahsa, 19 ... (7)
Aceto, Luca (6)
Ingólfsdóttir, Anna (5)
visa fler...
Mohaqeqi, Morteza (3)
Cimini, Matteo (3)
Taromirad, Masoumeh, ... (3)
Noroozi, Neda (3)
Goriac, Eugen-Ioan (2)
Reniers, Michael A. (2)
Dechesne, Francien (2)
Aerts, Arend (2)
Mostowski, Wojciech, ... (2)
Ali, Nauman Bin (2)
Carvalho, Gustavo (2)
Sampaio, Augusto (2)
Castellani, Ilaria (2)
Mosses, Peter D. (2)
Baier, Christel (1)
Birgisson, Arnar (1)
Aichernig, Bernhard ... (1)
Tappler, Martin (1)
Berger, Christian (1)
Bin Ali, Nauman (1)
Engström, Emelie (1)
Taromirad, Masoumeh (1)
Mousavi, Mohammad (1)
Minhas, Nasir Mehmoo ... (1)
Helgesson, Daniel (1)
Kunze, Sebastian (1)
Varshoaz, Mahsa (1)
Varshosaz, Mahsa (1)
Mousavi, Muhammad Ra ... (1)
Taha, Walid, 1972- (1)
Araujo, Hugo (1)
Arts, Thomas (1)
Khosravi, Ramtin (1)
Atif, Muhammad (1)
Cranen, Sjoerd (1)
Sirjani, Marjan (1)
Khamespanah, Ehsan (1)
Caltais, Georgiana (1)
Leue, Stefan (1)
Chaudron, Michel (1)
Churchill, Martin (1)
Gabbay, Murdoch J. (1)
Schaefer, Ina (1)
Costa Paiva, Sofia (1)
visa färre...
Lärosäte
Högskolan i Halmstad (61)
Uppsala universitet (2)
Lunds universitet (1)
Blekinge Tekniska Högskola (1)
Språk
Engelska (62)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (57)
Teknik (6)

År

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy