Sharif Digital Repository

Modeling languages as programming languages need precise and unambiguous semantics to be used appropriately, the formal semantics is significant for designing CASE tools and model verification. Several approaches have been used throughout these years to describe the semantics of modeling languages, but in spite of programming languages, these semantics frameworks are not used in large scale for modeling languages. This paper reviews the history of developments on semantics frameworks for modeling languages. © 2009 IEEE  

Much attention has been directed to different aspects of the design of pipelines. Design of the control logic of non-linear pipelines has however, been considered as a subsidiary issue in that an RTL description for such logic can easily be obtained from a behavioral description, with the use of widely available synthesis tools. But, as the complexity of a non-linear pipeline increases, so does the complexity of the control logic. The complexity may be to an extent that obtaining even a behavioral description for the control logic is rendered difficult. This paper focuses on further automating the development of systems consisting of non-linear or multi-function pipelines by proposing an... 

This paper explores software design methodologies in the context of creating a simulator and proposes a methodology to design and implement an event-based simulator namely Sim Met. SimMet is explored in the context of the development of a complex simulator for simulating real world conditions to use in science, technology and medicine and other simulations. In this paper we interested in event-based approach to create a real world with variety range of event possibilities. The paper first discusses the role of time concept as the cornerstone of a methodical analysis and design phase. In Sim Met we use an adaptation of object-oriented methodology to meet time and event concepts in creating a... 

Rebeca is an actor-based language for modeling concurrent and distributed systems. Its Java-like syntax makes it easy-to-use for practitioners and its formal foundation is a basis to make different formal verification approaches applicable. Compositional verification and abstraction techniques are used in formal verification of Rebeca models to overcome state explosion problems. The main contribution of this paper is to show how model checking and deduction are integrated for verifying certain properties of these models. Deduction is used to prove that abstraction techniques preserve a set of behavioral specifications in temporal logic and is also used in applying the compositional... 

In this paper, we propose extended Rebeca as a tool-supported actor-based language for modeling and verifying concurrent and distributed systems. We enrich Rebeca with a formal concept of components which integrates the message-driven computational model of actor-based languages with synchronous message passing. Components are used to encapsulate a set of internal active objects which react asynchronously to messages by means of methods and which additionally interact via a synchronous message passing mechanism. Components themselves interact only via asynchronous and anonymous messages. We present our compositional verification approach and abstraction techniques, and the theory... 

In this paper, the parallel implementations of different iterative polynomial root finding methods on a processor with SIMD processing capability are reported. These methods are based on the construction of a sequence of approximations that converge to the set of roots. We have chosen four widely used methods namely Newton's, Durand-Kerner's, Aberth-Ehrlich's, and QD and implemented them using the SIMD instruction set of the Pentium processor with C++ and assembly language. Experiments show that a speedup of 3 or higher can be achieved, depending on the order of polynomial, required accuracy, and the method employed. © 2005 IEEE  

We introduced Computed Network Process Theory to reason about protocols for mobile ad hoc networks (MANETs). Here we explore the applicability of our framework in two regards: model checking and equational reasoning. The operational semantics of our framework is based on constrained labeled transition systems (CLTSs), in which each transition label is parameterized with the set of topologies for which this transition is enabled. We illustrate how through model checking on CLTSs one can analyze mobility scenarios of MANET protocols. Furthermore, we show how by equational theory one can reason about MANETs consisting of a finite but unbounded set of nodes, in which all nodes deploy the same... 

Reo is a coordination language for modeling component connectors of component-based computing systems. We show that the failure-based equivalences NDFD and CFFD are congruences with respect to composition operators of Reo. Copyright 2007 ACM  

In this paper a fuzzy logic based controller for STATCOM is used to improve power system transient stability. As opposed to the modern control theory, fuzzy logic design is not based on the mathematical model of the process. The controller designed using fuzzy logic implements human reasoning that can be programmed into fuzzy logic language (membership functions, rules and the rule interpretation). The nonlinear fuzzy controller is proposed to supply a supplementary control signal to STATCOM to increase the critical clearing time and overcome the uncertainties existing in the power systems. Proposed method is implemented in a single machine infinite bus system and the results are compared... 

