By Topic

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 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.
  • 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.
  • 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.
  • 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.
  • Compositional high level Petri nets with timing constraints - a comparison

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

    We aim at comparing various timed extensions of a fully compositional class of high-level Petri nets, called M-nets. On one hand, as a classical approach, a class of timed M-nets is considered, where intervals of duration are attached to each transition. More precisely, we study this class enriched by the recently introduced hierarchical operation of timed refinement. On the other hand, M-nets enr... 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.
  • 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.
  • 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.
  • A polynomial-time algorithm for checking consistency of free-choice signal transition graphs

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

    Signal transition graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Checking this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rialto profile in the SMW toolkit

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

    We present an extension to the System Modeling Workbench to transform UML behavioral diagrams into specifications in Rialto. Rialto is a behavioral description language with formally defined semantics that supports multiple models of computation and can be compiled into compact code in different target languages. 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.
  • Synthesis of open reactive systems from scenario-based specifications

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

    We propose here live sequence charts with a new, game-based semantics to model interactions between the system and its environment. For constructing programs automatically, we give an algorithm to synthesize either a strategy for the system ensuring that the specification is respected, or, if the specification is unimplementable, a strategy for the environment forcing the system to fail. 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Compositional verification of integrity for digital stream signature protocols

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

    We investigate the application of concurrency theory notions as simulation relations and compositional proof rules for verifying digital stream signature protocols. In particular, we formally prove the integrity of the Gennaro-Rohatgi protocols in (R. Gennaro et al., 2001). As a peculiarity, our technique is able to check a protocol with an unbounded number of parallel processes. We argue also tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Developing a formal specification for the mission system of a maritime surveillance aircraft

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

    The mission system of an aircraft is a complex real-time distributed system consisting of a mission control computer, different kinds of devices interconnected by a number of serial data buses. The complexity and real-time requirements of mission systems have motivated research into the application of formal techniques to investigate and predict the effects of upgrades on mission system behaviour.... 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.
  • 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.
  • Detecting state coding conflicts in STG unfoldings using SAT

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

    The behaviour of asynchronous circuits is often described by signal transition graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of signals. One of the crucial problems in the synthesis of such circuits is that of identifying whether an STG satisfies the complete state coding (CSC) requirement, e.g., by using model checking based on the state graph o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ABTOOLS: another B tool

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

    ABTools (B. Jean-Louis, 2001) provides an open environment based on ANTLR and Java and provides some facilities for design and test an extension for the B language. The formal B method is a 'model-based' formal method like Z or VDM but, unlike others, B allows an incremental process development starting from abstract specification to (automatically generated) code. We are particularly concerned by... 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.