A linear translation from CTL* to the first-order modal μ -calculus

The modal μ-calculus is a very expressive temporal logic. In particular, logics such as LTL, CTL and CTL* can be translated into the modal μ-calculus, although existing translations of LTL and CTL* are at least exponential in size. We show that an existing simple first-order extension of the modal μ-calculus allows for a linear translation from LTL. Furthermore, we show that solving the translated formulae is as efficient as the best known methods to solve LTL formulae directly.     

Energetic and exergetic analysis of steam production for the extraction of coniferous essential oils

Bioenergy production is optimal when the energy production process is both efficient and benefits from local resources. Energetic and exergetic analyses are applied to highlight efficiency differences between small-size systems that are based on the co-generation of heating and power (CHP) versus the co-generation of heating and power with steam production (CHP-S). Both systems use the Organic fluid Rankine Cycle (ORC).The recovery of heat from flue gases is considered to be a way of increasing energy efficiency. In the CHP-S case, steam (at low pressure) is used to extract essential oils from fresh twigs and needles of coniferous trees throughout a steam distillation process. When the systems work at a thermal combustion power of 1350 kW, energetic analysis shows that the energy efficiency of the CHP-S plant (89.4%) is higher than that of the CHP plant (77.9%). Exergetic analysis shows that the efficiency of the CHP-S plant is 2.2% higher than that of the CHP plant.     

A syntactic commutativity format for SOS

Considering operators defined using Structural Operational Semantics (SOS), commutativity axioms are intuitive properties that hold for many of them. Proving this intuition is usually a laborious task, requiring several pages of boring and standard proof. To save this effort, we propose a syntactic SOS format which guarantees commutativity for a set of composition operators.     

Verification of a sliding window protocol in μCRL and PVS

We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS. Received November 2004 Revised June 2005 Accepted July 2005 by J. V. Tucker     

Verification of Hypertorus Communication Grids by Infinite Petri Nets and Process Algebra

A model of a hypertorus communication grid has been constructed in the form of an infinite Petri net. A grid cell represents either a packet switching device or a bioplast cell. A parametric expression is obtained to allow a finite specification of an infinite Petri net. To prove properties of an ideal communication protocol, we derive an infinite Diophantine system of equations from it, which is subsequently solved. Then we present the programs htgen and ht-mcrl2-gen, developed in the C language, which generate Petri net and process algebra models of a hypertorus with a given number of dimensions and grid size. These are the inputs for the respective modeling tools Tina and mCRL2, which provide model visualization, step simulation, state space generation and reduction, and structural analysis techniques. Benchmarks to compare the two approaches are obtained. An ad-hoc induction-like technique on invariants, obtained for a series of generated models, allows the calculation of a solution of the Diophantine system in a parametric form. It is proven that the basic solutions of the infinite system have been found and that the infinite Petri net is bounded and conservative. Some remarks regarding liveness and liveness enforcing techniques are also presented.      

MICROFABRICATION OF CYLINDRICAL ION TRAP MASS SPECTROMETER ARRAYS FOR HANDHELD CHEMICAL ANALYZERS

A new microfabrication method for micro-cylindrical ion trap (μ-CIT) mass spectrometer arrays (r_o, z_o ≅ 360 μm) is presented along with a strategy for incorporating integrated high-field emission electron sources for ionization. Simulations of the performance of μ-CITs were used to guide the geometrical design of the array, and process flows for microfabrication in silicon were developed and optimized for reduced capacitance. The microfabrication process is described in detail along with initial test results. Field emission sources were also fabricated in silicon using an edge-to-edge emission strategy to improve robustness in moderate vacuum environments. Simulations were also used to guide the design of the field emitter arrays. The microfabrication process is described and initial field emission data are presented. Strategies for further optimization and integration are also briefly discussed.     

Specification guidelines to avoid the state space explosion problem

During the last two decades, we modelled the behaviour of a large number of systems. We noted that different styles of modelling had quite an effect on the size of the state spaces of the modelled systems. The differences were so substantial that some specification styles led to far too many states to verify the correctness of the model, whereas with other styles, the number of states was so small that verification was a straightforward activity. In this article, we summarize our experience by providing seven specification guidelines to keep state spaces small. For each guideline, we provide an application, generally from the realm of traffic light controllers, for which we provide a ‘bad’ model with a large state space, and a ‘good’ model with a small state space. The good and bad models are both suitable for their purpose but are not behaviourally equivalent. For all guidelines, we discuss circumstances under which it is reasonable to apply the guidelines. Copyright © 2014 John Wiley & Sons, Ltd.     

Hiding propositional constants in BDDs

We describe an easy to implement extension to Binary Decision Diagrams. It is shown by an experiment that this extension is particularly effective in case there are many propositional constants that on an average have a small number of occurrences.     

Enzyme Fusions in Biocatalysis: Coupling Reactions by Pairing Enzymes

One approach to bringing enzymes together for multienzyme biocatalysis is genetic fusion. This enables the production of multifunctional enzymes that can be used for whole-cell biotransformations or for in vitro (cascade) reactions. In some cases and in some aspects, such as expression and conversions, the fused enzymes outperform a combination of the individual enzymes. In contrast, some enzyme fusions are greatly compromised in activity and/or expression. In this Minireview, we give an overview of studies on fusions between two or more enzymes that were used for biocatalytic applications, with a focus on oxidative enzymes. Typically, the enzymes are paired to facilitate cofactor recycling or cosubstrate supply. In addition, different linker designs are briefly discussed. Although enzyme fusion is a promising tool for some biocatalytic applications, future studies could benefit from integrating the findings of previous studies in order to improve reliability and effectiveness.