The unified modelling language (UML) is a de facto standard for object-oriented modelling. However, the formal semantics for the notations included in UML are not provided, which are a key requirement for the verification and evaluation purposes. To solve this problem, Petri net formalism has been used as a complement to UML in several research projects. However, there is not a complete transformation technique for all concepts and diagrams of UML to an extension of Petri nets. We have recently introduced object stochastic activity networks (OSANs). OSANs are a high-level modelling formalism that integrates object-orientation into stochastic activity networks (SANs). In this paper, we... 

We consider the fundamental problem of reachability analysis over imperative programs with real variables. Previous works that tackle reachability are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation), or are not automated (e.g. incorrectness logic). In contrast, we propose a novel approach for reachability analysis that can handle general and complex loops, is complete, and can be entirely automated for a wide family of programs. Through the notion of Inductive Reachability Witnesses (IRWs), our approach extends ideas from both invariant generation and termination to reachability analysis.... 

Symmetry reduction is a promising technique for combatting state space explosion in model checking. The problem of finding the equivalence classes, i.e., the so-called orbits, of states under symmetry is a difficult problem known to be as hard as graph isomorphism. In this paper, we show how we can automatically find the orbits in an actor-based model, called Rebeca, without enforcing any restriction on the modeler. The proposed algorithm solves the orbit problem for Rebeca models in polynomial time. As a result, the simple actor-based Rebeca language can be utilized efficiently for modeling and verification of systems, without involving the modeler with the details of the verification... 

System fault-tree analysis is a technique for modeling dependability that is in widespread use. For systems such as embedded systems that include both hardware and software, the integration of hardware and software fault trees has proved problematic. In this paper, we present a method for reliability and safety analysis of embedded systems modeled by SystemC language. The evaluation is based on the fault trees generated from both hardware and software parts of the embedded systems described in the unified language. The unified modeling of both hardware and software of embedded systems using SystemC enables designers to be early aware from the safety and reliability of their designs more... 

Composition of a concurrent system out of components involves coordination of their mutual interactions. In component-based construction, this coordination becomes the responsibility of the glue-code language and its underlying run-time middle-ware. Reo offers an expressive glue-language for construction of coordinating component connectors out of primitive channels. In this paper we consider the problem of synthesizing Reo coordination code from a specification of a behavior as a relation on scheduled-data streams. The specification is given as a constraint automaton that describes the desired input/output behavior at the ports of the components. The main contribution in this paper is an... 

This paper presents a new fault injection approach, which is based on a co-operation between a simulator and an emulator. This hybrid approach utilizes the advantages of both simulation-based fault injection as well as physical fault injection to provide a good controllability, observability and also a high speed in the fault injection experiments. To do this, parts of a circuit are simulated while the rest pans of the circuit are emulated. A fault injection tool called FITSEC (Fault Injection Tool based on Simulation and Emulation Co-operation) is developed, which supports the entire process of a system design. This is based on both Verilog and VHDL languages and can be used to inject... 

Reo is an exogenous coordination language for synthesizing components participating in a component-based system. The notion of Bchi automaton over streams of records (BAR for short) is a proposed operational semantics for Reo that covers several aspects of coordination strategies such as synchronization, context dependencies and fairness constraints. In this paper and for the purpose of modeling real-time coordination systems specified by Reo, we present a timed version of BARs as the acceptors of timed streams of records. We show that timed BAR and its streams of records based semantics are more standard and also more expressive than timed constraint automaton which is the first proposed... 

In this paper we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e.g. the intruder model. Further characteristics of the model are a straightforward handling of parallel execution of multiple protocols, locality of security claims, the binding of local constants to role instances, and explicitly defined initial intruder knowledge. We validate our framework by analyzing the Needham-Schroeder-Lowe protocol  

Asynchronous circuits have many advantages vs synchronous design styles like high performance and lower power consumption; however, there is a drawback of big overhead in handshake circuitry of these circuits. In this paper, we have reduced the amount of these extra circuits by take advantage of some compiler techniques. The compiler methods can be used innovatively to improve the synthesis results in terms of both power consumption and area, since these code motions lead to removing of completion detection and validity check parts of asynchronous designs. To the best of our knowledge this is the first effort in using the compiler pre-synthesis optimizations in asynchronous circuits to...