Application of Simulation of Dining Philosophers Problem in Concurrent Process

A classic simulation that can describe concurrent processes on an operating system is the dining philosopher problem. In the dining philosophers problem, there is the possibility of a deadlock, a condition in which two or more processes cannot continue their execution. This research produces a software application that can simulate the concurrent process and prevent deadlock problems that occur. The benefit of the simulation in this study is as a visualization of the completion of dining philosophers problems and as an additional facility in the teaching and learning process, especially in operating system course

Analysing Coloured Petri Nets by the Occurrence Graph Method

This paper provides an overview og the work done for the author's PhD thesis. The research area of Coloured Petri Nets is introduced, and the available analysis methods are presented. The occurrence graph method, which is the main subject of this thesis, is described in more detail. Summaries of the six papers which, together with this overview, comprise the thesis are given, and the contributions are discussed.A large portion of this overview is dedicated to a description of related work. The aim is twofold: First, to survey pertinent results within the research areas of -- in increasing generality -- Coloured Petri Nets, High-level Petri Nets, and formalisms for modelling and analysis of parallel and distributed systems. Second, to put the results obtained in this thesis in a wider perspective by comparing them with important related work

Integrating payload design, planning, and control in the Dutch Utilisation Centre

Spacecraft payload design, experiment planning and scheduling, and payload control are traditionally separate areas of activity. This paper describes the development of a prototype software tool--the Activity Scheduling System (ASS)--which integrates these activity areas. ASS is part of a larger project to build a Dutch Utilisation Centre (DUC), intended eventually to support all space utilization activities in The Netherlands. ASS has been tested on the High Performance Capillary Electrophoresis payload. The paper outlines the integrated preparation and operations concept embodied in ASS. It describes the ASS prototype, including a typical session. The results of testing are summarized. Possible enhancement of ASS, including integration into DUC, is sketched

Behavioural model debugging in Linda

This thesis investigates event-based behavioural model debugging in Linda. A study is presented of the Linda parallel programming paradigm, its amenability to debugging, and a model for debugging Linda programs using Milner's CCS. In support of the construction of expected behaviour models, a Linda program specification language is proposed. A behaviour recognition engine that is based on such specifications is also discussed. It is shown that Linda's distinctive characteristics make it amenable to debugging without the usual problems associated with paraUel debuggers. Furthermore, it is shown that a behavioural model debugger, based on the proposed specification language, effectively exploits the debugging opportunity. The ideas developed in the thesis are demonstrated in an experimental Modula-2 Linda system

Contributions to the deadlock problem in multithreaded software applications observed as Resource Allocation Systems

Desde el punto de vista de la competencia por recursos compartidos sucesivamente reutilizables, se dice que un sistema concurrente compuesto por procesos secuenciales está en situación de bloqueo si existe en él un conjunto de procesos que están indefinidamente esperando la liberación de ciertos recursos retenidos por miembros del mismo conjunto de procesos. En sistemas razonablemente complejos o distribuidos, establecer una política de asignación de recursos que sea libre de bloqueos puede ser un problema muy difícil de resolver de forma eficiente. En este sentido, los modelos formales, y particularmente las redes de Petri, se han ido afianzando como herramientas fructíferas que permiten abstraer el problema de asignación de recursos en este tipo de sistemas, con el fin de abordarlo analíticamente y proveer métodos eficientes para la correcta construcción o corrección de estos sistemas. En particular, la teoría estructural de redes de Petri se postula como un potente aliado para lidiar con el problema de la explosión de estados inherente a aquéllos. En este fértil contexto han florecido una serie de trabajos que defienden una propuesta metodológica de diseño orientada al estudio estructural y la correspondiente corrección física del problema de asignación de recursos en familias de sistemas muy significativas en determinados contextos de aplicación, como el de los Sistemas de Fabricación Flexible. Las clases de modelos de redes de Petri resultantes asumen ciertas restricciones, con significado físico en el contexto de aplicación para el que están destinadas, que alivian en buena medida la complejidad del problema. En la presente tesis, se intenta acercar ese tipo de aproximación metodológica al diseño de aplicaciones software multihilo libres de bloqueos. A tal efecto, se pone de manifiesto cómo aquellas restricciones procedentes del mundo de los Sistemas de Fabricación Flexible se muestran demasiado severas para aprehender la versatilidad inherente a los sistemas software en lo que respecta a la interacción de los procesos con los recursos compartidos. En particular, se han de resaltar dos necesidades de modelado fundamentales que obstaculizan la mera adopción de antiguas aproximaciones surgidas bajo el prisma de otros dominios: (1) la necesidad de soportar el anidamiento de bucles no desplegables en el interior de los procesos, y (2) la posible compartición de recursos no disponibles en el arranque del sistema pero que son creados o declarados por un proceso en ejecución. A resultas, se identifica una serie de requerimientos básicos para la definición de un tipo de modelos orientado al estudio de sistemas software multihilo y se presenta una clase de redes de Petri, llamada PC2R, que cumple dicha lista de requerimientos, manteniéndose a su vez respetuosa con la filosofía de diseño de anteriores subclases enfocadas a otros contextos de aplicación. Junto con la revisión e integración de anteriores resultados en el nuevo marco conceptual, se aborda el estudio de propiedades inherentes a los sistemas resultantes y su relación profunda con otros tipos de modelos, la confección de resultados y algoritmos eficientes para el análisis estructural de vivacidad en la nueva clase, así como la revisión y propuesta de métodos de resolución de los problemas de bloqueo adaptadas a las particularidades físicas del dominio de aplicación. Asimismo, se estudia la complejidad computacional de ciertas vertientes relacionadas con el problema de asignación de recursos en el nuevo contexto, así como la traslación de los resultados anteriormente mencionados sobre el dominio de la ingeniería de software multihilo, donde la nueva clase de redes permite afrontar problemas inabordables considerando el marco teórico y las herramientas suministradas para subclases anteriormente explotadas

