By Topic

Proceedings 1998 International Conference on Application of Concurrency to System Design

23-26 March 1998

Filter Results

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

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (250 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1998, Page(s):295 - 296
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Logic and functional verification in a commercial semiconductor environment

    Publication Year: 1998, Page(s):8 - 15
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    Functional verification is one of the key bottlenecks in the rapid design of integrated circuits. It is estimated that verification in its entirety accounts for up to 60% of design resources, including duration, computer resources and total personnel. The three primary tools used in logic and functional verification of commercial integrated circuits are simulation (at various levels), emulation at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining structural and symbolic methods for the verification of concurrent systems

    Publication Year: 1998, Page(s):2 - 7
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    The contributions during the last few years on the structural theory of Petri nets can now be applied to formal verification. The structural theory provides methods to find efficient encoding schemes for symbolic representations of the reachable markings. It also provides approximations of the state space that allow one to alleviate many bottlenecks in the calculation of the reachability set by br... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical concurrent finite state machines in Ptolemy

    Publication Year: 1998, Page(s):34 - 40
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is successfully integrated with synchronous dataflow (SDF) and discrete event (DE) concurrency domains in Ptolemy. In this heterogeneous combination, the semantics of FSM, concurrency and hierarchy are naturally supported in a mann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System-level design models and implementation techniques

    Publication Year: 1998, Page(s):24 - 32
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    Electronic systems need to accommodate rapidly changing product specifications and to reduce design costs together with design turn-around time. To be able to reuse part of previous designs and to be able to include new functionality rapidly, system designers tend to use microcontrollers and digital signal processors (DSPs) as much as possible. For performance reasons they may be forced to design ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculating place capacity for Petri nets using unfoldings

    Publication Year: 1998, Page(s):143 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    Though Petri nets have powerful mathematical verification ability, we have to construct the state space in many cases. An upper bound of a place is the maximum number of tokens on the place for all reachable markings. We can find the upper bound by using a reachability graph or S-invariants. This paper proposes a method to find the upper bound by using an unfolding, and a comparison is made among ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing extensions of STG model and a method to simulate timed STG behavior in VHDL environment

    Publication Year: 1998, Page(s):120 - 129
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    This paper includes an overview of the signal transition graph (STG) model extensions that makes it possible to specify switching and signal propagation delays in an STG. The correspondence of the STG timing models to asynchronous circuit implementation is considered. A method to simulate the behavior specified by consistent and bounded timed STG in a VHDL environment is proposed. For illustration... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic lights-an AutoFocus case study

    Publication Year: 1998, Page(s):282 - 294
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    In this paper, we present a case study on AutoFocus, a prototype tool for the development of distributed and concurrent systems based on the concepts of the formal method Focus. We develop (specify, consistency-check and simulate) the controller of a set of pedestrian traffic lights using different graphical description techniques to illustrate an engineering process for concurrent systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal verification of real-time software by symbolic model-checker

    Publication Year: 1998, Page(s):99 - 108
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    Verifications of real-time software are important. However, the state explosion problem is serious for model checking verifications. We present a symbolic model checking algorithm for real-time software, which can check CTL properties without computing exact states. Based on an approximation method, we formulate an approximation/refinement procedure for symbolic model checking, which recursively c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive nets in the box algebra

    Publication Year: 1998, Page(s):239 - 249
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    This paper presents an approach to giving a formal meaning to Petri nets defined using recursive equations. It specifically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper presents a detailed investigation of the solvability of recursive equations on nets in a setting which allows an infinite number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to make concurrent programs highly reliable-more than state space analysis

    Publication Year: 1998, Page(s):16 - 23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    Several approaches to making concurrent programs highly reliable are surveyed. State space analysis including model checking is the most promising formal verification approach for concurrent programs. However, it is not the only such method for actual program development. The paper focuses on harmful nondeterministic behaviors of concurrent programs and introduces three advanced approaches (testin... View full abstract»

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

    Publication Year: 1998, Page(s):41 - 51
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled system. In particular it presupposes the successful communication between the customer and the software expert. To enhance this communication most modern software engineering methods recommend specification of the different as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying state coding conflicts in asynchronous system specifications using Petri net unfoldings

    Publication Year: 1998, Page(s):152 - 163
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as signal transition graphs (STGs), which are a special kind of labelled Petri nets. The paper develops a method for identifying state coding conflicts in STGs that is intended to work within a new synthesis framework based on Petri net unfolding. The latter offers potent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient approach to symbolic state exploration of complex parallel controllers

    Publication Year: 1998, Page(s):132 - 142
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    In this paper a method based on the use of zero-suppressed BDDs (0-Sup-BDDs) to symbolic state space exploration of parallel controllers is presented. Unlike traditional methods, the new approach is based on the implicit manipulation of sets of states instead of the manipulation of their characteristic functions. A formal specification of the parallel controller is given in the form of an interpre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating the verification of timing, performance and correctness properties of concurrent systems

    Publication Year: 1998, Page(s):109 - 119
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Previous methods of verification tend to keep correctness, timing and performance separate. We present a process algebra based methodology for the integrated modelling and verification of correctness, performance and timing properties of concurrent systems. We have applied the method to the domain of asynchronous hardware and used an asynchronous micropipeline as an illustrative example View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A presentation of regular languages in the assumption-commitment framework

    Publication Year: 1998, Page(s):250 - 260
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    A distributed presentation of a regular language L is a system of communicating automata accepting L, where the constraint on distribution is given in the form of a distributed alphabet. We study such presentations in the assumption-commitment framework, where each process makes assumptions about other processes in the system. Symmetrically, each process makes commitments which the other processes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A translation of Statecharts into Signal

    Publication Year: 1998, Page(s):52 - 62
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The languages for modeling reactive systems can be divided in two styles: the imperative ones and the declarative ones. The paper shows a way to translate a Statecharts specification (imperative) to a Signal one (declarative, equational, synchronous). This translation gives access to the Signal tools from a Statecharts specification: verification, efficient/distributed/compact code generation usin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using object-oriented algebraic nets for the reverse engineering of Java programs: a case study

    Publication Year: 1998, Page(s):166 - 176
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The problem addressed in this paper is the following: how to use high-level Petri nets for the reverse engineering of implemented distributed applications. The paper presents a reverse engineering methodology applied on a real (simple) Java applet based client/server application. First, starting from the Java program, several abstraction steps are described using the CO-OPN/2 formal specification ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and analyzing interorganizational workflows

    Publication Year: 1998, Page(s):262 - 272
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    Workflow management systems are a key technology for improving the effectivity and efficiency of businesses processes within one organization. Today's workflow management systems focus on processes which are circumscribed by the bounds of an organization. However, most workflows cross organizational boundaries. Workflows may interact with individual customers, suppliers, subcontractors and governm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of parameterized asynchronous circuits: a case study

    Publication Year: 1998, Page(s):64 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    We demonstrate the normal verification of a parameterized asynchronous circuit which has request and acknowledgment controls through data paths. We propose a new encoding technique of the data path and construct a finite abstracted model. The properties expressed by ACTL formulas are model checked in the abstracted model, and then the correctness of the abstraction is mechanically proven using PVS View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving correctness of distributed algorithms using high-level Petri nets-a case study

    Publication Year: 1998, Page(s):177 - 186
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    We argue that high-level Petri nets are well suited for the representation of distributed algorithms as well as for correctness proofs. To this end, we provide a simple definition of high-level Petri nets, a way to formulate message passing algorithms in this notion, a temporal logic style language for the formulation of properties, and a proof technique which combines techniques from Petri net th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Java-based formal development environment for factory communication systems

    Publication Year: 1998, Page(s):273 - 281
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    Reports on an ongoing project aimed at defining a development environment for factory communication systems which combines the OOA&D (object-oriented analysis and design) and OMT (Object Modeling Technique) reference methodologies with the use of formal methods for concurrent and distributed systems, and uses the Java language in various development phases, from specification to implementation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unbounded verification results by finite-state compositional techniques: 10any states and beyond

    Publication Year: 1998, Page(s):75 - 85
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    The article describes how to use process algebraic compositional finite state verification techniques for infinite parameterised families of systems. The parameter is incremented by adding a new process, and automated techniques establish that this does not change the externally observable behaviour. Therefore, all systems in the family behave identically. Channel fairness and independence of retr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying fault tolerance of distributed algorithms formally-an example

    Publication Year: 1998, Page(s):187 - 197
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    It is shown how fault-tolerant distributed algorithms can be formally verified using the Petri net based verification framework DAWN. A complete example study, the verification of a distributed self diagnosis algorithm, is presented to demonstrate the benefits of the proposed approach View full abstract»

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