Supremica - An integrated environment for verification, synthesis and simulation of discrete event systems

Åkesson, Knut; Fabian, Martin; Flordal, Hugo; Malik, Robi

doi:10.1109/wodes.2006.382401

Cited by 163 publications

(124 citation statements)

References 15 publications

Supporting

Mentioning

124

Contrasting

Order By: Relevance

“…It guarantees that the supervisors are 'controllable' and 'deadlock-free'. In addition, the supervisors can be subjected to a range of formal analysis tools (Akesson et al 2006;Reiser et al 2006;Rudie 2006;Feng and Wonham 2006).…”

Section: Discussionmentioning

confidence: 99%

Supervisory control theory applied to swarm robotics

et al. 2016

View full text Add to dashboard Cite

Currently, the control software of swarm robotics systems is created by ad hoc development. This makes it hard to deploy these systems in real-world scenarios. In particular, it is difficult to maintain, analyse, or verify the systems. Formal methods can contribute to overcome these problems. However, they usually do not guarantee that the implementation matches the specification, because the system's control code is typically generated manually. Also, there is cultural resistance to apply formal methods; they may be perceived as an additional step that does not add value to the final product. To address these problems, we propose supervisory control theory for the domain of swarm robotics. The advantages of supervisory control theory, and its associated tools, are a reduction in the amount of ad hoc development, the automatic generation of control code from modelled specifications, proofs of properties over generated control code, and the reusability of formally designed controllers between different robotic platforms. These advantages are demonstrated in four case studies using the e-puck and Kilobot robot platforms. Experiments with up to 600 physical robots Intell (2016) 10:65-97 are reported, which show that supervisory control theory can be used to formally develop state-of-the-art solutions to a range of problems in swarm robotics.

show abstract

Section: Discussionmentioning

confidence: 99%

Supervisory control theory applied to swarm robotics

et al. 2016

View full text Add to dashboard Cite

show abstract

“…This section describes the compositional nonblocking verification algorithm as it is implemented in the discrete event systems tool Waters/Supremica [28], which is freely available for download [29]. The presentation starts with a basic algorithm in Section 5.1, which is gradually improved in the following sections by adding special events and other techniques.…”

Section: Compositional Nonblocking Verification Algorithmmentioning

confidence: 99%

An algorithm for compositional nonblocking verification using special events

Pilbrow

Malik

2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

This paper proposes to improve compositional nonblocking verification of discrete event systems through the use of special events. Compositional verification involves abstraction to simplify parts of a system during verification. Normally, this abstraction is based on the set of events not used in the remainder of the system, i. e., in the part of the system not being simplified. Here, it is proposed to exploit more knowledge about the remainder of the system and check how events are being used. Always enabled events, selfloop-only events, failing events, and blocked events are easy to detect and often help with simplification even though they are used in the remainder of the system. Abstraction rules from previous work are generalised, and experimental results demonstrate the applicability of the resulting algorithm to verify several industrial-scale discrete event system models, while achieving better state-space reduction than before.

show abstract

“…We conclude our discussion on the key concepts and elements that underlie the current theory on the problem of deadlock avoidance in sequential RAS and the corresponding literature, by noting that the computation of the RAS state space and of an FSA-based representation of the maximally permissive DAP can be facilitated by a number of computational tools that have been developed by the research community of DES SC theory: DESUMA [57], SUPREMICA [1], and TCT [17] are some of them. Yet, it is well-recognized in the field that the enumeration and the representation of the underlying state space suffer from scalability issues even when symbolic techniques are employed to encode the automaton transition function [20,60].…”

Section: Dealing With the Np-hardness Of The Maximally Permissive Dapmentioning

confidence: 99%

“…1 Recognizing that, in the considered operational context, deadlock essentially arises from the impertinent allocation of the finite system resources to the jobs that are contesting for their acquisition, 2 we shall formulate and study the problem through the abstracting notion of the resource allocation system (RAS) [54]. This is a concept that captures all the relevant behavioral aspects of a flexibly automated manufacturing system, and at the same time, it enables the generalization and extension of the derived results to many other operational domains that share similar resource allocation problems.…”

Section: Introductionmentioning

confidence: 99%

Deadlock Avoidance Policies for Automated Manufacturing Systems Using Finite State Automata

Reveliotis¹,

Nazeem²

2014

Industrial Information Technology

View full text Add to dashboard Cite

This chapter considers the problem of deadlock avoidance in flexibly automated manufacturing systems, one of the most prevalent supervisory control problems that challenges the effective deployment of these environments. The problem is addressed through the modeling abstraction of the (sequential) resource allocation system (RAS), and the pursued analysis uses concepts and results from the formal modeling framework of finite state automata (FSA). A notion of optimality is defined through the notion of maximal permissiveness, but the computation of the optimal DAP is shown to be NP-Hard. Hence, the last part of the chapter discusses some approaches that have been developed by the relevant research community in its effort to deal with this negative complexity result. IntroductionContemporary manufacturing is characterized by (i) an ever increasing emphasis on automation and by (ii) a quest for broader product lines and more customized product offerings [22].Indeed, since the beginning of the industrial revolution, automation has been at the core of the mass-production concept and practices, enabling activities and tasks that frequently transcend the human element in terms of capability, consistency, durability and speed [21]. More recently, automation has also been advocated as a key enabler for controlling the overall production cost, especially in economies where labor cost is particularly high. Hence, there is an increasing tendency to confine the presence of the human element on the production shop-floor to supervisory and maintenance tasks only, while the actual production activity is taken over by "intelligent" hardware, materialized in the form of numerically controlled (NC) machines, CHAPTER 6. 2 robots, and other material handling equipment. Clearly, enabling the reliable deployment of such an extensive mode of automation is a pretty challenging task. Yet, in the recent years, things have been further complicated, and the aforementioned challenges have been further exacerbated, by the second manufacturing trend mentioned above, i.e., the emphasis that is placed by the global markets upon choice and customization. This trend implies a need to support the production of a broader set of items, in smaller batch sizes, and with shorter life spans. Such demand and production patterns negate the economies of scale and the efficiencies of the dedicated production lines that have been sought by traditional manufacturing, and (re-)places the emphasis on concepts like resource sharing, flexibility, reconfigurability and concurrency [18]. But the current reality has also shown that the effective support of these concepts on the manufacturing shop-floor is highly non-trivial, and it adds an entirely new layer of complexity and challenges to the aforementioned endeavors towards the automated operation of production systems. The manufacturing world has become increasingly conscious of the fact that the successful design and deployment of flexibly automated production systems necessitates the development of a (ma...

show abstract

Supremica - An integrated environment for verification, synthesis and simulation of discrete event systems

Cited by 163 publications

References 15 publications

Supervisory control theory applied to swarm robotics

Supervisory control theory applied to swarm robotics

An algorithm for compositional nonblocking verification using special events

Deadlock Avoidance Policies for Automated Manufacturing Systems Using Finite State Automata

Contact Info

Product

Resources

About