Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.

18-20 June 2003

Filter Results

Displaying Results 1 - 25 of 38
  • A new synchronization in finite stochastic Petri box calculus

    Publication Year: 2003, Page(s):216 - 225
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    The Petri Box Calculus (PBC) combines two well known paradigms of the design of concurrent systems: process algebras and Petri nets. In our first proposal of sPBC (stochastic PBC) [H. Macia et al., (2001)] we defined a Markovian extension of finite PBC, i.e., we had a Markovian process algebra for which both an operational and a denotational (based on stochastic Petri nets) semantics were defined.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On lifting of statechart structuring mechanisms

    Publication Year: 2003, Page(s):206 - 215
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    We propose a set of procedures addressing the implementation of statechart models. The main goal of this set of procedures is to lift the structuring mechanisms presented in statecharts to the top level. In this sense, the complexity of statechart implementation will be similar to the complexity of communicating concurrent state machines and the platforms selected to support implementation will no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VoDkaV tool: model checking for extracting global scheduler properties from local restrictions

    Publication Year: 2003, Page(s):247 - 248
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (202 KB) | HTML iconHTML

    The VoDka server is a video on demand system developed using Erlang/OTP. We have developed a tool that, taking directly a simple abstraction of the source code of the system, first translates it into a intermediate process algebra and, later, generates the state space of a given configuration of the system. From this state space, some global properties of the system can be extracted. The tool uses... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of JavaSpaces™ parallel programs

    Publication Year: 2003, Page(s):196 - 205
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    We illustrate a formal verification method for distributed JavaSpaces applications by analyzing a nontrivial fault tolerant algorithm that solves a typical coordination problem. The problem consists of the computation of an extensive task, performed in parallel by splitting it into smaller and more manageable parts. The proposed solution, based on JavaSpaces coordination primitives, transactions a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Case studies of model checking for embedded system designs

    Publication Year: 2003, Page(s):20 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    As modern embedded systems become more integrated and complex, it is crucial to be able to represent systems at multiple levels of abstraction, so that the design space can be effectively explored by successive refinements and abstractions. We present a formal verification methodology and case studies for property verification of designs represented at different abstraction levels. Utilizing Metro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract model checking and refinement of temporal logic in αSPIN

    Publication Year: 2003, Page(s):245 - 246
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    We give an overview of the features offered by the tool αSPIN in order to perform abstract model checking of LTL formulas. Shortly, these features are: construction of over-approximated PROMELA models, checking satisfaction of universal formulas, checking refutation of existential formulas, and on-the-fly refinement of the model by means of a refinement of the temporal formula to be verified... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification coverage aided test selection

    Publication Year: 2003, Page(s):187 - 195
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB) | HTML iconHTML

    Here, we consider test selection strategies in formal conformance testing. As the testing conformance relation we use the ioco relation, and extend the previously presented on-the-fly test generation algorithms for ioco to include test selection heuristic based on a specification coverage metric. The proposed method combines a greedy test selection with randomization to guarantee completeness. As ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic communicating processes: hierarchy and verification

    Publication Year: 2003
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    We advocate Cyclic Communicating Processes (CCPs) as a viable and tractable model of computation for reactive systems. As the name suggests, the model consists of a network of sequential agents that communicate with each other. The crucial restriction is that the control flow of each agent is cyclic. The communication mechanism consists of the agents performing common actions together. The first e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polychrony for formal refinement-checking in a system-level design methodology

    Publication Year: 2003, Page(s):9 - 19
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (863 KB) | HTML iconHTML

    The productivity gap incurred by the rising complexity of system-on-chip design have necessitated newer design paradigms to be introduced based on system-level design languages. A gating factors for widespread adoption of these new paradigms is a lack of formal tool support of refinement based design. A system level representation may be refined manually (in absence of adequate behavioral synthesi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ConfRes: interactive coding conflict resolver based on core visualisation

    Publication Year: 2003, Page(s):243 - 244
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    The tool presented supports manual resolution of coding conflicts in asynchronous circuit specification given as signal transition graphs (STGs) and displays them as partial orders (finite and complete prefixes of STG unfoldings). The manual approach although efficient requires a significant effort from the designer. The tool ConfRes assists the designer by visualising the conflict cores, their su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for the development of protocols

    Publication Year: 2003, Page(s):239 - 240
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    We present the χ-Spaces framework, a tool designed to support every step of a security protocol's life cycle. Its integrated development environment (IDE) eases the task of protocol design, debugging and simulation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modifying Petri net models by means of crosscutting operations

    Publication Year: 2003, Page(s):177 - 186
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (326 KB) | HTML iconHTML

    Increasingly complex abstraction and composition constructs have been proposed for Petri nets, sometimes to the point that the quantity and diversity of net inscriptions seem to obscure the proclaimed advantages of Petri nets graphical representation. These constructs are oriented towards system synthesis but typically overlook the necessity of future model modifications due to unanticipated chang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HiWorD: a Petri net-based hierarchical workflow designer

    Publication Year: 2003, Page(s):235 - 236
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (365 KB) | HTML iconHTML

    Much work is being conducted in the area of business process modeling using workflow technology. HiWorD is a hierarchical workflow modeling prototype with simulation capability. It models business processes using Petri nets in a hierarchical manner and implements recovery transitions as a technique to recover from exceptions. The workflow hierarchy is created by refining places and transitions usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory fault tolerance software mechanisms: design and configuration support through SWN models

    Publication Year: 2003, Page(s):111 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB) | HTML iconHTML

    We present a case study of a software fault tolerance mechanisms, the distributed memory, designed and implemented within the European projects TIRAN and DEPAUDE, and currently under study within the Italian project ISIDE. The studied mechanisms are part of a complete framework of general purpose software fault tolerance mechanisms. We show a method for the compositional construction of models of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separation of concerns in the formal design of real-time shared data-space systems

    Publication Year: 2003, Page(s):71 - 81
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (567 KB) | HTML iconHTML

    We propose a formal framework for the design of real-time shared data-space systems. The proposed method separates the concerns of functionality, behavior, and timing. This work exploits the idea of separation of concerns at the specification and design level, and it establishes a robust theoretical basis that allows rigid analysis and verification of (timed) designs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communicating transaction processes

    Publication Year: 2003, Page(s):157 - 166
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (589 KB) | HTML iconHTML

    Message sequence charts (MSC) have been traditionally used to depict execution scenarios in the early stages of design cycle. MSCs portray inter-process (inter-object) interactions. Synthesizing intra-process (intra-object) executable specifications from an MSC-based description is a nontrivial task. Here we present a model called communicating transaction processes (CTP) based on MSCs from which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • C-Sim version 5.0

    Publication Year: 2003, Page(s):229 - 230
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (194 KB) | HTML iconHTML

    We present the C-Sim simulation tool that enables an experimental evaluation (i.e. testing) of parallel and distributed programs behavior using their close-to-reality C-language source code and a simulated operational environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AutoFOCUS and the MoDe tool

    Publication Year: 2003, Page(s):249 - 250
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (201 KB) | HTML iconHTML

    Software engineering for distributed automotive applications is shifting from a subsystem-level perspective, where the focus is on optimization of a single electronic control unit, towards a system-level view. However, optimization of distributed systems with respect to non-functional properties remains a challenging task. The goal of the MoDe (model based deployment) approach is to give early gui... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-static scheduling for concurrent architectures

    Publication Year: 2003, Page(s):29 - 40
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB) | HTML iconHTML

    We present a synthesis approach for reactive systems that aims at minimizing the overhead introduced by the operating system and the interaction among the concurrent tasks, while considering multiple concurrent execution resources. A formal model based on the notion of scheduling of Petri nets is used to perform the synthesis. We show how the notion of projections of a schedule for the complete sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The reality of system design today: do theory and practice meet?

    Publication Year: 2003
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    ACSD aims to be a forum "for disseminating advanced research results on theory and practice of design of concurrent systems". We look at the reality of system design as practiced in industry today and what the needs as expressed and demonstrated by designers actually are. Most industrially successful applications of system design concepts and tools are in distinct design niches, and generic method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BHDL: circuit design in B

    Publication Year: 2003, Page(s):241 - 242
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    The main goal of this project is to provide a method of correct design of digital circuit. It combines the advantages of VHDL, the well-known language of circuit design, with the power of B method that guarantees the correct design (w.r.t. a formal specification). This allows avoiding the design test since it is "correct by proven construction". Furthermore, this project provides a tool, called BH... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAST - a task-level concurrency analysis tool

    Publication Year: 2003, Page(s):237 - 238
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    CAST is a system-level software tool for target-architecture-independent concurrency optimization of streaming applications. It includes a design exploration method to guide a system designer in an intuitive way through the design-space. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Component-based design: towards guided composition

    Publication Year: 2003, Page(s):122 - 131
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    We present a mathematical model for the composition of software components, at a semantic modelling level. We describe a mathematical concept of a single software component and identify properties that ensure its potential behaviour can be captured. Based on that, we give a formal definition of composition and examine its effect on the individual components. We argue that properties of the individ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling a secure, mobile, and transactional system with CO-OPN

    Publication Year: 2003, Page(s):82 - 91
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new application domains include dynamicity, mobility, security, and localization dependent computing. In order to fully model and prototype such systems we propose to use several concepts existing in our specification language CO... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic of involved variables - system specification with temporal logic of distributed actions

    Publication Year: 2003, Page(s):167 - 176
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB) | HTML iconHTML

    The temporal logic of distributed actions (TLDA) is a new temporal logic designed for the specification and verification of distributed systems. TLDA can be syntactically viewed as a slight extension of TLA. We propose a different semantical model based on partial order which evidently increases the expressiveness of the logic. Local variable updates in a system are explicitly modeled and expresse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.