Sequential Monte Carlo simulation of collision risk in free flight air traffic

Within HYBRIDGE a novel approach in speeding up Monte Carlo simulation of rare events has been developed. In the current report this method is extended for application to simulating collisions with a stochastic dynamical model of an air traffic operational concept. Subsequently this extended Monte Carlo simulation approach is applied to a simulation model of an advanced free flight operational concept; i.e. one in which aircraft are responsible for self separation with each other. The Monte Carlo simulation results obtained for this advanced concept show that the novel method works well, and that it allows studying rare events that stayed invisible in previous Monte Carlo simulations of advanced air traffic operational concepts

General parameterised refinement and recursion for the M-net calculus

AbstractThe algebra of M-nets, a high-level class of labelled Petri nets, was introduced in order to cope with the size problem of the low-level Petri box calculus, especially when applied as semantical domain for parallel programming languages. General, unrestricted and parameterised refinement and recursion operators, allowing to represent the (possibly recursive and concurrent) procedure call mechanism, are introduced into the M-net calculus

An algebra of Petri nets with arc-based timing restrictions

Human beings from the moment they understood the power of their brain tried to create things to make their life easier and satisfy their needs either physical or mental. Inventions became more and more complicated, covering almost every aspect of human life and satisfying the never ending human curiosity. One of the reasons for this complexity is that an increasing number of systems exhibit concurrency. The development of concurrent systems is generally challenging since it is more difficult to fully understand their exact behaviour. In this thesis We present and investigate two of the most widely used and well studied theories to capture concurrent behaviour. Based on the results of PBC, we develop two algebras, one based on term re-writing and the other on Petri nets, aimed at the Specification and analysis of concurrent systems with timing information. The former is based on process expressions (at-expressions) and employs a set of SOS rules providing their operational semantics. The latter is based on a class of Petri nets with time restrictions associated with their arcs, called at-boxes, and the corresponding transition firing rule. We relate the two algebras through a compositionally defined mapping which for a given at-expression returns an at- box with behaviourally equivalent transition system. The resulting framework consisting of the two algebras is called the Timed-Arc Petri Box Calculus, or atPBC.EThOS - Electronic Theses Online ServiceEPSRCGBUnited Kingdo