An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A New Modal Lindström Theorem

We prove new Lindstr?m theorems for the basic modal propositional language, and for some related fragments of first-order logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections with interpolation properties, and the modal invariance theorem. Mathematics Subject Classification (2000): Primary 03B45; Secondary 03C95     

Finite turns and the regular closure of linear context-free languages

Turn bounded pushdown automata with different conditions for beginning a new turn are investigated. Their relationships with closures of the linear context-free languages under regular operations are studied. For example, automata with an unbounded number of turns that have to empty their pushdown store up to the initial symbol in order to start a new turn are characterized by the regular closure of the linear languages. Automata that additionally have to re-enter the initial state are (almost) characterized by the Kleene star closure of the linear languages. For both a bounded and an unbounded number of turns, requiring to empty the pushdown store is a strictly stronger condition than requiring to re-enter the initial state. Several new language families are obtained which form a double-stranded hierarchy. Closure properties of these families under AFL operations are derived. The regular closure of the linear languages share the strong closure properties of the context-free languages, i.e., the family is a full AFL. Interestingly, three natural new language families are not closed under intersection with regular languages and inverse homomorphism. Finally, an algorithm is presented parsing languages from the new families in quadratic time.     

Properties of Quantum Languages

The class of quantum languages Q() over an alphabet is the class of languages accepted by quantum automata. We study properties of Q() and compare Q() with the class of regular languages R(). It is shown that Q() is closed under union, intersection, and reversal but is not closed under complementation, concatenation, or Kleene star. It is also shown that Q() and R() are incomparable. Finally, we prove that L Q() if and only if L admits a transition amplitude function satisfying a certain property and a similar characterization is given for R().     

Marcus contextual languages consisting of primitive words

In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars.     

Numerical calculation of an asymmetric supply function equilibrium with capacity constraints

Producers submit offer curves to a procurement auction, e.g. an electricity auction, before uncertain demand has been realised. In the supply function equilibrium (SFE), every firm commits to the offer curve that maximises its expected profit, given the offer curves of competitors. The equilibrium is given by a system of differential equations. In practice, it has been very difficult to find valid SFE, i.e. non-decreasing solutions, from this system, especially for asymmetric producers. This paper shows that valid SFE can be calculated by means of a shooting algorithm that combines numerical integration with an optimisation procedure that searches for an end-condition. Multiple/parallel shooting is used for ill-conditioned cases.     

The stochastic bid generation problem in combinatorial transportation auctions

In this paper, we deal with the generation of bundles of loads to be submitted by carriers participating in combinatorial auctions in the context of long-haul full truckload transportation services. We develop a probabilistic optimization model that integrates the bid generation and pricing problems together with the routing of the carrier’s fleet. We propose two heuristic procedures that enable us to solve models with up to 400 auctioned loads.     

First- and second-price sealed-bid auctions applied to push and pull supply contracts

We investigate a newsvendor-type retailer sourcing problem under demand uncertainty who has the option to source from multiple suppliers. The suppliers’ manufacturing costs are private information. A widely used mechanism to find the least costly supplier under asymmetric information is to use a sealed-bid reverse auction. We compare the combinations of different simple auction formats (first- and second-price) and risk sharing supply contracts (push and pull) under full contract compliance, both for risk-neutral and risk-averse retailer and suppliers. We show the superiority of a first-price push auction for a risk-neutral retailer. However, only the pull contracts lead to supply chain coordination. If the retailer is sufficiently risk-averse, the pull is preferred over the push contract. If suppliers are risk-averse, the first-price push auction remains the choice for the retailer. Numerical examples illustrate the allocation of benefits between the retailer and the (winning) supplier for different number of bidders, demand uncertainty, cost uncertainty, and degree of risk-aversion.     

基于改进的粗糙集条件信息熵和灰关联投影法的工程项目投标决策研究

投标决策是建筑企业面临的一大难题.在分析建设工程投标风险因素的基础上,提出一种基于改进的粗糙集条件信息熵和灰关联投影法的投标决策方法.文中投标风险因素的客观权重经两次修正,更具全面性和合理性;然后结合依靠专家经验确定的主观权重得到综合权重;最后将综合权重应用于灰关联投影法进行投标决策.通过应用实例,验证决策方法的可操作性和合理性,为承包商实际的投标工作提供一定的借鉴和参考.