We introduce the notion of twisted jet. For a DeligneMumford stack X of finite type over an algebraically closed field k, a twisted ∞-jet on X is a representable morphism D → X such that D is a smooth Deligne-Mumford stack with the coarse moduli space Spec k[[t]]. We study the motivic measure on the space of the twisted ∞-jets on a smooth Deligne-Mumford stack. As an application, we prove that ...

We introduce a natural extension of collapsible pushdown systems called annotated pushdown systems that replaces collapse links with stack annotations. We believe this new model has many advantages. We present a saturation method for global backwards reachability analysis of these models that can also be used to analyse collapsible pushdown systems. Beginning with an automaton representing a se...

We describe a general method for deciding bisimilarity for pairs of processes where one process has finitely many states. We apply this method to pushdown processes and to PA processes. We also demonstrate that the mentioned problem is undecidable for ‘state-extended’ PA processes.

Polarimetric SAR data provide information about the scattering of the area observed. The availability of data stacks allows the identification of stable targets and subsequent scattering analysis with a high degree of confidence at full resolution. A novel approach to find and evaluate polarimetric persistent target is presented, that is an extension of well-established analysis methods for sin...

This paper presents a composition method for stack-attributed tree transducers. Stackattributed tree transducers extend attributed tree transducers with a pushdown stack device for attribute values. Stack-attributed tree transducers are more powerful than attributed tree transducers due to the stack mechanism. We extend the existing composition method for attributed tree transducers to the comp...

We study two-player zero-sum games over infinite-state graphs with boundedness conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi games, and finite-memory suffices for finitary parity games. We then study pushdown boundedness...

We present a tool for finding errors in Java programs that translates Java bytecodes into symbolic pushdown systems, which are then checked by the Moped tool [1].

A type system is introduced for a strict but expressive subset of Java in order to infer resource upper bounds on both the heap-space and the stack-space requirements of typed programs. This type system is inspired by previous works on Implicit Computational Complexity, using tiering and noninterference techniques. The presented methodology has several advantages. First, it provides explicit po...

In this paper, the interdisciplinary energy harvesting issues on piezoelectric energy harvesting were investigated using a ‘33’ mode (mechanical stress and/or electric field are in parallel to the polarization direction) lead zirconate titanate multilayer piezoelectric stack (PZT-Stack). Key energy harvesting characteristics including the generated electrical energy/power in the PZT-Stack, the ...