Control problems in a temporal logic framework

Thistle, J. G.; Wonham, W. M.

doi:10.1080/00207178608933645

Cited by 108 publications

(32 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This model intentionally ignores some of the system characteristics, specifically those that need not be considered in attempting to meet the particular performance specifications. Often, to obtain an abstract model, high level symbolic representations are utilized [60,42,33,32,46]. The choice of the modelling technique affects most aspects of analysis and design of a controller for the system; consequently, special control methodologies must be used with the abstract models.…”

Section: Motivation" Sophistication and Complexity In Controlmentioning

confidence: 99%

Towards intelligent autonomous control systems: Architecture and fundamental issues

Antsaklis

Passino

Wang

1989

J Intell Robot Syst

128

View full text Add to dashboard Cite

Autonomous control systems are designed to perform well under significant uncertainties in the system and environment for extended periods of time, and they must be able to compensate for system failures without external intervention. Intelligent autonomous control systems use techniques from the field of artificial intelligence to achieve this autonomy. Such control systems evolve from conventional control systems by adding intelligent components, and their development requires interdisciplinary research. A hierarchical functional intelligent autonomous control architecture is introduced here and its functions are described in detail. The fundamental issues in autonomous control system modelling and analysis are discussed.

show abstract

Section: Motivation" Sophistication and Complexity In Controlmentioning

confidence: 99%

Towards intelligent autonomous control systems: Architecture and fundamental issues

Antsaklis

Passino

Wang

1989

J Intell Robot Syst

128

View full text Add to dashboard Cite

show abstract

“…It also gives an equivalence proof that shows that the specified Workstations, Transport System and Workcell Controller cooperate meaningfully, and cannot be distinguished by a Shop Controller from a particular Workcell. Discussions on formal specifications of MPCSs can also be found in [48,23,53]. References [5,10,11] describe non-trivial applications.…”

Section: Integrated Behaviormentioning

confidence: 99%

Computational tasks in robotics and factory automation

Biemans

Vissers

1988

Computers in Industry

View full text Add to dashboard Cite

The design of Manufacturing Planning and Control Systems (MPCSs) -systems that negotiate with Customers and Suppliers to exchange products in return for money in order to generate profit, is discussed.The computational task of MPCS components are systematically specified as a starting point for the development of computational engines, as computer systems and programs, that execute the specified computation. Key issues are the overwhelming complexity and frequently changing application of MPCSs.

show abstract

“…Similarly, when dealing with temporal aspects, some axiomatizations of classical temporal logic, such as those of [61], and [76], include the following rule, usually called " -insertion": α α for any formula α, while others, like that of [92] do not consider it as a valid inference rule.…”

Section: 4 3 Remarks On Trio's Axiomatization and On Its Soundnessmentioning

confidence: 99%

“…Thus, we followed the line of [30] and [92], and considered open parameters of formulas, including the current interpretation time, as constants of unknown value. As a consequence we easily obtained a proof of soundness of TRIO proof system (in the classical sense, i.e.…”

Section: 4 3 Remarks On Trio's Axiomatization and On Its Soundnessmentioning

confidence: 99%

Proving properties of real-time systems through logical specifications and Petri net models

Felder

Mandrioli

Morzenti

1994

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

The problem of formally analyzing properties of real-time systems is addressed. A method is proposed that allows specifying system properties in the TRIO language (an extension of temporal logic suitable to deal explicitly with the "time" variable and to measure it) and modeling the system as a timed Petri net. It is argued that such an approach is more general than analyzing program properties. The proof method is based on an axiomatization of timed Petri nets in terms of TRIO so that their properties can be derived as suitable theorems in much the same spirit as classical Hoare's method allows proving properties of programs coded in a Pascal-like language. The method is then exemplified through two classical "benchmarks" of the literature on concurrent and real-time systems, namely an elevator system and the dining philosophers problem. A thorough review of the related literature and a comparison thereof with the new method is also provided. Possible alternative methods, theoretical extensions, and practical applications are briefly discussed. . IntroductionIn the field of sequential programming there are now several well understood methods suitable to prove program properties that are expressed through some-possibly formal-specification language. A classical example is Hoare's method, which aims at proving properties of Pascal-like programs stated in terms of a first-order theory. Although the practical application of such methods to real-life cases is still under debate, these are now well-established and are receiving increasing consensus even in the industrial world, at least for the analysis of the most critical parts of the most critical systems [56,38].The state of the art is less well-established in the case of the analysis of concurrent systems. In fact such systems are intrinsically more difficult to analyze, what turns out into more complex formalization of their semantics and less satisfactory and less adopted specification languages. The situation is even worse for real-time systems. By "real-time systems" here we mean those systems whose behavior does depend on execution speed, not systems with generic requirements for high performance [95, 1]. In such systems one more difficulty arises from the necessity of modeling explicitly the dependence of system behavior on the time variable, whereas this dependency is usually abstracted away in the modeling of computing systems. On the other hand, real-time systems-which include plant control systems, embedded applications, air traffic control systems, etc.-have quite often

show abstract

Control problems in a temporal logic framework

Cited by 108 publications

References 11 publications

Towards intelligent autonomous control systems: Architecture and fundamental issues

Towards intelligent autonomous control systems: Architecture and fundamental issues

Computational tasks in robotics and factory automation

Proving properties of real-time systems through logical specifications and Petri net models

Contact Info

Product

Resources

About