We present a powerful procedure for determining both the dominant dynamics of the inputoutput transfer and the corresponding most influential circuit parameters of a linear(ized) circuit. The procedure consists of several steps in which a specific (sub)problem is solved and its solution is used in the next step. We combine regression tools techniques and trade off analysis with recent technique...

Many problems in modern interconnect and packaging design require use of ‘full-wave’ modeling in order to get a good accuracy at high frequencies. In this paper we will introduce passive Arnoldy based model order reduction algorithm for such systems.

We propose a partial order reduction for model checking security protocols for the secrecy property. Based on this reduction we develop an automatic tool that can check security protocols for secrecy, given a finite execution scenario. We compare this tool to several other tools.

Definition 1.6. Preemption-bound persistent sets. A set T ⊆ T of transitions enabled in a state s = final(S) is preemption-bound persistent in s iff for all nonempty sequences α of transitions from s in AG(Pb,c) such that ∀i ∈ dom(α), αi 6∈ T and for all t ∈ T , 1. Pb(S.t) ≤ Pb(S.α1) 2. if Pb(S.t) < Pb(S.α1), then t↔ last(α) and t↔ next(final(S.α), last(α).tid) 3. if Pb(S.t) = Pb(S.α1), then ex...

We present a new approach to combine partial order reduction with fairness in the context of LTL model checking. For this purpose, we define several behaviour classes representing typical fairness assumptions and examine how various reduction techniques affect these classes. In particular, we consider both reductions preserving all behaviours and reductions preserving only some behaviours.