Expecting some action:Predictive processing and the construction of conscious experience

Predictive processing has begun to offer new insights into the nature of conscious experience—but the link is not straightforward. A wide variety of systems may be described as predictive machines, raising the question: what differentiates those for which it makes sense to talk about conscious experience? One possible answer lies in the involvement of a higher-order form of prediction error, termed expected free energy. In this paper we explore under what conditions the minimization of this new quantity might underpin conscious experience. Our suggestion is that the minimisation of Expected Free Energy is not in itself sufficient for the occurrence of conscious experience. Instead, it is relevant only insofar as it helps deliver what Ward et al. (2011) have previously described as a sense of our own poise over an action space. Perceptual experience, we will argue, is nothing other than the process that puts current actions in contact with goals and intentions, enabling some creatures to know the space of options that their current situation makes available. This proposal fits with recent work suggesting a deep link between conscious contents and contents computed at an ‘intermediate’ level of processing, apt for controlling action.</p

Refugee discrimination – The good, the bad, and the pragmatic

This article addresses three questions. To what extent does the current refugee regime discriminate among refugees? When is such discrimination wrong? Could discrimination ever be justified pragmatically, for the sake of admitting more refugees given political constraints? In answer to the first question, it finds discrimination is rampant. There is the kind of discrimination that gets noticed: discrimination that states choose to enact within the refugee regime. But there is also a kind of discrimination that is missed: discrimination that is a product of the regime itself. The second question proves tricky. Matters are clear at the extremes. Discrimination based on need is permissible. Discrimination based on race or religion is not. In between, we have a set of hard cases that are more difficult to judge. The article searches for relevant criteria. Finally, on the last question, the article concludes that a political leader could be justified in enacting discrimination as a pragmatic response to political constraints but that, even on such occasions, discrimination remains wrongful.Work on this article received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 842176

Coloured Petri Nets - a Pragmatic Formal Method for Designing and Analysing Distributed Systems

The thesis consists of six individual papers, where the present paper contains the mandatory overview, while the remaining five papers are found separately from the overview. The five papers can roughly be divided into three areas of research, namely case studies, education, and extensions to the CPN method.The primary purpose of the PhD thesis is to study the pragmatics, practical aspects, and intuition of CP-nets viewed as a formal method for describing and reasoning about concurrent systems. The perspective of pragmatics is our leitmotif, but at the same time in the context of CP-nets it is a kind of hypothesis of this thesis. This overview paper summarises the research conducted as an investigation of the hypothesis in the three areas of case studies, education, and extensions.The provoking claim of pragmatics should not be underestimated. In the present overview of the thesis, the CPN method is compared with a representative selection of formal methods. The graphics and simplicity of semantics, yet generality and expressiveness of the language constructs, essentially makes CP-nets a viable and attractive alternative to other formal methods. Similar graphical formal methods, such as SDL and Statecharts, typically have significantly more complicated semantics, or are domain-specific languages.research conducted in this thesis, opens a new complex of problems. Firstly, to get wider acceptance of CP-nets in industry, it is important to identify fruitful areas for the effective introduction of the CPN method. Secondly, it would be useful to identify a few extensions to the CPN method inspired by specific domains for easier adaption in industry. Thirdly, which analysis methods do future systems make use of