{ ub,...,ubk } bl ij ... b m. bk n. lok ij. lub ij. o ij. operate. cij. (a) unbooked ubp wait wp operate. (b) closed. open. blocked_2.
|
|
- Curtis Davis
- 5 years ago
- Views:
Transcription
1 Controlling and Coordinating Recipes in Batch Applications Michael Tittus Martin Fabian Bengt Lennartson Control Engineering Lab, Chalmers University of Technology S Goteborg, Sweden 34th CDC, New Orleans, USA, 1995 Abstract Starting with a model of the plant and a number of product specications (recipes), a formalism is presented to design a discrete supervisor that controls and coordinates the simultaneous execution of these recipes. The paper introduces general, reusable Petri net blocks used to model recipes and uses an extension of the Wonham-Ramadge framework to synthesize a supervisor. Introduction A batch process involves a sequence of operations that are carried out on a discrete quantity ofmaterial within a piece of operating equipment. Given a plant and a device independent general recipe, all possible ways the plant can be utilized to produce the desired product are generated through static resource allocation [1]. This set of possible solutions is called the master recipe. In each solution of the master recipe, each operation is associated with some unit in the plant. The purpose of this paper is to (1) present amodeling framework for generic process operations, (2) formulate the synchronization issues occurring when transferring material between dierent units and (3) discuss how a discrete supervisor that coordinates the simultaneous execution of a number of recipes within one plant, can be synthesized from the master recipes and a model of the plant. For related work and an overview of the state-of-the-art we refer the reader to [2]. In [3] a set of discrete event processor (DEP) modelclasses for the dierent resources has been proposed. These model classes are very general. When modeling aplant, instances of these classes are created by giving each plant resource a set of unique events. Operating concurrently, the resources constitute the plant to be controlled. With the plant thus modeled and the master recipes for the products to be produced in parallel, already generated, sequential creation of the following recipes leads to the synthesis of a supervisor. Synchronizable Master Recipe (SMR): As a rst step, each master recipe is translated into a Petri net (PN). Dierent operations are expressed as places, with transitions indicating the beginning Research supported by the Swedish Research Council for Engineering Sciences (TFR) under the project number and end of each operation. Each transition t in the SMR is labeled with those resource events (plant events) that need to be red simultaneously (i.e. that need to be synchronized) with t for the recipe to progress properly and achievethe desired behavior. The SMR can be created by assembling instances of generic PN building-blocks. Each such building block when instantiated controls either an operation or a material transfer. Interleaved SMR (ISMR): Next, the transition events of the SMRs of all recipes that are to be executed in parallel, and thus compete for resources in the plant, are interleaved with each other. This results in a nondeterministic PN that describes all thinkable intermixings of the recipes. Thus, all recipes to be processed by the plant are included in this PN. We note that no physical restrictions like exclusive use of the resources are yet taken into consideration. Control Recipe: The synchronization of the ISMR with the resource automata results in the control recipe. Here, the ISMR is reduced to all the physically possible intermixings of the recipes by considering the fact that each resource can only be used by one recipe at a time. Supervisor: Finally,using a version of supervisory control theory (SCT) introduced by [4], the control recipe is further reduced by removing those places and transitions that can lead to a violation of the non-blocking and safeness properties (see [5] for a denition). This guarantees that all recipes can be executed all the way without violating any constraints. Modeling Resources Each plant consists of a number of equipment devices, called resources. All the possible resources are organized as a hierarchy of classes in a library, in which each modelclass inherits all the features of the class one step up in the hierarchy. For our purposes it suf- ces to dene the top class of this hierarchy as the class of resources, which comprises any kind of process equipment. On the next level we divide the resources into two sub-classes, processors (units) and transporting devices.
2 In [3] general, DEP models for processors and transporting devices (exemplied here by valves) have been introduced. They are shown in Fig. 1. Each processor and transporting device has a number of control states and a unique event alphabet. Whenever an object is created as an instance of its class, a set of unique events are assigned to the object by adding the modeled resource's ID as an index to each event. For a detailed discussion of these models, see [3]. (b) (a) bp op unbooked ubp wait wp operate c ub bk blocked_1 bk open o closed b unbooked ubk ubk blocked_2 Figure 1: DEP model of a processor (a) and a valve (b) A special class of processors are buer tanks, labeled B i. They contain raw material and are assumed to be innite in content. Since these tanks have no function other than to supply material, it suces us to model these tanks as simple on/o valves. When moving material from one processor to another, a number of valves have tocooperate to open and close certain connections. Thus, a higher-level class containing transporting devices, called connecting line or simply line, is created (Fig. 2). A line is an abstract object that has purely supervisory functions. For each possible connection between any two processors, a line object can automatically be created from information about the plant's topology. It serves as a kind of mediator, booking and coordinating the dierent valves needed to open and close a connection. At the event blij, meaning \book the line between units P i and P j ", the line object books or blocks the dierent valves needed for controlling the connections, as soon as they become available. Avalve V k, for example, is booked, if event b k can be triggered in both the line DEP and the DEP representing V k. This is automatically achieved by synchronizing the line DEP with the valve DEPs. When the line is ready and set, event lokij (\line ij ok"), it is by default closed. When opening and closing the line, the corresponding valves are opened or closed, respectively. Event lubij initiates the unbooking of the line and its associated valves. From Master Recipe to SMR The goal of this section is to transform the set of recipes called the master recipe into a PN that can be synchronized with the plant. We shall show that it is possible to create general PN building-blocks representing operations and dierent join constructs, which can be assembled to build synchronizable recipes. { ub,...,ubk } m n lub ij b m... unbooked bl ij lok ij bk n operate cij closed o ij open Figure 2: DEP representation of a connecting line Building blocks that translate the following ve basic functions will be proposed here: operation: dierent phases applied to a part of the batch primitive move: possibility of moving a batch from one unit to another asynchronous join: independent merging of two parts of a batch synchronous join: parts of a batch coordinated merging of two add: adding material into a unit that already contains part of the batch Transforming Operations An operation is a major processing sequence applied to the whole or a well-dened part of the batch. Each operation has to be executed within only one unit and no two operations can be applied to the same part of the batch. An operation consists of a set of dierent phases that can be executed in sequence or parallel. They start at a well-dened initial state/set of states and are supposed to terminate in some nal (set of) state(s), satisfying a number of constraints on the way. For our SMR it suces us to represent each operation as a single place in a PN. Whenever a token is placed in this place, a local, hybrid supervisor belonging to the current unit and synthesized according to the hybrid supervisory control theory (HSCT) introduced in [6] and [7], is taking control. Its purpose is to transfer the system safely from its current initial system-state to some nal state. As soon as this nal state is reached, the transition exiting from the PN place is enabled. Figure 3 shows the reusable building block representing an operation. Places denoting local, hybrid supervisors have a double contour (S 1 ). Furthermore, all building blocks start and end with an event setting the unit into control state wait. This makes it possible to easily connect the dierent building blocks, a wp event being the common transition. In [6] HSCT is used to nd one possible sequence of system modes (a path) that transfers the system from an initial to a nal state. In batch applications
3 wp i op i S 1 wp i Figure 3: PN building block of an operation it is more probable that there only exists one desirable path and the task is to generate a correct control law for this path. The reusable building blocks determine which plant events have to be red and when, i.e. in which sequence. Whenever a local supervisor is connected to an input arc of a transition, e.g. the second transition wp i in Fig. 3, this transition is enabled by the supervisor. All events in the building blocks carry generic labels, which in turn have indices that uniquely associate each label with some generic resource. For the operation building block, the generic event op i carries the identication number of a generic unit P i. If the building block is inserted into a recipe and associated with a unit, say P 1, the index i is set to 1, resulting in an event op 1. An event by the same name exists in the DEP model of unit P 1 (see Fig. 1a), thus forcing a synchronization of recipe and resource. Booking of Resources All resources have to be booked by a recipe before they can be utilized by that particular recipe. For the representation of an operation this has no consequence since we already assume the batch to be contained in the unit. All other basic PN building blocks, however, are concerned with transferring material from one unit (source) to another (target). Before any material can be transferred, the target unit, together with the line that connects the two units, needs to be booked by the recipe. A line is only booked when both the target and source unit have already been secured by the recipe. This guarantees the line's availability and avoids the occurrence of circular waits on the line/unit level. The building blocks in this section assume a booking strategy that waits as long as possible before initiating the booking of a resource, i.e. last-minute-booking. This strategy is also included in the building blocks. Synchronous Booking of Connecting Lines. Assume that the contents of two units, P 1 and P 2, are supposed to be merged into unit P 3. Two lines, namely P 1 P 3 and P 2 P 3, need to be booked by the same recipe. Assume further that both lines need to either book or block the same valve, say V k. Since the opening and closing of both lines can be controlled by the same local supervisor, it can be assured that the common valve is opened and closed correctly and this kind of double-booking is allowed. We distinguish between three cases: Both lines need to block V k : No competition arises, since blocking a valve does not book it. Both lines need tobook V k : V k has to be booked by the recipe, since access to the valve's states open and closed is needed. The two line-events denoting the booking of V k are synchronized, i.e. they are treated as only one event and red simultaneously (see Fig. 4, case 1) and V k is put into control state closed. The two lines need to block and book V k, respectively: Valve V k is booked by the recipe. This is done by changing the label bk k to b k and then treating the two identically labeled events as one event asabove (seefig.4,case2). bl ik b m... b k b k... lok ik bl jk bk n lok jk bl ik b m... b k f bk... lok ik case 1 case 2 join( k ) Figure 4: Synchronous Booking of Lines bl jk bk n lok jk In the last two cases, the recipe has to resolve the competition for the valve and guarantee that only one line is opened at a time. More formally: Let 1 3 and 2 3 denote the event alphabets of line automata P 1 P 3 and P 2 P 3 respectively and let join = 1 3 [ 2 3. Then we dene a relabeling function f join : join! join for 2 join such that f join () = bi if = bk i ^ b i 2 join if otherwise As a result of this possible competition for transporting devices, we distinguish between two ways of booking resources in connection with join constructs: synchronous booking and asynchronous booking. Synchronous booking implies that both lines have to be booked at the same time and has to be applied when both lines compete for the same transporter. Otherwise, asynchronous booking can be employed, i.e. both lines are booked independently of each other. For all synchronous joins, synchronous booking is used (SS) while asynchronous joins can be associated with synchronous (AS) or asynchronous (AA) line booking, depending on whether or not there is a competition for transporting devices. General Building Blocks for Material Transfer Each transfer of material requires at least three resources: a target unit, one or more source units and connecting line(s). As soon as all involved source units are ready for material transfer, the system goes through the following steps: (1) Booking of target unit and corresponding lines, (2) preparation of target unit (preprocessing), (3) the actual material transfer, and (4) the post-processing (e.g. cleaning) and unbooking of all source units. To be able to eciently model a general building block, we rst need to dene some operations on PNs.
4 Dierent Synchronization Operations. The full synchronous composition operator PN 1 k PN 2 models the interaction of two concurrently executing PNs, PN 1 and PN 2. This interaction requires simultaneous participation of all the involved nets on mutually labeled transitions. The interaction between the recipe and the plant is modeled by means of the uni-directional synchronous composition (UDSC). The UDSC PN 0 j U fpn 1 :::PN n g denes an operation between a slave Petri net PN 0 and a set of master PNs fpn 1 :::PN n g with disjoint alphabets i i=1 :::n and unique transition labels, i.e. each transition is associated with a unique event. The slave Petri net's alphabet consists of ordered tuples ::: n. Events belonging to one tuple are considered to be connected, meaning that they have to happen simultaneously. The alphabet of each PNeven contains a null event meaning that no transition is red. However, for a simpler notation, and since all events in the master PN are unique, it suces to label the slave PNwith the sets of events, e.g. f 1 2 g, to be connected, thus omitting the null event. PNs, interacting according to the UDSC, execute as follows. A transition t 1 in the slave PN PN 0 is enabled if the place connected to the input arc into t 1 contains a token. Transition t 1 enabled implies that the events dened by t 1 's label are connected and can only be triggered in synchrony with each other. All other enabled transitions in the master PNs can happen arbitrarily. This event connection terminated with the ring of the connected events, and the next transition in the slave PN is enabled and denes a new relevant event connection. As a last operation we introduce the alternative connection of events, denoted by h i with i denoting transition labels. The alternative connection is interpreted as follows: As soon as 1 is ready to re it is connected to either 2 or 3, depending on which of these is rst enabled, and the newly found set of connected events, either f 1 2 g or f 1 3 g,isredin direct sequence. After that, the remaining transition, 3 or 2, is red as soon as it is enabled. It is important to note that the ring of the transition labeled that way cannot start without the ring of 1. This operator is easily generalized to the case where 2 and 3 can be substituted by sets of connected events. Furthermore, if the PN is branching following an alternative connection, labeled paths can be specied to be taken depending on the events red. We then write h 1 f j g 1 f k g 2 i for an alternative connection, with the PN interpretation shown in Fig. 5. Building Blocks for Material Transfer. Figure 6 shows the generic building block used to model a primitive move, and the three dierent join constructs (AA, AS, SS). All transition labels are generic plant events assuming material transfer from two source units, P i and P j to the target unit P k, using lines P i P k and q τ 1,{τ 2},{τ 3} 1 2 q 1 q 2 q 0 {τ 1,τ 2 } {τ 1,τ 3} τ 2 q 1 q 2 τ 3 Figure 5: The alternative connection operator with labeled paths (cf. 2 in Fig. 6) and their PN interpretations P j P k. In case one or both of the source units are buer tanks, it was mentioned before that buer tanks are modeled as on/o valves and are thus booked by the corresponding line. If, for example, the generic P i is a buer tank, then all generic events from P i 's PN are omitted. P i P k ubp i wp i P j σ 3a wp i S 2a σ 1 σ S 1 op k S 0 wp k wp k wp j σ 3b wp j S 2b ubp j Figure 6: Generic building block for material transfer The transitions labeled i i =1 2 3a 3b represent important synchronization points where synchronization between dierent resources is required. This synchronization is achieved by connecting the corresponding events in the plant's resource models. 1 coordinates the booking of target unit and corresponding lines, and guarantees that no line is booked without the target unit being secured. 2 ensures that the lines are ready and the target unit prepared (preprocessed) before material transfer is started. 3a and 3b nally initiate post-processing and unbooking of source units P i and P j, respectively, when they have been emptied. This building block also contains four local supervisors: S 0 leads the target unit through a number of phases with the purpose of preparing it for operation. Once the desired initial system-state for the following operation is reached the unit switches to wait (event wp k ), where it is controlled to stay within this system-state.
5 S 1 belongs to the target unit and controls the actual material transfer by opening and closing the corresponding line. S 1 continues to control the target unit even after the source units have been emptied, so as to allow the material transfer to be part of another operation. The nature of S 1 depends very much on the kind of material transfer modeled (synchronous or asynchronous). S 2a and S 2b are used to post-process the source units before releasing them. After S 2a and S 2b have accomplished their tasks, the units are released (unbooked). All local supervisors can be either hybrid, i.e. designed to satisfy hybrid specications and synthesized using HSCT, or purely discrete. A table determines the -labeled transitions and the kind of local supervisors used for dierent material transports in Fig. 6. As an example, the following table contains these transitions and supervisors for a primitive move and a SAjoin. Prim. Move SA join 1 fbp k bl ik g fbp k bl ik bl jk g 2 fop k op i lok ik g hop k fop i lok ik g 1 fop j lok jk g 2 i 3a fop i lub ik g fop i lub ik g 3b fop j lub jk g S0 Hybrid Hybrid S1 Hybrid Discrete S2a Hybrid Hybrid S2b Hybrid The building block representing the primitive move has only one source unit, P i. Hence, the part of the PN in Fig. 6 associated with unit P j (the right branches) is omitted. Furthermore, the discrete local supervisor in the SA-join has the form of a semaphore and is needed to ensure that only one line is opened at a time. The building block for the adding of material is slightly dierent since both the target and the source unit already are booked by the recipe. For a detailed presentation see [7]. Finally, the synchronizable master recipe is built using the dierent building blocks as shown in the example at the end of this paper. Supervisory Control of Batch Processes Each recipe now describes a number of alternative paths through the plant. It is thus natural to view a recipe as a specication on the plant to exhibit a certain event sequence. However, there can be several independent recipes using the plant simultaneously. All of these together form a joint specication on the system's overall behavior. Let the plant P consist of a set of processors, P i, and a set of transporting devices, TD j. Connecting lines are denoted by L k. Furthermore, let the plant's alphabet consist of the following sub-alphabets: P = P [ L [ TD The sub-alphabets contain all the events of the processors, lines and transporting devices, respectively. We note that the lines are linked to the contained transporting devices by means of mutual events and dierent lines can be linked to the same transporting devices. In the sequel we will also need the alphabet LnB which contains all transporter events that book or block transporting devices. The plant is constructed by combining the automata of the dierent resources. Since lines can be linked to the same transporting devices (common events), the plant P is constructed as follows: P =(L 1 k L 2 k :::) k (P 1 k P 2 k :::TD 1 k TD 2 :::) (1) The interleaving of the lines, together with the fact that one and the same transporter can be linked to dierent lines causes the plant to be non-deterministic in the sense that the same event can put the plant into dierent states. In order to resolve this nondeterminism in the plant, caused by the line objects, we willre-labeltheevents, causing determinism in the lines as well as the transporters. First, each of the line events that either books/blocks a transporting device is re-labeled with a unique label. Next, for each re-labeling of a line event, a new transition is added in the corresponding TD Petri net parallel to, and is labeled with the new label, and, nally, all events that have been re-labeled are deleted from the TDs' Petri nets. The result of this re-labeling is a plant P that is deterministic. The creation of the overall specication, that is, the joint specication given by the combination of all recipes, is somewhat more tricky due to event connection. Each set of connected plantevents in the recipe is treated as one distinct event when generating the joint specication by interleaving the dierent routes of all recipes. Essentially, interleaving means that two PNs can execute their events completely asynchronously and independently of each other, even though there may exist mutual events. We denote the interleaving of two PNs, PN 1 and PN 2 as PN 1 k PN 2. For n recipes R i, i =1 ::: nthe joint specications is given by R =(R 1 k R 2 k :::R n ). So far the alphabet of R, R 6 P, since R contains events of the form h 1 2 i with i 2 P. After this interleaving, each connected event in the resulting joint specication is substituted by a sequence of its elementary events. Thus, a connected event h 1 2 i is substituted by the sequence of events 1 and 2. This substitution after the interleave, resulting in the joint specication R, ensures that (1) connected events are executed in strict sequence and (2) that R P. Augmenting the alphabet of R such that R = P [ LnB furthermore guarantees that all signicant plant events only happen in concert with the recipe when synchronizing the plant with the recipe. The synchronization P k R is necessary to retain only the physically possible and desired routes through the plant.
6 However, in the control recipe the booking of transporting devices is, due to the synchronization of plant and joint specication, possible in any order. Unfortunately, some combinations of valve booking will inevitable block the system from ever reaching a state where all recipes have been satisfactorily completed. Thus, some combinations of valve booking must be prohibited, and this is the task of the supervisor. Supervisor Synthesis It is shown in [4] that with a deterministic plant P and a nondeterministic specication R, there exists and can be synthesized a nondeterministic supervisor S that ensures that the closed loop system PkS= S and that S is the largest possible sub-automaton (least restrictive) of PkR such thats is both complete with respect to P and trim. A complete supervisor is able to follow all uncontrollable events that can be generated in each closed-loop system state, and trimness ensures that each process can be executed to some marked state (completion of all specied batches). This means that a trim and complete S allows the largest possible plant behavior that fullls all specications. A formal description of the supervisor synthesis algorithm is given in [4], and summarized below. Algorithm. We dene two operators, maxc() and maxt (), calculating the maximal complete and maximal trim subprocess, respectively. C denotes the set of all complete sub-processes and T the set of all trim sub-processes. Then, for i =0 1 2 ::: 1. Set S 0 : = max C(P kr) 2. S i+1 := max T (S i ) = max T (max C(S i;1 )). If S i+1 = S i terminate, else 3. S i+2 := max C(S i+1 ) = max C(max T (S i )). If S i+2 = S i+1 terminate, else 4. i:=i +2. Goto 2. In step 1, the control recipe is compared to the plant model, and those states of the control recipe that try to disable any uncontrollable event are removed. This is done iteratively until no further states to remove are found. That is, the control recipe is pruned at controllable events, guaranteeing that it can inuence the plant accordingly. This is the maximal complete subprocess of PkR, called S 0 in step 1 of the algorithm. The resulting automaton is either trim or not. This is tested by generating S 1, the maximal trim subprocess of S 0 in step 2. S 0 is made trim by removal of all states that are not reachable from the initial state or cannot reach some marked state. If S 0 is equal to S 1, the maximal complete and trim subprocess of P k R is found, and we have obtained our solution. However, if S 0 is not equal to S 1, the maximal complete subprocess of S 1 is generated in step 3. This subprocess is denoted S 2 and mayormay not be equal to S 1. Again, if they are equal the desired subprocess is found, and if not, the algorithm iterates, until a xpoint is reached. This xpoint may be reached when all states have been removed, in which case no usable supervisor exists. Example A simple example will serve asan illustration. Consider the tank system in Fig. 7. We specify two SMRs. Figure 7 shows the rst recipe, R 1,whichmoves material from buer tank B 1 into T 1 and from there out of the system via valve V 4. The second recipe, R 2 does the same but from buer tank B 2. Line events lok and lub carrying indices 1, 2 and 3, refer to line objects connecting B 1 ; P 1, B 2 ; P 1 and P 1 ;, respectively. B 1 B 2 V 1 V 2 V 3 V 4 P 1 ubp 1 { bp1, bl1} op 1 wp 1 { lok1, op1} { lub1, wp1} bl 3 R 1 { lok3, op1} { lub 4,wp1} Figure 7: Batch process with SMR For this simple example, plant P, as dened in (1), results in an automaton with 3375 accessible states, i.e. states that are physically possible. We have reduced this number of states by erasing the states blocked in the DEPs for V 3 and V 4 since they are never used. The number of automaton states is cut down to 256 in the next step, when P is synchronized with the two interleaved recipes, R. Since all events are controllable and no competition for valves arises in this example, PkRis both trim and complete. That is, S = PkR constitutes the supervisor for the system. The thus synthesized supervisor only allows a sequential execution of the two recipes. The large number of states when computing the plant automaton can be avoided by creating P k R using only PNs. References [1] M. Tittus and M. Fabian. Automated generation of plant-specic recipes in batch control. In Proc. of the ICCI'95, pages 99{102, Hong-Kong, [2] Imperial College, London, U.K. Workshop Analysis and Design of Event-Driven Operations in Process Systems, [3] M. Tittus, B. Egardt, and B. Lennartson. Plant and product models for batch processes. In Proc. of the ECC'95, Rome, Italy, 1995.
7 [4] M. Fabian and B. Lennartson. A class of nondeterministic specications for supervisory control. In Proc. of ECC'95, Rome, Italy, [5] P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete event processes. SIAM J. Control Optim., 25(1):206{230, January [6] M. Tittus and B. Egardt. Control-law synthesis for linear hybrid systems. In Proc of33rdcdc, pages 961{966, Orlando, FL, USA, IEEE. [7] M. Tittus. Control Synthesis for Batch Processes. PhD thesis, Control Eng. Lab, Chalmers Univ. of Techn., Goteborg, Sweden, 1995.
On the Design of Adaptive Supervisors for Discrete Event Systems
On the Design of Adaptive Supervisors for Discrete Event Systems Vigyan CHANDRA Department of Technology, Eastern Kentucky University Richmond, KY 40475, USA and Siddhartha BHATTACHARYYA Division of Computer
More informationOn Supervisory Control of Concurrent Discrete-Event Systems
On Supervisory Control of Concurrent Discrete-Event Systems Yosef Willner Michael Heymann March 27, 2002 Abstract When a discrete-event system P consists of several subsystems P 1,..., P n that operate
More informationMOST OF the published research on control of discreteevent
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 1, JANUARY 1998 3 Discrete-Event Control of Nondeterministic Systems Michael Heymann and Feng Lin, Member, IEEE Abstract Nondeterminism in discrete-event
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationHow to Pop a Deep PDA Matters
How to Pop a Deep PDA Matters Peter Leupold Department of Mathematics, Faculty of Science Kyoto Sangyo University Kyoto 603-8555, Japan email:leupold@cc.kyoto-su.ac.jp Abstract Deep PDA are push-down automata
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication Stavros Tripakis Abstract We introduce problems of decentralized control with communication, where we explicitly
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni 08 - Petri nets basics 1 Object Formalization of the basic concepts of
More informationof Kentucky, Lexington, KY USA,
Controlled Petri Nets: A Tutorial Survey L. E. Holloway 1 and B. H. Krogh 2 1 Center for Manufacturing Systems and Dept. of Electrical Engineering, University of Kentucky, Lexington, KY 40506-0108 USA,
More informationComputing the acceptability semantics. London SW7 2BZ, UK, Nicosia P.O. Box 537, Cyprus,
Computing the acceptability semantics Francesca Toni 1 and Antonios C. Kakas 2 1 Department of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK, ft@doc.ic.ac.uk 2 Department of Computer
More informationSupervisory Control of Petri Nets with. Uncontrollable/Unobservable Transitions. John O. Moody and Panos J. Antsaklis
Supervisory Control of Petri Nets with Uncontrollable/Unobservable Transitions John O. Moody and Panos J. Antsaklis Department of Electrical Engineering University of Notre Dame, Notre Dame, IN 46556 USA
More informationTime and Timed Petri Nets
Time and Timed Petri Nets Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr DISC 11, June 9th 2011 1 Time and Petri Nets 2 Timed Models 3 Expressiveness 4 Analysis 1/36 Outline 1 Time
More informationOn Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus
On Controllability and Normality of Discrete Event Dynamical Systems Ratnesh Kumar Vijay Garg Steven I. Marcus Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin,
More informationMODULAR MULTITASKING SUPERVISORY CONTROL OF COMPOSITE DISCRETE-EVENT SYSTEMS. Max H. de Queiroz*, José E. R. Cury**
MODULAR MULTITASKING SUPERVISORY CONTROL OF COMPOSITE DISCRETE-EVENT SYSTEMS Max H. de Queiroz*, José E. R. Cury** * GEMM CEFET/SC Florianópolis SC 88020-301 Brazil maxqueiroz@cefetsc.edu.br ** LCMI DAS
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationStructural Analysis of Resource Allocation Systems with Synchronization Constraints
Structural Analysis of Resource Allocation Systems with Synchronization Constraints Spyros Reveliotis School of Industrial & Systems Engineering Georgia Institute of Technology Atlanta, GA 30332 USA Abstract
More informationFeng Lin. Abstract. Inspired by thewell-known motto of Henry David Thoreau [1], that government
That Supervisor Is Best Which Supervises Least Feng Lin Department of Electrical and Computer Engineering Wayne State University, Detroit, MI 48202 Abstract Inspired by thewell-known motto of Henry David
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1 Stavros Tripakis 2 VERIMAG Technical Report TR-2004-26 November 2004 Abstract We introduce problems of decentralized
More informationZhennan Fei, Knut Åkesson and Spyros Reveliotis
Symbolic Computation and Representation of Deadlock Avoidance Policies for Complex Resource Allocation Systems with Application to Multithreaded Software Zhennan Fei, Knut Åkesson and Spyros Reveliotis
More informationFinite-Delay Strategies In Infinite Games
Finite-Delay Strategies In Infinite Games von Wenyun Quan Matrikelnummer: 25389 Diplomarbeit im Studiengang Informatik Betreuer: Prof. Dr. Dr.h.c. Wolfgang Thomas Lehrstuhl für Informatik 7 Logik und Theorie
More informationControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
Control Synthesis of Discrete Manufacturing Systems using Timed Finite utomata JROSLV FOGEL Institute of Informatics Slovak cademy of Sciences ratislav Dúbravská 9, SLOVK REPULIC bstract: - n application
More informationSynthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems
53rd IEEE Conference on Decision and Control December 5-7, 24. Los Angeles, California, USA Synthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems Xiang
More informationIndustrial Automation (Automação de Processos Industriais)
Industrial Automation (Automação de Processos Industriais) Discrete Event Systems http://users.isr.ist.utl.pt/~jag/courses/api1516/api1516.html Slides 2010/2011 Prof. Paulo Jorge Oliveira Rev. 2011-2015
More informationBounding the End-to-End Response Times of Tasks in a Distributed. Real-Time System Using the Direct Synchronization Protocol.
Bounding the End-to-End Response imes of asks in a Distributed Real-ime System Using the Direct Synchronization Protocol Jun Sun Jane Liu Abstract In a distributed real-time system, a task may consist
More informationNonblocking Supervisory Control. of Nondeterministic Systems. Michael Heymann 1 and Feng Lin 2. Abstract
Nonblocking Supervisory Control of Nondeterministic Systems Michael Heymann 1 and Feng Lin 2 Abstract In this paper we extend the theory of supervisory control of nondeterministic discrete-event systems,
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More information6. Conclusion 23. T. R. Allen and D. A. Padua. Debugging fortran on a shared memory machine.
6. Conclusion 23 References [AP87] T. R. Allen and D. A. Padua. Debugging fortran on a shared memory machine. In Proc. International Conf. on Parallel Processing, pages 721{727, 1987. [Dij65] E. W. Dijkstra.
More information{},{a},{a,c} {},{c} {c,d}
Modular verication of Argos Programs Agathe Merceron 1 and G. Michele Pinna 2 1 Basser Department of Computer Science, University of Sydney Madsen Building F09, NSW 2006, Australia agathe@staff.cs.su.oz.au
More informationMODULAR SUPERVISORY CONTROL OF ASYNCHRONOUS AND HIERARCHICAL FINITE STATE MACHINES
MODULAR SUPERVISORY CONTROL OF ASYNCHRONOUS AND HIERARCHICAL FINITE STATE MACHINES B. Gaudin, H. Marchand VerTeCs Team, Irisa, Campus Universitaire de Beaulieu, 35042 Rennes, France E-mail: {bgaudin,hmarchan}@irisa.fr,
More informationPetri nets. s 1 s 2. s 3 s 4. directed arcs.
Petri nets Petri nets Petri nets are a basic model of parallel and distributed systems (named after Carl Adam Petri). The basic idea is to describe state changes in a system with transitions. @ @R s 1
More information`First Come, First Served' can be unstable! Thomas I. Seidman. Department of Mathematics and Statistics. University of Maryland Baltimore County
revision2: 9/4/'93 `First Come, First Served' can be unstable! Thomas I. Seidman Department of Mathematics and Statistics University of Maryland Baltimore County Baltimore, MD 21228, USA e-mail: hseidman@math.umbc.edui
More informationNondeterminism. September 7, Nondeterminism
September 7, 204 Introduction is a useful concept that has a great impact on the theory of computation Introduction is a useful concept that has a great impact on the theory of computation So far in our
More informationModeling and Analysis using Hybrid Petri Nets
Modeling and Analysis using Hybrid Petri Nets Latefa GHOMRI Laboratoire d Automatique de Tlemcen, FSI UABB, BP 230, Tlemcen, 13000, ALGERIA. ghomrilatefa@yahoo.fr Hassane ALLA Laboratoire d Automatique
More informationEmbedded Systems 2. REVIEW: Actor models. A system is a function that accepts an input signal and yields an output signal.
Embedded Systems 2 REVIEW: Actor models A system is a function that accepts an input signal and yields an output signal. The domain and range of the system function are sets of signals, which themselves
More informationElementary Siphons of Petri Nets and Deadlock Control in FMS
Journal of Computer and Communications, 2015, 3, 1-12 Published Online July 2015 in SciRes. http://www.scirp.org/journal/jcc http://dx.doi.org/10.4236/jcc.2015.37001 Elementary Siphons of Petri Nets and
More informationa cell is represented by a triple of non-negative integers). The next state of a cell is determined by the present states of the right part of the lef
MFCS'98 Satellite Workshop on Cellular Automata August 25, 27, 1998, Brno, Czech Republic Number-Conserving Reversible Cellular Automata and Their Computation-Universality Kenichi MORITA, and Katsunobu
More informationModelling of Railway Network Using Petri Nets
Modelling of Railway Network Using Petri Nets MANDIRA BANIK 1, RANJAN DASGUPTA 2 1 Dept. of Computer Sc. & Engg., National Institute of Technical Teachers' Training & Research, Kolkata, West Bengal, India
More informationComputability and Complexity
Computability and Complexity Sequences and Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationSupervisory Control: Advanced Theory and Applications
Supervisory Control: Advanced Theory and Applications Dr Rong Su S1-B1b-59, School of EEE Nanyang Technological University Tel: +65 6790-6042, Email: rsu@ntu.edu.sg EE6226, Discrete Event Systems 1 Introduction
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationWojciech Penczek. Polish Academy of Sciences, Warsaw, Poland. and. Institute of Informatics, Siedlce, Poland.
A local approach to modal logic for multi-agent systems? Wojciech Penczek 1 Institute of Computer Science Polish Academy of Sciences, Warsaw, Poland and 2 Akademia Podlaska Institute of Informatics, Siedlce,
More informationSymbolic Verification of Hybrid Systems: An Algebraic Approach
European Journal of Control (2001)71±16 # 2001 EUCA Symbolic Verification of Hybrid Systems An Algebraic Approach Martin v. Mohrenschildt Department of Computing and Software, Faculty of Engineering, McMaster
More informationc 2011 Nisha Somnath
c 2011 Nisha Somnath HIERARCHICAL SUPERVISORY CONTROL OF COMPLEX PETRI NETS BY NISHA SOMNATH THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Aerospace
More informationLanguage Stability and Stabilizability of Discrete Event Dynamical Systems 1
Language Stability and Stabilizability of Discrete Event Dynamical Systems 1 Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Vijay Garg Department of
More informationSymbolic Decentralized Supervisory Control
Symbolic Decentralized Supervisory Control SYMBOLIC DECENTRALIZED SUPERVISORY CONTROL BY URVASHI AGARWAL, B.Eng. a thesis submitted to the department of computing & software and the school of graduate
More informationSPN 2003 Preliminary Version. Translating Hybrid Petri Nets into Hybrid. Automata 1. Dipartimento di Informatica. Universita di Torino
SPN 2003 Preliminary Version Translating Hybrid Petri Nets into Hybrid Automata 1 Marco Gribaudo 2 and Andras Horvath 3 Dipartimento di Informatica Universita di Torino Corso Svizzera 185, 10149 Torino,
More informationSpecification models and their analysis Petri Nets
Specification models and their analysis Petri Nets Kai Lampka December 10, 2010 1 30 Part I Petri Nets Basics Petri Nets Introduction A Petri Net (PN) is a weighted(?), bipartite(?) digraph(?) invented
More informationComputability and Complexity
Computability and Complexity Non-determinism, Regular Expressions CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard
More informationComputability and Complexity
Computability and Complexity Push-Down Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationAnalysis of a Boost Converter Circuit Using Linear Hybrid Automata
Analysis of a Boost Converter Circuit Using Linear Hybrid Automata Ulrich Kühne LSV ENS de Cachan, 94235 Cachan Cedex, France, kuehne@lsv.ens-cachan.fr 1 Introduction Boost converter circuits are an important
More informationA New Method for Converting Trace Theoretic Specifications to Signal Transition Graphs
A New Method for Converting Trace Theoretic Specifications to Signal Transition Graphs C. J. Coomber and P. Horan School of Computing and Mathematics Deakin University, Geelong AUSTRALIA 3217 Abstract
More informationAttack-Resilient Supervisory Control of Discrete-Event Systems
1 Attack-Resilient Supervisory Control of Discrete-Event Systems Yu Wang, Alper Kamil Bozkurt and Miroslav Pajic arxiv:194.3264v1 [cs.fl] 5 Apr 219 Abstract In this work, we study the problem of supervisory
More informationSupervisory Control of Manufacturing Systems with Time Specifications
Supervisory Control of Manufacturing Systems with Time Specifications Alexander Schaub Institute of Automatic Control Engineering Technische Universität München Joint Advanced Student School 2008 Bibliography
More information1. sort of tokens (e.g. indistinguishable (black), coloured, structured,...),
7. High Level Petri-Nets Definition 7.1 A Net Type is determined if the following specification is given: 1. sort of tokens (e.g. indistinguishable (black), coloured, structured,...), 2. sort of labeling
More informationNONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING. Alessandro Giua Xiaolan Xie
NONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING Alessandro Giua Xiaolan Xie Dip. Ing. Elettrica ed Elettronica, U. di Cagliari, Italy. Email: giua@diee.unica.it INRIA/MACSI Team, ISGMP, U. de Metz, France.
More informationModeling Continuous Systems Using Modified Petri Nets Model
Journal of Modeling & Simulation in Electrical & Electronics Engineering (MSEEE) 9 Modeling Continuous Systems Using Modified Petri Nets Model Abbas Dideban, Alireza Ahangarani Farahani, and Mohammad Razavi
More informationSemi-Automatic Distributed Synthesis
Semi-Automatic Distributed Synthesis Bernd Finkbeiner and Sven Schewe Universität des Saarlandes, 66123 Saarbrücken, Germany {finkbeiner schewe}@cs.uni-sb.de Abstract. We propose a sound and complete compositional
More informationUNIT-VI PUSHDOWN AUTOMATA
Syllabus R09 Regulation UNIT-VI PUSHDOWN AUTOMATA The context free languages have a type of automaton that defined them. This automaton, called a pushdown automaton, is an extension of the nondeterministic
More informationof Business Workows using Generalized Stochastic Petri Nets A. Ferscha Institut fur Angewandte Informatik und Informationssysteme Universitat Wien
Qualitative and Quantitative Analysis of Business Workows using Generalized Stochastic Petri Nets A. Ferscha Institut fur Angewandte Informatik und Informationssysteme Universitat Wien Lenaugasse 2/8,
More informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
More informationOn Reducing Linearizability to State Reachability 1
On Reducing Linearizability to State Reachability 1 Ahmed Bouajjani a, Michael Emmi b, Constantin Enea a, Jad Hamza a a LIAFA, Université Paris Diderot b IMDEA Software Institute, Spain Abstract Ecient
More informationDeadlock Ezio Bartocci Institute for Computer Engineering
TECHNISCHE UNIVERSITÄT WIEN Fakultät für Informatik Cyber-Physical Systems Group Deadlock Ezio Bartocci Institute for Computer Engineering ezio.bartocci@tuwien.ac.at Deadlock Permanent blocking of a set
More informationCONTROL AND DEADLOCK RECOVERY OF TIMED PETRI NETS USING OBSERVERS
5 e Conférence Francophone de MOdélisation et SIMulation Modélisation et simulation pour l analyse et l optimisation des systèmes industriels et logistiques MOSIM 04 du 1 er au 3 septembre 2004 - Nantes
More informationAutomatic Synthesis of Distributed Protocols
Automatic Synthesis of Distributed Protocols Rajeev Alur Stavros Tripakis 1 Introduction Protocols for coordination among concurrent processes are an essential component of modern multiprocessor and distributed
More informationLiveness in Timed and Untimed Systems. Abstract. and its timed version have been used successfully, but have focused on safety conditions and
Liveness in Timed and Untimed Systems Roberto Segala y Rainer Gawlick z Jrgen Sgaard-Andersen x Nancy Lynch { Abstract When proving the correctness of algorithms in distributed systems, one generally considers
More informationOptimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency
Optimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency Vahid Saeidi a, Ali A. Afzalian *b, Davood Gharavian c * Phone +982173932626, Fax +982177310425 a,b,c Department of Electrical
More informationSupervisory Control of Hybrid Systems
X.D. Koutsoukos, P.J. Antsaklis, J.A. Stiver and M.D. Lemmon, "Supervisory Control of Hybrid Systems, in Special Issue on Hybrid Systems: Theory and Applications, Proceedings of the IEEE, P.J. Antsaklis,
More informationExtending Supervisory Controller Synthesis to Deterministic Pushdown Automata Enforcing Controllability Least Restrictively
12th IFAC/IEEE Workshop on Discrete Event Systems Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata Enforcing Controllability Least Restrictively A.-K. Schmuck S. Schneider
More informationBridging the Gap between Reactive Synthesis and Supervisory Control
Bridging the Gap between Reactive Synthesis and Supervisory Control Stavros Tripakis University of California, Berkeley Joint work with Ruediger Ehlers (Berkeley, Cornell), Stéphane Lafortune (Michigan)
More information7. Queueing Systems. 8. Petri nets vs. State Automata
Petri Nets 1. Finite State Automata 2. Petri net notation and definition (no dynamics) 3. Introducing State: Petri net marking 4. Petri net dynamics 5. Capacity Constrained Petri nets 6. Petri net models
More informationPetri Net Modeling of Irrigation Canal Networks
Petri Net Modeling of Irrigation Canal Networks Giorgio Corriga, Alessandro Giua, Giampaolo Usai DIEE: Dip. di Ingegneria Elettrica ed Elettronica Università di Cagliari P.zza d Armi 09123 CAGLIARI, Italy
More informationAchieving Fault-tolerance and Safety of Discrete-event Systems through Learning
2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016. Boston, MA, USA Achieving Fault-tolerance and Safety of Discrete-event Systems through Learning Jin Dai, Ali Karimoddini,
More informationApplications of Petri Nets
Applications of Petri Nets Presenter: Chung-Wei Lin 2010.10.28 Outline Revisiting Petri Nets Application 1: Software Syntheses Theory and Algorithm Application 2: Biological Networks Comprehensive Introduction
More informationDesign of Control Modules for Use in a Globally Asynchronous, Locally Synchronous Design Methodology
Design of Control Modules for Use in a Globally Asynchronous, Locally Synchronous Design Methodology Pradnya Deokar Department of Electrical and Computer Engineering, VLSI Design Research Laboratory, Southern
More informationFinite-State Transducers
Finite-State Transducers - Seminar on Natural Language Processing - Michael Pradel July 6, 2007 Finite-state transducers play an important role in natural language processing. They provide a model for
More informationG-networks with synchronized partial ushing. PRi SM, Universite de Versailles, 45 av. des Etats Unis, Versailles Cedex,France
G-networks with synchronized partial ushing Jean-Michel FOURNEAU ;a, Dominique VERCH ERE a;b a PRi SM, Universite de Versailles, 45 av. des Etats Unis, 78 05 Versailles Cedex,France b CERMSEM, Universite
More informationA Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons
Proceedings of the 2001 IEEE International Conference on Robotics & Automation Seoul, Korea May 21-26, 2001 A Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons YiSheng Huang 1
More informationA Canonical Contraction for Safe Petri Nets
A Canonical Contraction for Safe Petri Nets Thomas Chatain and Stefan Haar INRIA & LSV (CNRS & ENS Cachan) 6, avenue du Président Wilson 935 CACHAN Cedex, France {chatain, haar}@lsvens-cachanfr Abstract
More informationPredicates and Predicate Transformers for. Systems 1. Ratnesh Kumar. Department of Electrical Engineering. University of Kentucky
Predicates and Predicate Transformers for Supervisory Control of Discrete Event Dynamical Systems 1 Ratnesh Kumar Department of Electrical Engineering University of Kentucy Lexington, KY 40506-0046 Vijay
More informationfor Propositional Temporal Logic with Since and Until Y. S. Ramakrishna, L. E. Moser, L. K. Dillon, P. M. Melliar-Smith, G. Kutty
An Automata-Theoretic Decision Procedure for Propositional Temporal Logic with Since and Until Y. S. Ramakrishna, L. E. Moser, L. K. Dillon, P. M. Melliar-Smith, G. Kutty Department of Electrical and Computer
More informationSynthesis and Viability of Minimally Interventive Legal Controllers. Michael Heymann 1 Feng Lin 2 George Meyer 3
Synthesis and Viability of Minimally Interventive Legal Controllers for Hybrid Systems Michael Heymann 1 Feng Lin 2 George Meyer 3 1 Department of Computer Science Technion, Israel Institute of Technology
More informationThe algorithmic analysis of hybrid system
The algorithmic analysis of hybrid system Authors: R.Alur, C. Courcoubetis etc. Course teacher: Prof. Ugo Buy Xin Li, Huiyong Xiao Nov. 13, 2002 Summary What s a hybrid system? Definition of Hybrid Automaton
More informationModeling and Stability Analysis of a Communication Network System
Modeling and Stability Analysis of a Communication Network System Zvi Retchkiman Königsberg Instituto Politecnico Nacional e-mail: mzvi@cic.ipn.mx Abstract In this work, the modeling and stability problem
More informationLecture 2 Automata Theory
Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray EECI, 18 March 2013 Outline Modeling (discrete) concurrent systems: transition systems, concurrency and interleaving Linear-time
More informationGeneration of batch operating procedures for multiple material-transfer tasks with Petri nets
Computers and Chemical Engineering 29 (2004) 1822 1836 Generation of batch operating procedures for multiple material-transfer tasks with Petri nets Yi-Feng Wang, Hung-Hsiang Chou, Chuei-Tin Chang Department
More informationHybrid Transition Modes in (Tissue) P Systems
Hybrid Transition Modes in (Tissue) P Systems Rudolf Freund and Marian Kogler Faculty of Informatics, Vienna University of Technology Favoritenstr. 9, 1040 Vienna, Austria {rudi,marian}@emcc.at Summary.
More informationFORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M.
FORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M. Wonham 4 2 Department of ECE, Wayne State University, Detroit,
More informationFormal Semantics for Grafcet Controlled Systems 1 Introduction 2 Grafcet
Formal Semantics for Grafcet Controlled Systems JANAN ZAYTOON Laboratoire d'automatique et de Microélectronique Faculté des Sciences Moulin de la Housse, BP 1039, 51687 Reims cedex 2 FRANCE Abstract: Grafcet
More informationA Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Fundamenta Informaticae XX (2004) 1 23 1 IOS Press A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs Javier Esparza Institute for Formal Methods in Computer Science
More informationSFM-11:CONNECT Summer School, Bertinoro, June 2011
SFM-:CONNECT Summer School, Bertinoro, June 20 EU-FP7: CONNECT LSCITS/PSS VERIWARE Part 3 Markov decision processes Overview Lectures and 2: Introduction 2 Discrete-time Markov chains 3 Markov decision
More informationTESTING is one of the most important parts of the
IEEE TRANSACTIONS 1 Generating Complete Controllable Test Suites for Distributed Testing Robert M. Hierons, Senior Member, IEEE Abstract A test suite is m-complete for finite state machine (FSM) M if it
More informationRepresenting Arithmetic Constraints with Finite Automata: An Overview
Representing Arithmetic Constraints with Finite Automata: An Overview Bernard Boigelot Pierre Wolper Université de Liège Motivation Linear numerical constraints are a very common and useful formalism (our
More informationThe Multi-Agent Rendezvous Problem - The Asynchronous Case
43rd IEEE Conference on Decision and Control December 14-17, 2004 Atlantis, Paradise Island, Bahamas WeB03.3 The Multi-Agent Rendezvous Problem - The Asynchronous Case J. Lin and A.S. Morse Yale University
More informationEE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories. Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo
EE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories 1 Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo Outline: Contracts and compositional methods for system design Where and why using
More informationMasked Prioritized Synchronization for Interaction and Control of Discrete Event Systems
Masked Prioritized Synchronization for Interaction and Control of Discrete Event Systems Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Michael Heymann
More informationLecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013
Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S
More informationCompositional Validation of Time-Critical Systems. Using Communicating Time Petri Nets. Giacomo Bucci, member, IEEE, and, Enrico Vicario, member, IEEE
Compositional Validation of TimeCritical Systems Using Communicating Time Petri Nets Giacomo Bucci, member, IEEE, and, Enrico Vicario, member, IEEE Dipartimento Sistemi e Informatica, Universita di Firenze
More informationLecture 23 : Nondeterministic Finite Automata DRAFT Connection between Regular Expressions and Finite Automata
CS/Math 24: Introduction to Discrete Mathematics 4/2/2 Lecture 23 : Nondeterministic Finite Automata Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we designed finite state automata
More informationIntroduction to Theory of Computing
CSCI 2670, Fall 2012 Introduction to Theory of Computing Department of Computer Science University of Georgia Athens, GA 30602 Instructor: Liming Cai www.cs.uga.edu/ cai 0 Lecture Note 3 Context-Free Languages
More informationONE NOVEL COMPUTATIONALLY IMPROVED OPTIMAL CONTROL POLICY FOR DEADLOCK PROBLEMS OF FLEXIBLE MANUFACTURING SYSTEMS USING PETRI NETS
Proceedings of the IASTED International Conference Modelling, Identification and Control (AsiaMIC 2013) April 10-12, 2013 Phuket, Thailand ONE NOVEL COMPUTATIONALLY IMPROVED OPTIMAL CONTROL POLICY FOR
More informationComplete Process Semantics for Inhibitor Nets Technical Report
Complete Process Semantics for Inhibitor Nets Technical Report Gabriel Juhás 2, Robert Lorenz 1, and Sebastian Mauser 1 1 Department of Applied Computer Science, Catholic University of Eichstätt-Ingolstadt,
More information