Business process management—the third wave: business process modelling language (bpml) and its pi-calculus foundations

This paper introduces the ideas behind BPML, the business process modelling language published by BPMI. BPML provides a process-centric (as opposed to a datacentric) metalanguage and execution model for business systems. It is underpinned by a strong mathematical foundation, the pi-calculus. The current paper is derived from supplementary appendices to a book which describes a ‘third wave’ approach to business process management [Business Process Management: The Third Wave, 2003]. The aim is to model business processes directly in an executable form, so that the mobility and mutability inherent in business behaviour is reflected and supported in the corresponding IT systems, erasing the present IT-business divide.     

HCI ‘Intraface Model’ for System Design

We outline an alternative model of the interface in HCI, the ‘intraface’, in response to design issues arising from navigational and learning problems in hypertext domains. Ours is a model of general application to computer systems. It is composed of four key elements, identifiable within a dynamic interconnected context. These are the user; his/her interests; the tools employed and the ‘ensemble’ of representations brought to bear. In this paper we sketch the present shortcomings of HCI design before outlining the background for the model which draws upon two themes in contemporary psychology, conversational analysis and ‘affordance’ realist theories in perception. This framework allows for the development of principles of cooperation, user engagement and learning in HCI environments.     

An Abstract Böhm-normalization

We study normalization by neededness with respect to ‘infinite results’, such as Böhm-trees, in an abstract framework of Stable Deterministic Residual Structures. We formalize the concept of ‘infinite results’ for finite terms as suitable sets of infinite reductions, and prove an abstract infinitary normalization theorem with respect to such sets. We also give a sufficient and necessary condition for existence of minimal normalizing reductions.     

BP''s multi-enterprise asset management system

BP is one of the largest energy companies in the world with 2003 revenues of $233 billion. In this paper, we analyse its use of an innovative ‘multi-enterprise asset management system’ that supports and enables the asset management strategy of BP's exploration and production division on the UK continental shelf (UKCS). The analysis focuses on how BP connects its business processes with over 1500 suppliers to co-ordinate the maintenance, operation and repair of specialised exploration and production equipment. The systems strategy is novel because it takes the enterprise computing concept and implements it across organisational boundaries—hence the term ‘multi-enterprise system’. This use of a shared system with all of its suppliers is distinctive from the most common way of connecting with economic partners which is to use shared data systems based on common data standards and communication technologies such as EDI and more recently XML-based systems within vertical industries such as RosettaNet. The design of the multi-enterprise system is based on a sophisticated business process management system called Maximo and this is used to illustrate the systems design aspect of the overall information system in the broader contexts of business strategy and information technology infrastructure.     

On the complexity of ω-type Turing acceptors

