toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Tronci, Enrico doi  openurl
  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 (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ jfp95 Serial 57  
Permanent link to this record
 

 
Author Böhm, Corrado; Tronci, Enrico doi  openurl
  Title About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-Calculus Type Journal Article
  Year 1991 Publication Inf. Comput. Abbreviated Journal  
  Volume 90 Issue 1 Pages 1-32  
  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 (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ infcomp91 Serial 59  
Permanent link to this record
 

 
Author Piperno, Adolfo; Tronci, Enrico pdf  doi
openurl 
  Title Regular Systems of Equations in λ-calculus Type Journal Article
  Year 1990 Publication Int. J. Found. Comput. Sci. Abbreviated Journal  
  Volume 1 Issue 3 Pages 325-340  
  Keywords  
  Abstract Many problems arising in equational theories like Lambda-calculus and Combinatory Logic can be expressed by combinatory equations or systems of equations. However, the solvability problem for an arbitrarily given class of systems is in general undecidable. In this paper we shall focus our attention on a decidable class of systems, which will be called regular systems, and we shall analyse some classical problems and well-known properties of Lambda-calculus that can be described and solved by means of regular systems. The significance of such class will be emphasized showing that for slight extensions of it the solvability problem turns out to be undecidable.  
  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 (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ ijfcs90 Serial 60  
Permanent link to this record
 

 
Author Piperno, Adolfo; Tronci, Enrico doi  openurl
  Title Regular Systems of Equations in λ-calculus Type Conference Article
  Year 1989 Publication Ictcs Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract Many problems arising in equational theories like Lambda-calculus and Combinatory Logic can be expressed by combinatory equations or systems of equations. However, the solvability problem for an arbitrarily given class of systems is in general undecidable. In this paper we shall focus our attention on a decidable class of systems, which will be called regular systems, and we shall analyse some classical problems and well-known properties of Lambda-calculus that can be described and solved by means of regular systems. The significance of such class will be emphasized showing that for slight extensions of it the solvability problem turns out to be undecidable.  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Mantova - Italy Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ ictcs89 Serial 61  
Permanent link to this record
 

 
Author Böhm, Corrado; Piperno, Adolfo; Tronci, Enrico openurl 
  Title Solving Equations in λ-calculus Type Conference Article
  Year 1989 Publication Proc. of: Logic Colloquium 88 Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Padova - Italy Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ logic-colloquium-88 Serial 62  
Permanent link to this record
 

 
Author Böhm, Corrado; Tronci, Enrico openurl 
  Title X-Separability and Left-Invertibility in lambda-calculus Type Conference Article
  Year 1987 Publication Symposium on Logic in Computer Science (LICS) Abbreviated Journal  
  Volume Issue Pages 320-328  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher IEEE Computer Society Place of Publication Ithaca, New York, USA Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ lics87 Serial 63  
Permanent link to this record
 

 
Author Böhm, Corrado; Tronci, Enrico openurl 
  Title X-separability and left-invertibility in the λ-calculus (extended abstract, invited paper) Type Conference Article
  Year 1987 Publication Proceedings of: Temi e prospettive della Logica e della Filosofia della Scienza contemporanea Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Cesena - Italy Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ cesena87 Serial 64  
Permanent link to this record
 

 
Author Tronci, Enrico file  url
openurl 
  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 (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ cdc97 Serial 66  
Permanent link to this record
 

 
Author Tronci, Enrico pdf  url
doi  openurl
  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 (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ cdc96 Serial 67  
Permanent link to this record
 

 
Author Intrigila, Benedetto; Magazzeni, Daniele; Melatti, Igor; Tronci, Enrico pdf  doi
openurl 
  Title A Model Checking Technique for the Verification of Fuzzy Control Systems Type Conference Article
  Year 2005 Publication CIMCA '05: Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-1 (CIMCA-IAWTIC'06) Abbreviated Journal  
  Volume Issue Pages 536-542  
  Keywords  
  Abstract Fuzzy control is well known as a powerful technique for designing and realizing control systems. However, statistical evidence for their correct behavior may be not enough, even when it is based on a large number of samplings. In order to provide a more systematic verification process, the cell-to-cell mapping technology has been used in a number of cases as a verification tool for fuzzy control systems and, more recently, to assess their optimality and robustness. However, cell-to-cell mapping is typically limited in the number of cells it can explore. To overcome this limitation, in this paper we show how model checking techniques may be instead used to verify the correct behavior of a fuzzy control system. To this end, we use a modified version of theMurphi verifier, which ease the modeling phase by allowing to use finite precision real numbers and external C functions. In this way, also already designed simulators may be used for the verification phase. With respect to the cell mapping technique, our approach appears to be complementary; indeed, it explores a much larger number of states, at the cost of being less informative on the global dynamic of the system.  
  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 0-7695-2504-0-01 ISBN (up) Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number Sapienza @ mari @ Immt05 Serial 75  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: