By Topic

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

Date 25-29 June 2001

Filter Results

Displaying Results 1 - 25 of 26
  • Proceedings Second International Conference on Application of Concurrency to System Design

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (175 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2001, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Synthesis of net systems with inhibitor arcs from step transition systems

    Publication Year: 2001, Page(s):245 - 254
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    We here consider transition systems of Elementary Net Systems with Inhibitor Arcs. There are basically two different types of non-interleaving semantics of such Petri nets, the a-posteriori and a-priori semantics. The synthesis problem for Elementary Net Systems with Inhibitor Arcs executed under the a-priori semantics (ENI) was solved in Pietkiewicz-Koutny (1997). The aim of this paper is to comp... View full abstract»

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

    Publication Year: 2001, Page(s): 255
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Software implementation of synchronous programs

    Publication Year: 2001, Page(s):133 - 142
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    Synchronous languages allow a high level, concurrent, and deterministic description of the behavior of reactive systems. Thus, they can be used advantageously for the programming of embedded control systems. The runtime requirements of synchronous code are light, but several critical properties must be fulfilled. In this paper, we address the problem of the software implementation of synchronous p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strengths and weaknesses of genetic list scheduling for heterogeneous systems

    Publication Year: 2001, Page(s):123 - 132
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    List scheduling combined with genetic algorithms has already been shown to be a powerful approach (Grajcar, 1999,Yu-Kwong Kwok and Ahmad, 1996). We investigate the problems associated with using a list scheduler for a heterogeneous system. Furthermore, we present cases, for which most list schedulers fail to find the optimum. We propose and experimentally evaluate novel ideas avoiding it View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Petri net meta-model to develop software components for embedded systems

    Publication Year: 2001, Page(s):113 - 122
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    This paper presents a new Petri net (PN) meta-model, called shobi-PN v2.0, that can be used to specify, the dynamic behaviour of concurrent systems, using object-oriented modelling concepts together with a generalised arc set capable of coping with the complexity of the current embedded systems. This new Petri net meta-model can also be used to support a component-based development approach in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From formal specifications to ready-to-use software components: the concurrent object oriented Petri net approach

    Publication Year: 2001, Page(s):99 - 110
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    CO-OPN (Concurrent Object Oriented Petri Net) is a formal specification language for modelling distributed systems; it is based on coordinated algebraic Petri nets. We describe a method for generating an executable prototype from a CO-OPN specification. We focus our discussion on the generation of executable code for CO-OPN classes. CO-OPN classes are defined using Petri nets. The main problems ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A structural encoding technique for the synthesis of asynchronous circuits

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

    This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications. The method is based on a structural encoding of the system in such a way that a circuit implementation is always guaranteed. Moreover, a set of transformations is presented for the subclass of Free-Choice Petri nets that enables the exploration of different solutions. All transformation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing communicating processes in the event of interface difference

    Publication Year: 2001, Page(s):87 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    We present here an implementation relation which formalises the notion that a system built of communicating processes is an acceptable implementation of another base or specification system in the event that the two systems have different interfaces. Such a treatment has obvious applicability to the software development process, where an implementation component may be expressed at a different lev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overcoming heterophobia: modeling concurrency in heterogeneous systems

    Publication Year: 2001, Page(s):13 - 32
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (413 KB) | HTML iconHTML

    System level design is complex. One source of this complexity is that systems are often heterogeneous: different models of computation (e.g., dataflow, FSMs) are used to describe different components of a system. Existing formal methods for concurrent systems are typically based on one particular model of computation, so it is difficult to formalize the interaction between heterogeneous components... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-hiding operators and the analysis of active-edge specifications for digital circuits

    Publication Year: 2001, Page(s):189 - 198
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    We propose to model and analyze active-edge specifications by a new concurrency operator, called semi-hiding. We define semi-hiding formally, study its algebraic properties, and overview several of its applications, such as interface recasting and tests of compliance for several asynchronous protocols. Semi-hiding and the related applications are integrated in a tool that supports automatic verifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for signal and message asynchronous communication mechanisms and their analysis

    Publication Year: 2001, Page(s):65 - 74
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    This paper presents new algorithms for the Signal and Message asynchronous data communication mechanisms (ACMs) and their modelling and analysis using Petri net techniques View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The BDD space complexity of different forms of concurrency

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

    Symbolic representations using binary decision diagrams (BDDs) are popular means to cope with extremely large state spaces. However, it may be the case that the BDD representation itself is prohibitively large. We consider the BDD representations of synchronous, asynchronous and interleaved processes with communication via shared variables and present upper bounds for their sizes. For this reason,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding imperative synchronous languages in interactive theorem provers

    Publication Year: 2001, Page(s):143 - 154
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (286 KB) | HTML iconHTML

    We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates that describe entering conditions, conditions for internal moves, and termination conditions. The data flow is based on the extraction of guarded commands. This definition principle can be applied to any imperative synchron... View full abstract»

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

    Publication Year: 2001, Page(s):3 - 10
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (149 KB) | HTML iconHTML

    One of the corner stones of formal methods is the notion that abstraction enables analysis. By the construction of an abstract model we can trade implementation detail for analytical power. The intent of a model is to preserve selected characteristics of real-world artifact, while suppressing others. Unfortunately, practitioners are less likely to use a modeling tool if it cannot handle real-world... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of asynchronous delay-insensitive pipeline latency using stage reorganization and optimal stage parameter estimation

    Publication Year: 2001, Page(s):167 - 178
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (565 KB) | HTML iconHTML

    This paper is devoted to studying two key issues of the asynchronous pipelines: their performance, and the influence that the position of stages have on the latency of a pipelined asynchronous circuit as a whole. To attain the performance evaluation, we derive expressions of the latency and the cycle time of a linear pipeline as closed-form formulas. To attain the influence of the position, we pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correct performance of transaction capabilities

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

    The correctness of an optimisation of the Transport Capabilities Application Part of the Signalling System No. 7 is formalised as a branching bisimulation which is relaxed to allow certain actions to be executed in any order. It is demonstrated how this correctness can be checked by a combination of an automated test of branching bisimulation and a manual test of commutation. Using this approach, ... View full abstract»

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

    Publication Year: 2001, Page(s):201 - 210
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    This paper describes a new way of testing reactive systems as investigated by the RATE-project at the Tampere University of Technology. We abandon the idea of systematically using a large library of predetermined test cases and instead use a "live" specification to generate test runs on-the-fly, as testing progresses. In order to do this, we assume that the behavior of the implementation under tes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Property preserving transition refinement with concurrent runs: an example

    Publication Year: 2001, Page(s):77 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    We suggest a new notion of behavior preserving transition refinement based on partial order semantics. Furthermore, we discuss how to prove the correctness of a transition refinement step. Our results are formalized in the setting of Petri nets. We use Petri nets because they have a canonical partial order semantics, which is defined by concurrent runs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making meaningful models for mere mortals

    Publication Year: 2001, Page(s):11 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB) | HTML iconHTML

    Recent advances in automated model checking have demonstrated the power and utility, of behaviour modelling and analysis. However, most attempts to convince practising software engineers to use formal models as part of their software development process have proven unsuccessful. The notations are often too difficult to learn and use, do not provide adequate tool support, do not integrate well into... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards synthesis of monotonic asynchronous circuits from signal transition graphs

    Publication Year: 2001, Page(s):179 - 188
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    An approach to synthesis of asynchronous speed-independent circuits in monotonic logic gates (e.g. ASIC gate array library IBM SA-12E) is discussed. It is based on the normalcy conditions for STG behavioural specification, which guarantees implementability in monotonic and negative gates. The paper presents techniques for refining the STG specification to an implementable form. It is crucial that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of performance limitations in multithreaded multiprocessor architectures

    Publication Year: 2001, Page(s):43 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    The performance of modern multiprocessor systems is increasingly limited by interconnection delays or long latencies of memory subsystems. Instruction-level multithreading is a technique to tolerate such long latencies by switching from one instruction thread to another and continuing instruction execution concurrently with the long-latency operations. Using timed Petri net models, the paper analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting stabilizers and parallelism in state space generation with the symmetry method

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

    The symmetry method is a main reduction paradigm for alleviating the state explosion problem. For large symmetry groups deciding whether two states are symmetric becomes time expensive due to the apparent high time complexity of the orbit problem. The contribution of this paper is to alleviate the negative impact of the orbit problem by the specification of canonical representatives for equivalenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstracting from failure probabilities

    Publication Year: 2001, Page(s):53 - 62
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

    In fault-tolerant computing, dependability of systems is usually demonstrated by abstracting from failure probabilities (under simplifying assumptions on failure occurrences). In the specification framework Focus, we show under which conditions and to which extent this is sound: We use a specification language that is interpreted in the usual abstract model and in a probabilistic model. We give pr... View full abstract»

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