|   | 
Details
   web
Records
Author (up) Tronci, Enrico
Title Formally Modeling a Metal Processing Plant and its Closed Loop Specifications Type Conference Article
Year 1999 Publication 4th IEEE International Symposium on High-Assurance Systems Engineering (HASE) Abbreviated Journal
Volume Issue Pages 151
Keywords
Abstract We present a case study on automatic synthesis of control software from formal specifications for an industrial automation control system. Our aim is to compare the effectiveness (i.e. design effort and controller quality) of automatic controller synthesis from closed loop formal specifications with that of manual controller design followed by automatic verification. The system to be controlled (plant) models a metal processing facility near Karlsruhe. We succeeded in automatically generating C code implementing a (correct by construction) embedded controller for such a plant from closed loop formal specifications. Our experimental results show that for industrial automation control systems automatic synthesis is a viable and profitable (especially as far as design effort is concerned) alternative to manual design followed by automatic verification.
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Washington, D.C, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0-7695-0418-3 ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ hase99 Serial 50
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Automatic Synthesis of Control Software for an Industrial Automation Control System Type Conference Article
Year 1999 Publication Proc.of: 14th IEEE International Conference on: Automated Software Engineering (ASE) Abbreviated Journal
Volume Issue Pages 247-250
Keywords
Abstract We present a case study on automatic synthesis of control software from formal specifications for an industrial automation control system. Our aim is to compare the effectiveness (i.e. design effort and controller quality) of automatic controller synthesis from closed loop formal specifications with that of manual controller design, followed by automatic verification. Our experimental results show that for industrial automation control systems, automatic synthesis is a viable and profitable (especially as far as design effort is concerned) alternative to manual design, followed by automatic verification.
Address
Corporate Author Thesis
Publisher Place of Publication Cocoa Beach, Florida, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ ase99 Serial 49
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Automatic Synthesis of Controllers from Formal Specifications Type Conference Article
Year 1998 Publication Proc of 2nd IEEE International Conference on Formal Engineering Methods (ICFEM) Abbreviated Journal
Volume Issue Pages 134-143
Keywords
Abstract Many safety critical reactive systems are indeed embedded control systems. Usually a control system can be partitioned into two main subsystems: a controller and a plant. Roughly speaking: the controller observes the state of the plant and sends commands (stimulus) to the plant to achieve predefined goals. We show that when the plant can be modeled as a deterministic finite state system (FSS) it is possible to effectively use formal methods to automatically synthesize the program implementing the controller from the plant model and the given formal specifications for the closed loop system (plant+controller). This guarantees that the controller program is correct by construction. To the best of our knowledge there is no previously published effective algorithm to extract executable code for the controller from closed loop formal specifications. We show practical usefulness of our techniques by giving experimental results on their use to synthesize C programs implementing optimal controllers (OCs) for plants with more than 109 states.
Address
Corporate Author Thesis
Publisher Place of Publication Brisbane, Queensland, Australia Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ icfem98 Serial 52
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title On Computing Optimal Controllers for Finite State Systems Type Conference Article
Year 1997 Publication CDC '97: Proceedings of the 36th IEEE International Conference on Decision and Control Abbreviated Journal
Volume Issue Pages
Keywords
Abstract
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Washington, DC, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ cdc97 Serial 66
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Optimal Finite State Supervisory Control Type Conference Article
Year 1996 Publication CDC '96: Proceedings of the 35th IEEE International Conference on Decision and Control Abbreviated Journal
Volume Issue Pages
Keywords
Abstract Supervisory Controllers are Discrete Event Dynamic Systems (DEDSs) forming the discrete core of a Hybrid Control System. We address the problem of automatic synthesis of Optimal Finite State Supervisory Controllers (OSCs). We show that Boolean First Order Logic (BFOL) and Binary Decision Diagrams (BDDs) are an effective methodological and practical framework for Optimal Finite State Supervisory Control. Using BFOL programs (i.e. systems of boolean functional equations) and BDDs we give a symbolic (i.e. BDD based) algorithm for automatic synthesis of OSCs. Our OSC synthesis algorithm can handle arbitrary sets of final states as well as plant transition relations containing loops and uncontrollable events (e.g. failures). We report on experimental results on the use of our OSC synthesis algorithm to synthesize a C program implementing a minimum fuel OSC for two autonomous vehicles moving on a 4 x 4 grid.
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Washington, DC, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ cdc96 Serial 67
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Equational Programming in Lambda-Calculus via SL-Systems. Part 2 Type Journal Article
Year 1996 Publication Theoretical Computer Science Abbreviated Journal
Volume 160 Issue 1&2 Pages 185-216
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ tcs96a Serial 55
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Equational Programming in Lambda-Calculus via SL-Systems. Part 1 Type Journal Article
Year 1996 Publication Theoretical Computer Science Abbreviated Journal
Volume 160 Issue 1&2 Pages 145-184
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ tcs96 Serial 54
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Defining Data Structures via Böhm-Out Type Journal Article
Year 1995 Publication J. Funct. Program. Abbreviated Journal
Volume 5 Issue 1 Pages 51-64
Keywords
Abstract We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a B??hm-out problem.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ jfp95 Serial 57
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Hardware Verification, Boolean Logic Programming, Boolean Functional Programming Type Conference Article
Year 1995 Publication Tenth Annual IEEE Symposium on Logic in Computer Science (LICS) Abbreviated Journal
Volume Issue Pages 408-418
Keywords
Abstract One of the main obstacles to automatic verification of finite state systems (FSSs) is state explosion. In this respect automatic verification of an FSS M using model checking and binary decision diagrams (BDDs) has an intrinsic limitation: no automatic global optimization of the verification task is possible until a BDD representation for M is generated. This is because systems and specifications are defined using different languages. To perform global optimization before generating a BDD representation for M we propose to use the same language to define systems and specifications. We show that first order logic on a Boolean domain yields an efficient functional programming language that can be used to represent, specify and automatically verify FSSs, e.g. on a SUN Sparc Station 2 we were able to automatically verify a 64 bit commercial multiplier.
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication San Diego, California Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ lics95 Serial 56
Permanent link to this record
 

 
Author (up) Tronci, Enrico
Title Equational Programming in lambda-calculus Type Conference Article
Year 1991 Publication Sixth Annual IEEE Symposium on Logic in Computer Science (LICS) Abbreviated Journal
Volume Issue Pages 191-202
Keywords
Abstract
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Amsterdam, The Netherlands Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ lics91 Serial 58
Permanent link to this record