hh.sePublikasjoner
Endre søk
Begrens søket
123 51 - 100 of 115
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • 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.
  • 51.
    Groote, Jan Friso
    et al.
    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).
    Modeling and Analysis of Communicating Systems2014Bok (Fagfellevurdert)
  • 52.
    Hajiaghayi, Mohammad Taghi
    et al.
    University of Maryland, College Park, MD, USA.
    Mousavi, Mohammad RezaHögskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Topics in Theoretical Computer Science: The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers2016Konferanseproceedings (Fagfellevurdert)
  • 53.
    Hansen, Helle Hvid
    et al.
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Ketema, Jeroen
    University of Twente, Enschede, Netherlands.
    Luttik, Bas
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, Netherlands.
    van de Pol, Jaco
    University of Twente, Enschede, Netherlands.
    Towards model checking executable UML specifications in mCRL22010Inngår i: Innovations in Systems and Software Engineering, ISSN 1614-5046, Vol. 6, nr 1, s. 83-90Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We describe a translation of a subset of executable UML (xUML) into the process algebraic specification language mCRL2. This subset includes class diagrams with class generalisations, and state machines with signal and change events. The choice of these xUML constructs is dictated by their use in the modelling of railway interlocking systems. The long-term goal is to verify safety properties of interlockings modelled in xUML using the mCRL2 and LTSmin toolsets. Initial verification of an interlocking toy example demonstrates that the safety properties of model instances depend crucially on the run-to-completion assumptions.

  • 54.
    Hansen, Helle Hvid
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Ketema, Jeroen
    University of Twente, Enschede, The Netherlands.
    Luttik, Bas
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    van de Pol, Jaco
    University of Twente, Enschede, The Netherlands.
    Osmar Marchi dos Santos, Osmar
    University of York, York, England.
    Automated Verification of Executable UML Models2011Inngår i: Post-Proceedings of the International Symposium on Formal Methods for Components and Objects (FMCO 2010) / [ed] Bernhard K. Aichernig, Frank S. de Boer, Marcello M. Bonsangue, Heidelberg: Springer, 2011, Vol. 6957, s. 225-250Konferansepaper (Fagfellevurdert)
  • 55.
    Hassan, D.
    et al.
    National Telecommunication Institute, Cairo, Egypt.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, M. A.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Restricted delegation and revocation in language-based security: (Position paper)2010Inngår i: PLAS 2010: proceedings of the ACM SIGPLAN 5th Workshop on Programming Languages and Analysis for Security, June 10, 2010, Toronto, Canada, New York, NY: ACM Press, 2010, s. 5-12Konferansepaper (Fagfellevurdert)
  • 56.
    Hierons, Robert M.
    et al.
    Department of Computer Science, Brunel University London, Uxbridge, United Kingdom.
    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).
    Thomsen, Michael Kirkedal
    Department of Computer Science, University of Copenhagen, Copenhagen, Denmark.
    Turker, Uraz Cengiz
    Computer Engineering, Faculty of Engineering, Gebze Technical University, Kocaeli, Turkey.
    Hardness of deriving invertible sequences from finite state machines2017Inngår i: SOFSEM 2017: SOFSEM 2017: Theory and Practice of Computer Science: 43rd International Conference on Current Trends in Theory and Practice of Computer Science Limerick, Ireland, January 16–20, 2017, Proceedings / [ed] Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey & Tiziana Margaria, Heidelberg: Springer Berlin/Heidelberg, 2017, s. 147-160Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Many test generation algorithms use unique input/output sequences (UIOs) that identify states of the finite state machine specification M. However, it is known that UIO checking the existence of UIO sequences is PSPACE-complete. As a result, some UIO generation algorithms utilise what are called invertible sequences; these allow one to construct additional UIOs once a UIO has been found. We consider three optimisation problems associated with invertible sequences: deciding whether there is a (proper) invertible sequence of length at least K; deciding whether there is a set of invertible sequences for state set S′ that contains at most K input sequences; and deciding whether there is a single input sequence that defines invertible sequences that take state set S″ to state set S′. We prove that the first two problems are NP-complete and the third is PSPACE-complete. These results imply that we should investigate heuristics for these problems. © Springer International Publishing AG 2017.

  • 57.
    Hojjat, H.
    et al.
    University of Tehran and Institute for Studies in Theoretical Physics and Mathematics, Iran.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, The Netherlands.
    Sirjani, M.
    University of Tehran and Institute for Studies in Theoretical Physics and Mathematics, Iran.
    Process algebraic verification of SystemC codes2008Inngår i: Application of Concurrency to System Design, 2008. ACSD 2008. 8th International Conference on / [ed] Billington, J, Duan, Z, Koutny, M, New York: IEEE Press, 2008, s. 62-67Konferansepaper (Fagfellevurdert)
    Abstract [en]

    SystemC is an IEEE standard system-level language used in hardware/software co-design and has been widely adopted in the industry. This paper describes a formal approach to verifying SystemC codes by providing a mapping to the process algebra mCRL2. The outstanding advantages of mCRL2 are the support for different data types and a powerful tool-set for model reduction and analysis. A tool is implemented to automatically perform the proposed mapping. This translation enabled us to exploit process-algebraic verification techniques to analyze a number of case-studies, including the formal analysis of a single-cycle and a pipelined MIPS processor specified in SystemC.

  • 58.
    Hojjat, H.
    et al.
    University of Tehran, IPM, Iran.
    Sirjani, M.
    University of Tehran, IPM, Iran.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology (TU/e), Netherlands.
    Groote, J. F.
    Eindhoven University of Technology (TU/e), Netherlands.
    Sarir: a Rebeca to mCRL2 translator2007Inngår i: Application of Concurrency to System Design, 2007. ACSD 2007. Seventh International Conference on / [ed] Basten, T, Juhas, G, Shukla, S, Los Alamitos, Calif.: IEEE Computer Society, 2007, s. 216-220Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We describe a translation from Rebeca, an actor-based language, to mCRL2, a process algebra enhanced with data types. The main motivation is to exploit the verification tools and theories developed for mCRL2 in Rebeca. The mapping is applied to several case-studies including the tree identify phase of the IEEE 1394 standard. The results of the experiment show that the minimization tools of mCRL2 can be very effective and the outcome of the present translation outperforms that of the translation to the input language of the Spin model-checker.

  • 59.
    Hojjat, Hossein
    et al.
    IPM and University of Tehran, Tehran, Iran.
    Mousavi, Mohammad Reza
    TU/Eindhoven, Eindhoven, The Netherlands.
    Sirjani, Marjan
    IPM and University of Tehran, Tehran, Iran.
    A framework for performance evaluation and functional verification in stochastic process algebras2008Inngår i: SAC '08: Proceedings of the 2008 ACM symposium on Applied computing, New York: Association for Computing Machinery (ACM), 2008, s. 339-346Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Despite its relatively short history, a wealth of formalisms exist for algebraic specification of stochastic systems. The goal of this paper is to give such formalisms a unifying framework for performance evaluation and functional verification. To this end, we propose an approach enabling a provably sound transformation from some existing stochastic process algebras, e.g., PEPA and MTIPP, to a generic form in the mCRL2 language. This way, we resolve the semantic differences among different stochastic process algebras themselves, on one hand, and between stochastic process algebras and classic ones, such as mCRL2, on the other hand. From the generic form, one can generate a state space and perform various functional and performance-related analyses, as we illustrate in this paper.

  • 60.
    Hojjat, Hossein
    et al.
    University of Tehran, School of Computer Science, Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Sirjani, Marjan
    University of Tehran, School of Computer Science, Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran.
    Application of process algebraic verification and reduction techniques to SystemC designs2008Rapport (Annet vitenskapelig)
  • 61.
    Hojjat, Hossein
    et al.
    Ecole Polytechnique F́ed́erale de Lausanne, Station 14, CH-1015 Lausanne, Switzerland.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, P.O. Box 513, NL-5600MB, Eindhoven, Netherlands.
    Sirjani, Marjan
    Reykjavik University, Reykjavik, Iceland.
    Formal analysis of systemc designs in process algebra2011Inngår i: Fundamenta Informaticae, ISSN 0169-2968, E-ISSN 1875-8681, Vol. 107, s. 19-42Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    SystemC is an IEEE standard system-level language used in hardware/software co-design and has been widely adopted in the industry. This paper describes a formal approach to verifying SystemC designs by providing a mapping to the process algebra mCRL2. Our mapping formalizes both the simulation semantics as well as exhaustive state-space exploration of SystemC designs. By exploiting the existing reduction techniques of mCRL2 and also its model-checking tools, we efficiently locate the race conditions in a system and resolve them. A tool is implemented to automatically perform the proposed mapping. This mapping and the implemented tool enabled us to exploit process-algebraic verification techniques to analyze a number of case-studies, including the formal analysis of a single-cycle and a pipelined MIPS processor specified in SystemC.

  • 62.
    Jaghoori, Mohammad Mahdi
    et al.
    CWI, Amsterdam, Netherlands.
    Sirjani, Marjan
    Reykjavik Univ, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands.
    Khamespanah, Ehsan
    Univ Tehran, Tehran, Iran .
    Movaghar, Ali
    Sharif Univ Technol, Tehran, Iran.
    Symmetry and partial order reduction techniques in model checking Rebeca2010Inngår i: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 47, nr 1, s. 33-66Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Rebeca is an actor-based language with formal semantics which is suitable for modeling concurrent and distributed systems and protocols. Due to its object model, partial order and symmetry detection and reduction techniques can be efficiently applied to dynamic Rebecamodels. We present two approaches for detecting symmetry in Rebeca models: One that detects symmetry in the topology of inter-connections among objects and another one which exploits specific data structures to reflect internal symmetry in the internal structure of an object. The former approach is novel in that it does not require any input from the modeler and can deal with the dynamic changes of topology. This approach is potentially applicable to a wide range of modeling languages for distributed and reactive systems. We have also developed a model checking tool that implements all of the above-mentioned techniques. The evaluation results show significant improvements in model size and model-checkingtime.

  • 63.
    Jaghoori, Mohammad Mahdi
    et al.
    Centrum voor Wiskunde en Informatica (CWI), Amsterdam, The Netherlands.
    Sirjani, Marjan
    University of Tehran and IPM, Tehran, Iran.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Movaghar, Ali
    Sharif University of Technology, Tehran, Iran.
    Symmetry and partial order reduction techniques in model checking Rebeca2007Rapport (Annet vitenskapelig)
  • 64.
    Keshishzadeh, Sarmen
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mooij, Arjan
    Embedded Systems Innovation by TNO, 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).
    Early Fault Detection in DSLs using SMT Solving and Automated Debugging2013Inngår i: Software Engineering and Formal Methods: 11th International Conference, SEFM 2013, Madrid, Spain, September 2013 Proceedings / [ed] Robert Hierons, Mercedes G. Merayo & Mario Bravetti, Berlin: Springer Berlin/Heidelberg, 2013, Vol. 8137, s. 182-196Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In the context of Domain Specic Languages (DSLs), westudy ways to detect faults early in the software development cycle. Wepropose techniques that validate a wide range of properties, classiedinto basic and advanced. Basic validation includes syntax checking, reference checking and type checking. Advanced validation concerns domainspecic properties related to the semantics of the DSL. For verication,we mechanically translate the DSL instance and the advanced propertiesinto Satisability Modulo Theory (SMT) problems, and solve these problems using an SMT solver. For user feedback, we extend the vericationwith automated debugging, which pinpoints the causes of the violatedproperties and traces them back to the syntactic constructs of the DSL.We illustrate this integration of techniques using an industrial case oncollision prevention for medical imaging equipment. © 2013 Springer-Verlag.

    Fulltekst (pdf)
    fulltext
  • 65.
    Khakpour, N.
    et al.
    Tarbiat Modares University, Tehran, Iran.
    Jalili, S.
    Tarbiat Modares University, Tehran, Iran.
    Talcott, C.
    SRI International, Menlo Park, CA, United States.
    Sirjani, M.
    Reykjavk University, Reykjavk, Iceland.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, Netherlands.
    PobSAM: policy-based managing of actors in self-adaptive systems2010Inngår i: Proceedings of the 6th International Workshop on Formal Aspects of Component Software (FACS’09, Eindhoven, The Netherlands, November 2-3, 2009), Amsterdam: Elsevier, 2010, Vol. 263, s. 129-143Konferansepaper (Fagfellevurdert)
  • 66.
    Khakpour, Narges
    et al.
    Tarbiat Modares University, Tehran, Iran.
    Jalili, Saeed
    SRI International, Menlo Park, CA, United States.
    Talcott, Carolyn
    Reykjavík University, Reykjavík, Iceland.
    Sirjani, Marjan
    University of Tehran and IPM, Tehran, Iran.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Formal modeling of evolving self-adaptive systems2012Inngår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 78, nr 1, s. 3-26Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper, we present a formal model, named PobSAM (Policy-based Self-Adaptive Model), for developing and modeling self-adaptive evolving systems. In this model, policies are used as a mechanism to direct and adapt the behavior of self-adaptive systems. A PobSAM model is a collection of autonomous managers and managed actors. The managed actors are dedicated to the functional behavior while the autonomous managers govern the behavior of managed actors by enforcing suitable policies. A manager has a set of configurations including two types of policies: governing policies and adaptation policies. To adapt the system behavior in response to the changes, the managers switch among different configurations. We employ the combination of an algebraic formalism and an actor-based model to specify this model formally. Managed actors are expressed by an actor model. Managers are modeled as meta-actors whose configurations are described using a multi-sorted algebra called CA. We provide an operational semantics for PobSAM using labeled transition systems. Furthermore, we provide behavioral equivalence of different sorts of CA in terms of splitting bisimulation and prioritized splitting bisimulation. Equivalent managers send the same set of messages to the actors. Using our behavioral equivalence theory, we can prove that the overall behavior of the system is preserved by substituting a manager by an equivalent one. © 2011 Elsevier B.V. All rights reserved.

  • 67.
    Khakpour, Narges
    et al.
    Linnaeus University, Växjö, Sweden.
    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).
    Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap2015Inngår i: 26th International Conference on Concurrency Theory: CONCUR’15, September 1–4, 2015, Madrid, Spain / [ed] Luca Aceto & David de Frutos Escrig, Wadern: Dagstuhl Publishing , 2015, Vol. 42, s. 18-40Konferansepaper (Annet (populærvitenskap, debatt, mm))
    Abstract [en]

    We review and compare three notions of conformance testing for cyber-physical systems. We begin with a review of their underlying semantic models and present conformance-preserving translations between them. We identify the differences in the underlying semantic models and the various design decisions that lead to these substantially different notions of conformance testing. Learning from this exercise, we reflect upon the challenges in designing an “ideal” notion of conformance for cyber-physical systems and sketch a roadmap of future research in this domain.

  • 68.
    Khamespanah, Ehsan
    et al.
    University of Tehran, School of Electrical and Computer Engineering, Tehran, Iran & Reykjavik University, School of Computer Science, Reykjavik, Island.
    Sirjani, Marjan
    Reykjavik University, School of Computer Science, Reykjavik, Island.
    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).
    Sabahi Kaviani, Zeynab
    University of Tehran, School of Electrical and Computer Engineering, Tehran, Iran.
    Razzazi, Mohammad Reza
    Amirkabir University of Technology, School of Computer Engineering and Information Technology, Tehran, Iran.
    State Distribution Policy for Distributed Model Checking of Actor Models2015Inngår i: Electronic Communications of the EASST, ISSN 1863-2122, E-ISSN 1863-2122, Vol. 72, s. 1-15Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Model checking temporal properties is often reduced to finding accepting cycles in Büchi automata. A key ingredient for an effective distributed model checking technique is a distribution policy that does not split the potential accepting cycles of the corresponding automaton among several nodes. In this paper, we introduce a distribution policy to reduce the number of split cycles. This policy is based on the call dependency graph, obtained from the message passing skeleton of the model. We prove theoretical results about the correspondence between the cycles of call dependency graph and the cycles of the concrete state space and provide empirical data obtained from applying our distribution policy in state space generation and reachability analysis. We take Rebeca, an imperative interpretation of actors, as our modeling language and implement the introduced policy in its distributed state space generator. Our technique can be applied to other message-driven actor-based models where concurrent objects or services are units of concurrency.

    Fulltekst (pdf)
    fulltext
  • 69.
    Kunze, Sebastian
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Mostowski, Wojciech
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    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).
    Varshosaz, Mahsa
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Generation of Failure Models through Automata Learning2016Inngår i: Proceedings: 2016 Workshop on Automotive Systems/Software Architectures, Los Alamitos: IEEE Computer Society, 2016, s. 22-25, artikkel-id 7484118Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In the context of the AUTO-CAAS project that deals with model-based testing techniques applied in the automotive domain, we present the preliminary ideas and results of building generalised failure models for non-conformant software components. These models are a necessary building block for our upcoming efforts to detect and analyse failure causes in automotive software built with AUTOSAR components. Concretely, we discuss how to build these generalised failure models using automata learning techniques applied to a guided model-based testing procedure of a failing component. We illustrate our preliminary findings and experiments on a simple integer queue implemented in the C programming language. © 2016 IEEE.

  • 70.
    Mohaqeqi, Morteza
    et al.
    Department of Information Technology, Uppsala University, Uppsala, Sweden.
    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).
    Sound Test-Suites for Cyber-Physical Systems2016Inngår i: Proceedings of the 10th International Symposium on Theoretical Aspects of Software Engineering (TASE 2016), Piscataway: IEEE Computer Society, 2016, s. 42-48, artikkel-id 7541884Konferansepaper (Fagfellevurdert)
    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. © 2016 IEEE.

    Fulltekst (pdf)
    fulltext
  • 71.
    Mohaqeqi, Morteza
    et al.
    Uppsala University, Uppsala, Sweden.
    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).
    Towards an Approximate Conformance Relation for Hybrid I/O Automata2016Inngår i: Proceedings of the The First Workshop on Verification and Validation of Cyber-Physical Systems / [ed] Mehdi Kargahi & Ashutosh Trivedi, Sydney: Open Publishing Association , 2016, Vol. 232, s. 53-64Konferansepaper (Fagfellevurdert)
    Abstract [en]

    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.

    Fulltekst (pdf)
    fulltext
  • 72.
    Mohaqeqi, Morteza
    et al.
    School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran.
    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).
    Taha, Walid
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Rice University, Houston, Texas, USA.
    Conformance Testing of Cyber-Physical Systems: A Comparative Study2014Inngår i: Proceedings of the 14th International Workshop on Automated Verification of Critical Systems (AVoCS 2014) / [ed] Marieke Huisman, Jaco van de Pol, Tiziana Margaria, Julia Padberg & Gabriele Taentzer, Berlin: European Association of Software Science and Technology , 2014Konferansepaper (Fagfellevurdert)
    Abstract [en]

    For systematic and automatic testing of cyber-physical systems, in which a set of test cases is generated based on a formal specification, a number of notions of conformance testing have been proposed. In this paper, we review two existing theories of conformance testing for cyber-physical systems and compare them. We point out their fundamental differences, and prove under which assumptions they coincide.

    Fulltekst (pdf)
    fulltext
  • 73.
    Mosses, P. D.
    et al.
    Department of Computer Science, Swansea University Singleton Park, Swansea, SA2 8PP, United Kingdom.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Reniers, M. A.
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Robustness of equations under operational extensions2010Inngår i: Proceedings 17th International Workshop on Expressiveness in Concurrency / [ed] Fröschle, Sibylle; Valencia, Frank D., 2010, Vol. 41, s. 106-120Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Sound behavioral equations on open terms may become unsoundafter conservative extensions ofthe underlying operational semantics. Providing criteriaunder which such equations are preserved isextremely useful; in particular, it can avoid the need to repeat proofs when extending the specifiedlanguage.This paper investigates preservation of sound equations for several notions of bisimilarity onopen terms: closed-instance (ci-)bisimilarity and formal-hypothesis (fh-)bisimilarity, both due toRobert de Simone, and hypothesis-preserving (hp-)bisimilarity, due to Arend Rensink. For both fh-bisimilarity and hp-bisimilarity, we prove that arbitrarysound equations on open terms are preservedby 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 byarbitrary disjoint extensions. Finally, wegive two sets of syntactic criteria (on equations, resp. operational extensions) and prove each of themto be sufficient for preserving ci-bisimilarity.

    Fulltekst (pdf)
    fulltext
  • 74.
    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.

  • 75.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Causality in the semantics of Esterel: revisited2010Inngår i: Proceedings of the 6th Workshop on Structural Operational Semantics, 2010, Vol. 18, s. 32-45Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We re-examine the challenges concerning causality in the semantics of Esterel and show that they per-tain to the known issues in the semantics of Structured Operational Semantics with negative premises.We show that the solutions offered for the semantics of SOS also provide answers to the semanticchallenges of Esterel and that they satisfy the intuitive requirements set by the language designers.

  • 76.
    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). University of Leicester, Leicester, United Kingdom.
    Combining Epistemic and Operational Aspects in Compositional Verification of Protocols2017Inngår i: EPTCS 259: Proceedings 2nd International Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies. Uppsala, Sweden, 29th April 2017 / [ed] Alex Groce & Stefan Leue, Sydney: Open Publishing Association , 2017, Vol. 259, nr 259Konferansepaper (Fagfellevurdert)
  • 77.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Esterel and the Semantics of Causality2012Inngår i: Handbook of Finite State Based Models and Applications / [ed] Jiacun Wang, Boca Raton: CRC Press, 2012, s. 191-206Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 78.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Basten, Twan
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Reniers, Michel A.
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Chaudron, Michel
    Leiden Institute of Advanced Computer Science, Leiden, Netherlands.
    Timed-Gamma and Its Coordination Language2015Inngår i: Nordic Journal of Computing, ISSN 1236-6064, Vol. 15, nr 2, s. 75-111Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    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.

  • 79.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Le Guernic, Paul
    INRIA/IRISA, Rennes, France.
    Talpin, Jean-Pierre
    INRIA/IRISA, Rennes, France.
    Shukla, Sandeep Kumar
    Virginia Polytechnic Institute and State University, Blacksburg, Virginia, USA.
    Basten, Twan
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Modeling and Validating Globally Asynchronous Design in Synchronous Frameworks2004Inngår i: Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’04), Volume 1 / [ed] G. Gielen & J. Figueras, Los Alamitos, CA: IEEE Computer Society, 2004, s. 384-389Konferansepaper (Fagfellevurdert)
    Abstract [en]

    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.

  • 80.
    Mousavi, Mohammad Reza
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Pang, Jun
    Faculty of Science, Technology and Communication, University of Luxembourg.
    Special issue: Software verification and testing2013Inngår i: Innovations in Systems and Software Engineering, ISSN 1614-5046, Vol. 9, nr 2, s. 57-58Artikkel i tidsskrift (Fagfellevurdert)
  • 81.
    Mousavi, Mohammad Reza
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Pang, Jun
    University of Luxembourg, Luxembourg, Luxembourg.
    Special section on Software Verification and Testing2014Inngår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 95, Part 3, s. 273-274Artikkel i tidsskrift (Annet vitenskapelig)
  • 82.
    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.

  • 83.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Den Dolech 2, NL-5612 AZ Eindhoven, The Netherlands.
    Phillips, Iain
    Imperial College London, UK.
    Reniers, Michel A.
    Eindhoven University of Technology, Den Dolech 2, NL-5612 AZ Eindhoven, The Netherlands.
    Ulidowski, Irek
    University of Leicester, UK.
    Semantics and expressiveness of ordered SOS2009Inngår i: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 207, nr 2, s. 85-119Artikkel i tidsskrift (Fagfellevurdert)
    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.

  • 84.
    Mousavi, Mohammad Reza
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Ravara, Antonio
    Department of Informatics, Faculty of Sciences and Technology, New University of Lisbon, Portugal.
    Foreword: Special issue on the 10th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2011)2014Inngår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 89, s. 68s. 1-1Artikkel i tidsskrift (Annet vitenskapelig)
  • 85.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Ravara, AntónioNew University of Lisbon, Lisbon, Portugal.
    Proceedings 10th International Workshop on the Foundations of Coordination Languages and Software Architectures2011Konferanseproceedings (Annet vitenskapelig)
    Abstract [en]

    Computation nowadays is becoming inherently concurrent, either because of characteristics of the hardware (with multicore processors becoming omnipresent) or due to the ubiquitous presence of distributed systems (incarnated in the Internet). Computational systems are therefore typically distributed, concurrent, mobile, and often involve composition of heterogeneous components. To specify and reason about such systems and go beyond the functional correctness proofs, e.g., by supporting reusability and improving maintainability, approaches such as coordination languages and software architecture are recognised as fundamental. The goal of the this workshop is to put together researchers and practitioners of the aforementioned fields, to share and identify common problems, and to devise general solutions in the context of coordination languages and software architectures.

  • 86.
    Mousavi, Mohammad Reza
    et al.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, M. A.
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    A Congruence Rule Format with Universal Quantification2007Inngår i: Proceedings of the 4th Workshop on Structural Operational Semantics, Amsterdam: Elsevier, 2007, Vol. 192(1), s. 109-124Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We investigate the addition of universal quantification to the meta-theory of Structural Operational Semantics (SOS). We study the syntax and semantics of SOS rules extended with universal quantification and propose a congruence rule format for strong bisimilarity that supports this new feature. © 2007 Elsevier B.V. All rights reserved.

  • 87.
    Mousavi, Mohammad Reza
    et al.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600, MB Eindhoven, Netherlands.
    Reniers, M. A.
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    On well-foundedness and expressiveness of promoted tyft: being promoted makes a difference2007Inngår i: Proceedings of the 3rd Workshop on Structural Operational Semantics, Amsterdam: Elsevier, 2007, Vol. 175, s. 45-56Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper, we solve two open problems posed by Karen L. Bernstein regarding her promoted tyft format for structured operational semantics. We show that, unlike formats with closed terms as labels, such as the tyft format, the well-foundedness assumption cannot be dropped for the promoted tyft format while preserving the congruence result. We also show that the well-founded promoted tyft format is incomparable to the tyft format with closed terms as labels, i.e., there are transition relations that can be specified by the promoted tyft format but not by the tyft format, and vice versa. © 2007 Elsevier B.V. All rights reserved.

  • 88.
    Mousavi, Mohammad Reza
    et al.
    Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, M. A.
    Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Prototyping SOS meta-theory in Maude2006Inngår i: Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS2005, Lisbon, Portugal, July 10, 2005; satellite to ICALP2005), Amsterdam: Elsevier, 2006, Vol. 156(1), s. 135-150Konferansepaper (Fagfellevurdert)
  • 89.
    Mousavi, Mohammad Reza
    et al.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Reniers, M. A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Groote, J. F.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    A syntactic commutativity format for SOS2005Inngår i: Information Processing Letters, ISSN 0020-0190, E-ISSN 1872-6119, Vol. 93, nr 5, s. 217-223Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Considering operators defined using Structural Operational Semantics (SOS), commutativity axioms are intuitive properties that hold for many of them. Proving this intuition is usually a laborious task, requiring several pages of boring and standard proof. To save this effort, we propose a syntactic SOS format which guarantees commutativity for a set of composition operators.

  • 90.
    Mousavi, Mohammad Reza
    et al.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Reniers, M. A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Groote, J. F.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands.
    Notions of bisimulation and congruence formats for SOS with data2005Inngår i: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 200, s. 107-147Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    While studying the specification of the operational semantics of different programming languages and formalisms, one can observe the following three facts. First, Plotkin's style of Structural Operational Semantics has become a standard in defining operational semantics. Second, congruence with respect to some notion of bisimilarity is an interesting property for such languages and it is essential in reasoning. Third, there are numerous languages that contain an explicit data part in the state of the operational semantics. The first two facts have resulted in a line of research exploring syntactic formats of operational rules to derive the desired congruence property for free. However, the third point (in combination with the first two) is not sufficiently addressed and there is no standard congruence format for operational semantics with an explicit data state. In this article, we address this problem by studying the implications of the presence of a data state on the notion of bisimilarity. Furthermore, we propose a number of formats for congruence. © 2005 Elsevier Inc. All rights reserved.

  • 91.
    Mousavi, Mohammad Reza
    et al.
    Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, M. A.
    Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Groote, J. F.
    Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    SOS formats and meta-theory: 20 years after2007Inngår i: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 373, s. 238-272Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981]. Subsequently, the format of SOS rules became the object of study. Using so-called Transition System Specifications (TSS's) several authors syntactically restricted the format of rules and showed several useful properties about the semantics induced by any TSS adhering to the format. This has resulted in a line of research proposing several syntactical rule formats and associated meta-theorems. Properties that are guaranteed by such rule formats range from well-definedness of the operational semantics and compositionality of behavioral equivalences to security-, time- and probability-related issues. In this paper, we provide an overview of SOS rule formats and meta-theorems formulated around them. © 2007 Elsevier Ltd. All rights reserved.

  • 92.
    Mousavi, Mohammad Reza
    et al.
    Department of Computer Science, Eindhoven University of Technology, NL-5600MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, NL-5600MB Eindhoven, Netherlands.
    Orthogonal extensions in structural operational semantics2005Inngår i: Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings, Heidelberg: Springer, 2005, Vol. 3580, s. 1214-1225Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper, we give novel and more liberal notions of operationaland equational conservativity for language extensions. We motivatethese notions by showing their practical application in existing formalisms.Based on our notions, we formulate and prove meta-theoremsthat establish conservative extensions for languages defined using StructuralOperational Semantics (SOS).

  • 93.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Basten, Twan
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Chaudron, Michel R. V.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    PARS: a process algebraic approach to resources and schedulers2008Inngår i: Process Algebra for Parallel and Distributed Processing / [ed] Michael Alexander & William Gardner, Boca Raton: CRC Press, 2008, s. 331-358Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 94.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Salaün, GwenGrenoble Institute of Technology, Grenoble, France.
    Proceedings Ninth International Workshop on the Foundations of Coordination Languages and Software Architectures: Paris, France, 4th September 20102010Konferanseproceedings (Annet vitenskapelig)
    Abstract [en]

    This volume contains the proceedings of FOCLASA 2010, the 9th International Workshop on the Foundations of Coordination Languages and Software Architectures. FOCLASA 2010 was held in Paris, France on July 30th, 2010 as a satellite event of the 21st International Conference on Concurrency Theory, CONCUR 2010. The papers presented in this proceedings tackle different issues that are currently central to our community, namely software adaptation, sensor networks, distributed control, non-functional aspects of coordination such as resources, timing and stochastics.

  • 95.
    Mousavi, Mohammad Reza
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Sekerinski, EmilMcMaster University, Hamilton, Ontario, Canada.
    Proceedings of Formal Methods 2009 Doctoral Symposium: November 6, 2009: Eindhoven, The Netherlands2009Konferanseproceedings (Annet vitenskapelig)
  • 96.
    Mousavi, Mohammad Reza
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Univ Leicester, Leicester, United Kingdom.
    van Glabbeek, Rob
    CSIRO, Sydney, NSW, Australia.
    Dubslaff, Clemens
    Baier, Christel
    Bruni, Roberto
    Melgratti, Hernan
    Montanari, Ugo
    Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics Berlin, Germany, 4th September 2017: Preface2017Inngår i: Electronic Proceedings in Theoretical Computer Science, ISSN 2075-2180, E-ISSN 2075-2180, nr 255Artikkel i tidsskrift (Annet vitenskapelig)
  • 97.
    Mousavi, Mohammad Reza
    et al.
    University of Leicester, Leicester, England.
    Varshosaz, Mahsa
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Telling Lies in Process Algebra2018Inngår i: Proceedings. 2018 12th International Symposium on Theoretical Aspects of Software Engineering: TASE 2018. Guangzhou, China. 29-31 August 2018, Guangzhou: Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 116-123Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Epistemic logic is a powerful formalism for reasoning about communication protocols, particularly in the setting with dishonest agents and lies. Operational frameworks such as algebraic process calculi, on the other hand, are powerful formalisms for specifying the narrations of communication protocols. We bridge these two powerful formalisms by presenting a process calculus in which lies can be told. A lie in our framework is a communicated message that is pretended to be a different message (or nothing at all). In our formalism, we focus on what credulous rational agents can infer about a particular run if they know the protocol beforehand. We express the epistemic properties of such specifications in a rich extension of modal mu-calculus with the belief modality and define the semantics of our operational models in the semantic domain of our logic. We formulate and prove criteria that guarantee belief consistency for credulous agents. ©2018 IEEE

  • 98.
    Noroozi, Neda
    et al.
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Khosravi, Ramtin
    University of Tehran, Tehran, Iran.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Willemse, Tim
    Eindhoven University of Technology, Eindhoven, Netherlands.
    Synchronizing Asynchronous Conformance Testing2011Inngår i: Proceedings of the 9th International Conference on Software Engineering and Formal Methods (SEFM 2011), Berlin: Springer Berlin/Heidelberg, 2011, Vol. 7041, s. 334-349Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We present several theorems and their proofs which enable using synchronous testing techniques such as input output conformance testing (ioco ) in order to test implementations only accessible through asynchronous communication channels. These theorems define when the synchronous test-cases are sufficient for checking all aspects of conformance that are observable by asynchronous interaction with the implementation under test. © 2011 Springer-Verlag.

  • 99.
    Noroozi, Neda
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Khosravi, Ramtin
    University of Tehran, Tehran, Iran.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Willemse, Tim A. C.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Synchrony and asynchrony in conformance testing2015Inngår i: Journal of Software and Systems Modeling (online), ISSN 1619-1366, E-ISSN 1619-1374, Vol. 14, nr 1, s. 149-172Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We present and compare different notions of conformance testing based on labeled transition systems. We formulate and prove several theorems which enable using synchronous conformance testing techniques such as input–output conformance testing (ioco) in order to test implementations only accessible through asynchronous communication channels. These theorems define when the synchronous test cases are sufficient for checking all aspects of conformance that are observable by asynchronous interaction with the implementation under test. © 2015, Springer-Verlag Berlin Heidelberg.

    Fulltekst (pdf)
    fulltext
  • 100.
    Noroozi, Neda
    et al.
    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). Eindhoven University of Technology, Eindhoven, The Netherlands.
    Willemse, Tim
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Decomposability in Input Output Conformance Testing2013Inngår i: Proceedings of the 8th Workshop on Model-Based Testing / [ed] Alexander K. Petrenko & Holger Schlingloff, Open Publishing Association , 2013, s. 51-66Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We study the problem of deriving a specification for a third-party component, based on the specifi-cation of the system and the environment in which the component is supposed to reside. Particularly,we are interested in using component specifications for conformance testing of black-box components, using the theory of input-output conformance (ioco) testing. We propose and prove sufficientcriteria for decompositionality, i.e., that components conforming to the derived specification will always compose to produce a correct system with respect to the system specification. We also study thecriteria for strong decomposability, by which we can ensure that only those components conformingto the derived specification can lead to a correct system.

123 51 - 100 of 115
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • 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