By Topic

2011 Eleventh International Conference on Application of Concurrency to System Design

20-24 June 2011

Filter Results

Displaying Results 1 - 25 of 32
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (41 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (136 KB)
    Freely Available from IEEE
  • Message from the Conference Chairs

    Publication Year: 2011, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (101 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organizers

    Publication Year: 2011, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2011, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Additional Reviewers

    Publication Year: 2011, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Invited talks [2011 11th International Conference on Application of Concurrency to System Design]

    Publication Year: 2011, Page(s):xii - xiv
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (97 KB)

    These invited talks discuss the following: STG Decomposition and Its Correctness; Asynchronous Network-On-Chip and its Potential. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Generating *-Sound Nets with Substitution

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

    We present a method for hierarchically generating sound work flow nets by substitution of nets with multiple inputs and outputs. We show that our method is correct and generalizes the class of nets generated by other hierarchical approaches. We identify a notion of soundness that is preserved by such substitutions and correct a small omission in an earlier similar method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameterized Partial Orders for Modeling Embedded System Use Cases: Formal Definition and Translation to Coloured Petri Nets

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

    Model-driven Design-Space Exploration (DSE) for embedded systems has proven to speed up system design and improve quality. Parameterized Partial Orders (PPOs) are a simple yet powerful conservative extension of classical partial orders. They serve as an intermediate representation in our Octopus tool set, allowing to capture applications from different domains and enabling analysis with various to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checking Non-divergence, Channel-Bound and Global Cooperation Using SAT-Solvers

    Publication Year: 2011, Page(s):19 - 28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    Divergence appears in message sequence chart specifications when an unbounded number of messages are pending within a communication channel. Several algorithms and tools have been already developed to detect this property. This paper explains why checking non-divergence is very close to the Boolean satisfiability problem and shows how SAT-solvers can be used to check this property efficiently. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds: From Parameterised to Finite-State Verification

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

    Bounds is a tool that enables parameterised verification by determining cut-offs for the values of parameters and generating the specification and system instances up to the cut-offs. After that, the verification can be completed by using an existing finite-state verification tool. A unique feature of Bounds is that it allows multiple and topology related parameters and terminates on every input. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compositional Analysis for Weak Stubborn Sets

    Publication Year: 2011, Page(s):36 - 43
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    Partial order reduction methods rely on expanding a state space only partially, exploring representatives of sets of executions of a system. The methods differ at least in three respects:the set of properties that are preserved, the notions of interaction between transitions, and the methods of selecting the representative transitions. We explore an existing but less studied method of weak stubbor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building Tight Occurrence Nets from Reveals Relations

    Publication Year: 2011, Page(s):44 - 53
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB) | HTML iconHTML

    Occurrence nets are a well known partial order model for the concurrent behavior of Petri nets. The causality and conflict relations between events, which are explicitly represented in occurrence nets, induce logical dependencies between event occurrences: the occurrence of an event e in a run implies that all its causal predecessors also occur, and that no event in conflict with e occurs. But the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-Based Fitness in Conformance Checking

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

    Experience in business process analysis shows that operational processes often do not conform to process models. Although classical conformance checking techniques can identify deviations of process executions from predefined models, they may produce inaccurate results due to strong assumptions. In this paper, we present a robust conformance checking technique based on Petri net techniques allowin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-Time Concurrency Tuning for Peak Power Modulation in Energy Harvesting Systems

    Publication Year: 2011, Page(s):67 - 76
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    An energy harvesting system (EHS) delivers a nondeterministic power density over a range of explicit environmental conditions. The computational architecture is required to be tunable and optimized at run-time in order to adapt the power supply and, simultaneously, deliver optimal performance. In this paper, an important aspect of the supply-consumption relation inEHS is considered, that the trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Runtime Programming through Model-Preserving, Scalable Runtime Patches

    Publication Year: 2011, Page(s):77 - 86
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB) | HTML iconHTML

    We consider a methodology for flexible software design, runtime programming, defined by recurrent, incremental software modifications to a program at runtime, called runtime patches. The principles we consider for runtime programming are model preservation and scalability. Model preservation means that a runtime patch preserves the programming model in place for programs -- in terms of syntax, sem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded Fairness for Probabilistic Distributed Algorithms

    Publication Year: 2011, Page(s):89 - 97
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    This paper investigates quantitative dependability metrics for distributed algorithms operating in the presence of sporadic or frequently occurring faults. In particular, we investigate necessary revisions of traditional fairness assumptions in order to arrive at useful metrics, without adding hidden assumptions that may obfuscate their validity. We formulate faulty distributed algorithms as Marko... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Probabilistic Model of the LMAC Protocol for Concurrent Wireless Sensor Networks

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

    We present a probabilistic model for the network setup phase of the Lightweight Medium Access Protocol (LMAC) for concurrent Wireless Sensor Networks. In the network setup phase, time slots are allocated to the individual sensors through resolution of successive collisions. The setup phase involving collisions should preferably be as short as possible for efficiency and energy consumption reasons.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Supervisory Control of Interactive Markov Chains: Controllability

    Publication Year: 2011, Page(s):108 - 117
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    We propose a model-based systems engineering framework for supervisory control of stochastic discrete-event systems with unrestricted nondeterminism. We intend to develop the proposed framework in four phases outlined in this paper. Here, we study in detail the first step which comprises investigation of the underlying model and development of a corresponding notion of controllability. The model o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Results on Abstract Probabilistic Automata

    Publication Year: 2011, Page(s):118 - 127
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    Probabilistic Automata (PAs) are a recognized framework for modeling and analysis of nondeterministic systems with stochastic behavior. Recently, we proposed Abstract Probabilistic Automata (APAs) -- an abstraction framework for PAs. In this paper, we discuss APAs over dissimilar alphabets, a determinisation operator, conjunction of non-deterministic APAs, and an APA-embedding of Interface Automat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Parallel Composition of Labelled Petri Nets

    Publication Year: 2011, Page(s):131 - 140
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (349 KB) | HTML iconHTML

    Parallel composition of labelled Petri nets is a fundamental operation in modular design. It is often used to combine models of subsystems into a model of the whole system. Unfortunately, the standard definition of parallel composition almost always yields a 'messy' Petri net, with many implicit places, causing performance deterioration in tools that are based on structural methods. In this paper ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • STG Decomposition: Partitioning Heuristics

    Publication Year: 2011, Page(s):141 - 150
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    STG decomposition is well-known as a promising approach to tackle complexity issues in logic synthesis of asynchronous circuits. It is guided by a partition of output signals and generates a component STG for each partition member. Using the finest partition - one output per component - the resulting circuits might not be optimal (e.g. in terms of area). We present very efficient heuristics to get... View full abstract»

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