Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

Proceedings. Fourth International Conference on Application of Concurrency to System Design, 2004. ACSD 2004.

16-18 June 2004

Filter Results

Displaying Results 1 - 25 of 34
  • A behavioural type inference system for compositional system-on-chip design

    Publication Year: 2004, Page(s):47 - 56
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB) | HTML iconHTML

    The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc system-level design methodologies, that lifts modeling to higher levels of abstraction, and the concept of intellectual property (IP), that promotes reuse of existing components, are essential steps to manage design comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buffered asynchronous communication mechanisms

    Publication Year: 2004, Page(s):36 - 44
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    Previous work on asynchronous communication mechanisms (ACMs) has not dealt with buffered forms (n > l). This paper describes a systematic design/synthesis process for ACMs with arbitrary buffer size, a series of resulting buffered ACM algorithms, and the modelling and simulation of these ACMs using Matlab, putting ACMs (esp. buffered ones) in the context of complex engineering systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A front-end tool for automated abstraction and modular verification of actor-based models

    Publication Year: 2004, Page(s):145 - 148
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Actor-based modeling is known to be an appropriate approach for representing concurrent and distributed systems. Rebeca is an actor-based language with a formal foundation, based on an operational interpretation of the actor model. We develop a front-end tool for translating a subset of Rebeca to SMV in order to model check Rebeca models. Automated modular verification and abstraction techniques a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Property checking based on hierarchical integer

    Publication Year: 2004, Page(s):26 - 35
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (423 KB) | HTML iconHTML

    This article describes a high level model of digital circuits for application of formal verification properties at this level. In our method, a behavioral state machine is represented by a multiplexer based structure of linear integer equations, and RT level properties are directly applied. It reduces the need for large BDD data structures and uses far less memory. Furthermore, there is no need to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semantics of Security Protocol Language (SPL) using a class of composable high-level Petri nets

    Publication Year: 2004, Page(s):99 - 108
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    This paper aims at introducing a Petri net semantics of security protocols allowing to study their properties formally. This is obtained by means of an economic but expressive class of composable high-level Petri nets, called S-nets, inspired from works about the relationship between Petri nets and process algebras. S-nets are applied then to give a compositional high-level Petri net semantics to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nested emptiness search for generalized Buchi automata

    Publication Year: 2004, Page(s):165 - 174
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    We generalize the classic explicit state emptiness checking algorithm for Buchi word automata (the "nested depth-first search") into Buchi automata with multiple acceptance conditions. Bypassing an explicit acceptance condition reduction improves the algorithm's worst case memory requirements. The generalized algorithm is compatible with well-known probabilistic explicit state model checking techn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the practicality and desirability of highly-concurrent, mostly-functional programming

    Publication Year: 2004, Page(s):115 - 124
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    We propose the practicality and desirability of a programming style, ravelling. Ravelling makes extensive use of threads with mostly functional code computing local state. By passing values across channels other threads induce an owning thread to change state or report information about itself Our experience suggests that ravelling makes for flexibility in design and relative ease in introducing n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Translating Erlang to μCRL

    Publication Year: 2004, Page(s):135 - 144
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (353 KB) | HTML iconHTML

    The language Erlang has been developed by Ericsson to implement large switching systems. Erlang is nowadays used by several companies for complex embedded systems. The language μCRL is a process algebra with data. Several verification tools are available for μCRL and other process algebras, including a tool to create labelled transition systems from μCRL specifications. By having a transl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic synthesis for asynchronous circuits based on Petri net unfoldings and incremental SAT

    Publication Year: 2004, Page(s):16 - 25
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 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 deriving equations for logic gates implementing each output signal of the circuit. This is usually done using reachability graphs. In this paper, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification and implementation of delay-insensitive processes in restrictive environments

    Publication Year: 2004, Page(s):89 - 98
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    A delay-insensitive module communicates with its environment through wires of unbounded delay. The environment may only need to interact with the module in a restricted way. it is worthwhile taking this into account when synthesising the module because it may allow for a cheaper, faster implementation. Formally, we introduce an operator to DI-algebra which weakens the specification of a module by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arrays and contracts for the specification and analysis of regular systems

    Publication Year: 2004, Page(s):57 - 66
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    We explore a structuring mechanism for reactive systems, based on two ideas: array iterators allow the description of regular systems; logical-time contracts allow local or global specifications of components. We describe a toolbox of automatic program manipulations able to exploit the regular structures and the contracts in order to help validating the system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence verification of timed transition models

    Publication Year: 2004, Page(s):155 - 164
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB) | HTML iconHTML

    This paper describes how the timed automata modeling environment (TAME) has been modified to provide a formal model for time transition models (TTMs) in the PVS proof checker. State-event equivalences (extensions of Milner's observation equivalences) are also formalized in PVS for state-event labeled transition systems (SELTS), the underlying semantic model of TTMs. These theories are used to veri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New orbit algorithms for data symmetries

    Publication Year: 2004, Page(s):175 - 184
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (413 KB) | HTML iconHTML

    State space symmetries can be exploited in model checking of concurrent systems by identifying states that are equivalent under the symmetries. The core problem during the generation of the symmetry reduced state space is to determine whether two states are equivalent, or alternatively, to transform states into equivalent, canonical representatives. This paper introduces new algorithms for these o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rialto to B: an exercise in formal development of a language for multiple models of computation

    Publication Year: 2004, Page(s):125 - 134
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Rialto is a textual language for modeling heterogeneous systems, where different computational models are represented by scheduling policies that manage concurrent activities in the system. Rialto has a formal semantics defined using structured operational rules, which allows for the application of formal verification techniques to programs in the language. We show that the B method is suitable fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced interleaved multithreaded multiprocessors and their performance analysis

    Publication Year: 2004, Page(s):7 - 15
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    In interleaved multithreading, the thread changes in each processor cycle, consecutive instructions are issued from different threads, and no data dependencies can stall the pipeline. Enhanced interleaved multithreading maintains a number of additional threads which are used to replace an active thread when it initiates a long-latency operation. Instruction issuing slots, which are lost in pure in... View full abstract»

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

    Publication Year: 2004, Page(s):67 - 76
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (550 KB) | HTML iconHTML

    In this paper we introduce the notion of weak endochrony, which extends to a synchronous setting the classical theory of Mazurkiewicz traces. The notion is useful in the synthesis of correct-by-construction communication protocols for globally asynchronous, locally synchronous (GA LS) systems. The independence between various computations can be exploited here to provide communication schemes that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular analysis of systems composed of semiautonomous subsystems

    Publication Year: 2004, Page(s):185 - 194
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (494 KB) | HTML iconHTML

    This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analysis in the determination of reachable states with specified partial markings, to determine possible deadlocks, both global and local, and also liveness. These algorithms have been implemented in a prototype tool which has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context-based process algebras for mobility

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

    In this paper we provide two new formalisations of the finite fragment of the π-calculus, defined in a way which exhibits the global state and the execution context of a process without needing to rely heavily on term rewriting techniques. In doing so, we aim at a calculus which would be amenable to a straightforward compositional translation into automata-based models such as Petri nets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BMC via dynamic atomicity analysis

    Publication Year: 2004, Page(s):197 - 206
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    This work presents a nonstandard execution model and its proportional encoding for effective bounded model checking of reachability properties. The execution model allows several visible actions from a single system component to be merged dynamically to an atomic block. Thus the bound needed to detect a violation of a property can be reduced. An implementation and results from several test cases a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating symbolic traversal algorithms applied to asynchronous concurrent systems

    Publication Year: 2004, Page(s):207 - 216
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    Symbolic reachability analysis based on binary decision diagrams (BDDs) is a technique that allows the implementation of efficient invariant checking algorithms, and improves the performance of CTL/LTL verification. However, in practice it is well known that the BDD blowup problem limits the size of the systems that can be successfully verified. Along the years multiple variants of the basic reach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guided model checking with a Bayesian meta-heuristic

    Publication Year: 2004, Page(s):217 - 226
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    This work presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by applying the empirical Bayes method to revise heuristic estimates of the distance from a given state to an error state. Guided search using the revised estimates finds errors with less search effort than the original estimates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings. Fourth International Conference on Application of Concurrency to System Design

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (165 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2004, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Proceedings Fourth International Conference on Application of Concurrency to System Design

    Publication Year: 2004, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (191 KB)
    Freely Available from IEEE