Conditional Partial Order Graphs

نویسنده

  • Andrey Mokhov
چکیده

This work presents a new formal model for specification and synthesis of microcontrol circuits. The model, called Conditional Partial Order Graph, captures concurrency and choice in a system’s behaviour in a compact and efficient way. It is especially beneficial for a class of systems which have many behavioural scenarios defined on the same set of primitive events or actions, e.g. CPU microcontrollers. The key feature of the model is its ability to specify systems in a compact functional form as opposed to the existing models which either have a direct event traces representation or use an explicit notion of states and transitions between the states. In this approach a system is specified with a set of scenarios, each of them being a partial order of events. The scenarios are further composed into a single graph containing all the partial orders in a functional form. This superposition is obtained by assignment of Boolean conditions to the events and dependencies between them, hence the name of the model. As a result the specification has different levels of abstraction for control and data paths: control flow is represented with partial orders of events, while data path is modelled at the level of Boolean functions. Such separation helps to avoid exponential explosion in the size of system specification which happens in other models. At the stage of microcontroller synthesis the obtained graph is structurally mapped into logic equations without the explicit exploration of the system state space, thereby leading to algorithms with high time and memory efficiency. The model has potential applications in the area of microcontrol synthesis and brings new methods for modelling concurrency into the domain of modern and future processor architectures. Several application examples are presented, namely basic handshake components and processor microcontrollers, as well as phase encoding circuits used in digital communication channels. As a result of this work several synthesis, verification, optimisation and mapping tools have been developed to facilitate specification and synthesis of microcontrollers using the proposed methodology. The tools have been successfully incorporated into the WORKCRAFT framework for visualisation and simulation support.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SAT-based Veri cation of Conditional Partial Order Graphs

The Conditional Partial Order Graph (CPOG) Model introduced recently is a novel technique for speci cation and synthesis of asynchronous controllers. It combines advantages of both Petri nets and FSM-based approaches and is capable of modelling systems with a high degree of concurrency and multiple choice. The paper extends the basic model of CPOGs to handle dynamic evaluation of internal contr...

متن کامل

Event Log Visualisation with Conditional Partial Order Graphs: from Control Flow to Data

Process mining techniques rely on event logs: the extraction of a process model (discovery) takes an event log as the input, the adequacy of a process model (conformance) is checked against an event log, and the enhancement of a process model is performed by using available data in the log. Several notations and formalisms for event log representation have been proposed in the recent years to e...

متن کامل

Partial Order MCMC for Structure Discovery in Bayesian Networks

We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We give both analytical and empirical results that suggest the superiority of t...

متن کامل

Modelling cyclic system behaviour with CPOGs

The Conditional Partial Order Graph (CPOG) model was initially built around finite sequences of events, later generalised to partial orders. The only way to model behaviour of a cyclic system was to assume that the environment restarts the system after it completes execution of the current partial order. This assumption was crucial to create a simple yet powerful model for specification, verifi...

متن کامل

Inferring dynamic genetic networks with low order independencies.

In this paper, we introduce a novel inference method for dynamic genetic networks which makes it possible to face a number of time measurements n that is much smaller than the number of genes p. The approach is based on the concept of a low order conditional dependence graph that we extend here in the case of dynamic Bayesian networks. Most of our results are based on the theory of graphical mo...

متن کامل

Conditional Partial Order Graphs and Dynamically Recon gurable Control Synthesis

The paper introduces a new formal model for specifying control paths in the context of asynchronous system design. The model, called Conditional Partial Order Graph (CPOG), is capable of capturing concurrency and choice in a system's behaviour in a compact and e cient way. A problem of CPOG synthesis is formulated and solved; various CPOG optimisation techniques are presented. The introduced mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009