Turing machines are considered as recognizers of sets of infinite (ω-type) sequences, so called ω-languages. The basic results on such ω-type Turing acceptors were presented in a preceding paper. This paper focuses on the theory of deterministic ω-type Turing acceptors (ω-DTA's) which turns out to be crucially different from the ‘classical’ theory of Turing machines. It is shown that there exists no ω-DTA which is universal for all ω-DTA's. Two infinite complexity hierarchies for ω-DTA's are established, the ‘states hierarchy’, corresponding to the number of states in the machine, and the ‘designated sets hierarchy’, corresponding to the number of designated sets of states used in the recognition. Concrete examples of ω-languages characterizing each of the complexity classes are exhibited. Two additional examples of interesting ω-languages are presented:

1. (i) An ω-language which is ‘inherently non-deterministic’, i.e. can be recognized by a non-deterministic Turing acceptor but by no deterministic acceptor.

2. (ii) An ω-language which cannot be recognized even by a non-deterministic Turing acceptor.

The above examples are constructed without using diagonalization. Oscillating ω-DTA's, i.e. ω-DTA's which are allowed to oscillate on ω-inputs, are also considered and are shown to be strictly more powerful than non-oscillating ω-DTA's, yet strictly less powerful than non-deterministic ω-Turing acceptors.     

Asynchronous control of rotation and translation for a robot vehicle

Robot arms require an ‘arm controller’ to command joint motors to achieve a coordinated motion in an external Cartesian coordinate space. In the same sense, robot vehicles require a ‘vehicle controller’ to command the motors to achieve a coordinated motion specified in terms of an external Cartesian coordinate space. This paper presents the design of a general purpose vehicle controller.

The vehicle controller is designed as a three-layer structure. The top layer is an interpreter which assures a control protocol based on asynhcronous commands and independent control of orientation and forward displacement. The middle layer is a control loop which maintins an estimate of the vehicle's position and orientation, as well as their uncertainties. The control loop generates estimates and commands translation and rotation in terms of a ‘virtual vehicle’. The bottom layer is a translator between the ‘virtual vehicle’ and whatever physical vehicle on which the controller is implemented.     

FirstSTEP process modeler — a CIMOSA-compliant modeling tool

Since its market release in late 1994, the FirstSTEP toolset developed by Interfacing Technologies of Montreal, Canada has been proven to be one of the most practical solutions for business process management initiatives. Being a methodology independent enterprise modeling and simulation application, FirstSTEP has been adopted by industry leaders from such diversified sectors as manufacturing, finance, telecom, healthcare, public, and others. Its concept and approach are compatible to the framework. Most notably is the user front-end simplicity that has enabled its acceptance by the typical business manager who is not usually academic in his/her approach. The paper presents the FirstSTEP tool suite, its concept and approach and demonstrates its capabilities using an application with a most recent FirstSTEP user — America Online.     

Modelling non-functional requirements of business processes

This paper presents an approach to the identification and inclusion of ‘non-functional’ aspects of a business process in modelling for business improvement. The notion of non-functional requirements (NFRs) is borrowed from software engineering, and a method developed in that field for linking NFRs to conceptual models is adapted and applied to business process modelling. Translated into this domain, NFRs are equated with the general or overall quality attributes of a business process, which, though essential aspects of any effective process, are not well captured in a functionally oriented process model. Using an example of a healthcare process (cancer registration in Jordan). We show how an analysis and evaluation of NFRs can be applied to a process model developed with role activity diagramming (RAD) to operationalise desirable quality features more explicitly in the model. This gives a useful extension to RAD and similar modelling methods, as well as providing a basis for business improvement.     

Comparison of several discrete arithmetic schemes for simulating a constrained jet and a lab-scale tangential fired furnace

For tangential fired furnace, the false diffusion will occur when the flow is oblique to the grid lines. It is a major factor to cause serious errors to the prediction of tangential fired furnace. In order to decrease this false diffusion, this study has considered several alternative to the widely used upwind-differencing scheme with the aim of identifying which could be regarded as the most suitable in a general-purpose solving procedure for tangential furnace. The representations adopted are ‘hybrid’, ‘quick’ and ‘27-point’ treatments. Here, ‘27-point’ is a new discrete arithmetic scheme developed by the authors. All these schemes are used to simulate a constrained jet and a lab-scale tangential furnace and to compare solutions with the datum. Overall, the ‘27-point’ approximation emerged as the most satisfactory for simulating tangential furnace.     

Strategic reasoning about business models: a conceptual modeling approach

Strategic reasoning about business models is an integral part of service design. In fast moving markets, businesses must be able to recognize and respond strategically to disruptive change. They have to answer questions such as: what are the threats and opportunities in emerging technologies and innovations? How should they target customer groups? Who are their real competitors? How will competitive battles take shape? In this paper we define a strategic modeling framework to help understand and analyze the goals, intentions, roles, and the rationale behind the strategic actions in a business environment. This understanding is necessary in order to improve existing or design new services. The key component of the framework is a strategic business model ontology for representing and analyzing business models and strategies, using the i* agent and goal oriented methodology as a basis. The ontology introduces a strategy layer which reasons about alternative strategies that are realized in the operational layer. The framework is evaluated using a retroactive example of disruptive technology in the telecommunication services sector from the literature.     

Neural networks deterioration models for serviceability condition of buried stormwater pipes

Buried stormwater pipe networks play a key role in surface drainage systems for urban areas of Australia. The pipe networks are designed to convey water from rainfall and surface runoff only and do not transport sewage. The deterioration of stormwater pipes is commonly graded into structural and serviceability condition using CCTV inspection data in order to recognize two different deterioration processes and consequences. This study investigated the application of neural networks modelling (NNM) in predicting serviceability deterioration that is associated with reductions of pipe diameter until a complete blockage. The outcomes of the NNM are predictive serviceability condition for individual pipes, which is essential for planning proactive maintenance programs, and ranking of pipe factors that potentially contribute to the serviceability deterioration. In this study the Bayesian weight estimation using Markov Chain Monte Carlo simulation was used for calibrating the NNM on a case study in order to account for the uncertainty often encountered in NNM's calibration using conventional back-propagation weight estimation. The performance and the ranked factors obtained from the NNM were also compared against a classical model using multiple discrimination analysis (MDA). The results showed that the predictive performance of the NNM using Bayesian weight estimation is better than that of the NNM using conventional backpropagation and MDA model. Furthermore, among nine input factors, ‘pipe age’ and ‘location’ appeared insignificant whilst ‘pipe size’, ‘slope’, ‘the number of trees’ and ‘climatic condition’ were found consistently important over both models for serviceability deterioration process. The remaining three factors namely, ‘structure’, ‘soil’ and ‘buried depth’ might be redundant factors. A better and more consistent data collection regime may help to improve the predictive performance of the NNM and identify the significant factors.     

Getting to know each other—Artificial social intelligence for autonomous robots

This paper proposes a research direction to study the development of ‘artificial social intelligence’ of autonomous robots which should result in ‘individualized robot societies’. The approach is highly inspired by the ‘social intelligence hypothesis’, derived from the investigation of primate societies, suggesting that primate intelligence originally evolved to solve social problems and was only later extended to problems outside the social domain. We suggest that it might be a general principle in the evolution of intelligence, applicable to both natural and artificial systems. Arguments are presented why the investigation of social intelligence for artifacts is not only an interesting research issue for the study of biological principles, but may be a necessary prerequisite for those scenarios in which autonomous robots are integrated into human societies, interacting and communicating both with humans and with each other. As a starting point to study experimentally the development of robots' ‘social relationships’, the investigation of collection and use of body images by means of imitation is proposed. A specific experimental setup which we use to test the theoretical considerations is described. The paper outlines in what kind of applications and for what kind of robot group structures social intelligence might be advantageous.     

Design of ‘softer’ robust nonlinear control laws

We show that the Lyapunov function used in backstepping feedback designs for uncertain nonlinear systems leads to unnecessarily ‘hard’ control laws having undesirable high-gain properties. We present a new Lyapunov function and use it to design ‘softer’ control laws which exhibit the high-gain properties to a much lesser extent. We show that the ‘soft’ designs eliminate the chattering exhibited by the ‘hard’ designs and achieve the same or better performance with less control effort.     

A linear-complexity reparameterisation strategy for the hierarchical bootstrapping of capabilities within perception–action architectures

Perception–action (PA) architectures are capable of solving a number of problems associated with artificial cognition, in particular, difficulties concerned with framing and symbol grounding. Existing PA algorithms tend to be ‘horizontal’ in the sense that learners maintain their prior percept–motor competences unchanged throughout learning. We here present a methodology for simultaneous ‘horizontal’ and ‘vertical’ perception–action learning in which there additionally exists the capability for incremental accumulation of novel percept–motor competences in a hierarchical fashion.The proposed learning mechanism commences with a set of primitive ‘innate’ capabilities and progressively modifies itself via recursive generalising of parametric spaces within the linked perceptual and motor domains so as to represent environmental affordances in maximally-compact manner. Efficient reparameterising of the percept domain is here accomplished by the exploratory elimination of dimensional redundancy and environmental context.Experimental results demonstrate that this approach exhibits an approximately linear increase in computational requirements when learning in a typical unconstrained environment, as compared with at least polynomially-increasing requirements for a classical perception–action system.     

Analysing and modelling train driver performance

Arguments for the importance of contextual factors in understanding human performance have been made extremely persuasively in the context of the process control industries. This paper puts these arguments into the context of the train driving task, drawing on an extensive analysis of driver performance with the Automatic Warning System (AWS). The paper summarises a number of constructs from applied psychological research thought to be important in understanding train driver performance. A ‘situational model’ is offered as a framework for investigating driver performance. The model emphasises the importance of understanding the state of driver cognition at a specific time (‘Now’) in a specific situation and a specific context.     

CIPP — a versatile analytical model for VBR traffic

Correlated interarrival time Poisson process (CIPP) has been proposed in Proceedings of the Fifth Biennial Conference on Signal Processing and Communications (SPCOM’99), IISc, Bangalore, July 1999, pp. 43–50; J. Indian Inst. Sci. 79 (3) (1999) 233–249] for modeling both the composite arrival process of packets in broadband networks and the individual video source modeling. The CIPP — a generalization of the Poisson process — is a stationary counting process and is parameterized by correlation parameter ‘ρ’, the degree of correlation in adjacent interarrivals and ‘λ’, the intensity of the process. In this paper, we develop the theory for CIPP/M/1 queue and undertake the performance modeling of statistical multiplexer with VBR video traffic in broadband networks using the CIPP/M/1 queue. We first derive the expressions for stationary distributions for queue length and waiting time in a CIPP/M/1 queue. Then, we derive the queuing performance measures of interest. For reasons of feasibility of theoretical performance modeling and realistic compulsions, we propose a deterministic smoothing with random (geometrically distributed) packet sizes. We simulate a queue with (thus smoothed) VBR video trace data as input to compare with the theoretical performance measures derived above. Experimental results show that the CIPP/M/1 queue models well the statistical multiplexer performance with the real-world MPEG-1 VBR video traffic input.     

Fast Riccati equation solutions: Partitioned algorithms

In this paper, using the ‘partitioning’ approach to estimation, exceptionally robust and fast computational algorithms for the effective solution of continuous Riccati equations are presented. The algorithms have essentially a decomposed or ‘partitioned’ structure which is both theoretically interesting as well as computationally attractive. Specifically, the ‘partitioned’ solution is given exactly in terms of a set of elemental solutions which are both simple as well as completely decoupled from each other, and as such computable in either a parallel or serial processing mode. Moreover, the overall solution is given by a simple recursive operation of the elemental solution. Extensive computer simulation has shown that the ‘partitioned’ algorithm is numerically very effective and robust, especially in the case of ill-conditioned Riccati solutions, e.g. for ill-conditioned initial conditions, or for stiff system matrices. Further, the ‘partitioned’ algorithm is very fast, ranging up to several orders of magnitude faster than the corresponding Runge-Kutta algorithm.     

Defining a taxonomy of output modalities from an HCI perspective

The paper addresses an issue that must be resolved to produce a scientifically sound and practically useful reference model for intelligent multimedia presentation systems (IMP systems), namely that of providing, from the point of view of Human-Computer Interaction (HCI), a systematic understanding of the types of output information to be presented by IMP systems. The term ‘medium’, as it is used in the context of multimedia systems, is too coarse-grained for distinguishing between different types of output information. The paper introduces the notion of (representational) ‘modalities’ to enable sufficiently fine-grained distinctions to be made. For the term itself to be meaningful, ‘multimodal’ presentations must be composed of unimodal representations. In the approach presented, unimodal representations are defined from a small number of basic properties whose combinations specify the ‘generic’ level of a taxonomy of unimodal output modalities. Additional basic property distinctions serve to generate the more fine-grained ‘atomic’ and ‘sub-atomic’ levels in a hierarchical fashion. The taxonomy is set up with the aim of satisfying four basic requirements, viz. completeness, orthogonality, relevance and intuitiveness. A concluding discussion illustrates the practical use of the taxonomy.