Results 1 
7 of
7
Sequential synthesis by language equation solving
, 2004
"... Consider the problem of designing a component that combined with a known part of a system, called the context, conforms to a given overall specification. This question arises in several applications ranging from logic synthesis to the design of discrete controllers. We cast the problem as solving ab ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
(Show Context)
Consider the problem of designing a component that combined with a known part of a system, called the context, conforms to a given overall specification. This question arises in several applications ranging from logic synthesis to the design of discrete controllers. We cast the problem as solving abstract equations over languages and study the most general solutions under the synchronous and parallel composition operators. We also specialize such language equations to languages associated with important classes of automata used for modeling systems, e.g., regular languages as counterparts of finite automata, FSM languages as counterparts of FSMs. Thus we can operate algorithmically on those languages through their automata and study how to solve effectively their language equations. We investigate the maximal subsets of solutions closed with respect to various language properties. In particular, we investigate classes of the largest compositional solutions (defined by properties exhibited by the composition of the solution and of the context). We provide the first algorithm to compute the largest compositionally progressive solution of synchronous equations. This approach unifies in a seamless frame previously reported techniques. As an application we solve the classical problem of synthesizing a converter between a mismatched pair of protocols, using their specifications, as well as those of the channel and of the required service.
Engineering change in a nondeterministic fsm setting
 In Proceedings of IEEE/ACM Design Automation Conference
, 1996
"... personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is
Automatic generation of safe handlers for multitask systems
 n o 5345, INRIA, October 2004, http://www.inria.fr/rrrt/rr5345.html. Miscellaneous
, 2004
"... We are interested in the programming of realtime embedded control systems, such as in robotic, automotive or avionic systems. They are designed with multiple tasks, each with multiple modes. It is complex to design task handlers that control the switching of activities in order to insure safety pro ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
We are interested in the programming of realtime embedded control systems, such as in robotic, automotive or avionic systems. They are designed with multiple tasks, each with multiple modes. It is complex to design task handlers that control the switching of activities in order to insure safety properties of the global system. We propose a model of tasks in terms of transition systems, designed especially with the purpose of applying existing discrete controller synthesis techniques. This provides us with a systematic methodology, for the automatic generation of safe task handlers, with the support of synchronous languages and associated tools. Keywords: Realtime systems, safe design, discrete control synthesis, synchronous programming. corresponding author 1 1 Multitask systems 1.1 Realtime control systems The design of realtime control systems involves different aspects like e.g., device (sensor and actuator) management, numerical computation, and the discrete, eventbased switching between modes of activity. Such systems are designed with a number of tasks, executed in a cyclic way, each
Formal Methods in VLSI System Design
, 1996
"... We apply mathematical logic to a number of problems arising in very large scale integration (VLSI) design automation. The first stage of this dissertation is concerned with techniques for the efficient verification of digital systems. We introduce heuristics based on Binary Decision Diagrams for eff ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We apply mathematical logic to a number of problems arising in very large scale integration (VLSI) design automation. The first stage of this dissertation is concerned with techniques for the efficient verification of digital systems. We introduce heuristics based on Binary Decision Diagrams for efficiently representing designs specified as gatelevel circuits. We also present an approach to verifying hierarchical designs which uses novel notions of state equivalence to simplify components. The second stage addresses the problem of synthesizing digital designs. We use the logic S1S to demonstrate that the flexibility available for optimizing components in hierarchical designs can be characterized by a finite state automaton. This approach is extended to the problem of synthesizing p...
REDUCING COMPLEXITY OF SUPERVISOR SYNTHESIS
"... AbstractThe objective of the supervisory control problem proposed by Ramadge and Wonham is to find a supervisor that constrains a system’s behaviour according to a given specification. All its known solutions are of quadratic time complexity wrt. the number of states of the product of the system to ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractThe objective of the supervisory control problem proposed by Ramadge and Wonham is to find a supervisor that constrains a system’s behaviour according to a given specification. All its known solutions are of quadratic time complexity wrt. the number of states of the product of the system to be controlled and the specification. We present a new solution that can solve a large class of practical problems in linear time. Experimental results show that the improvement is not only a theoretical issue, but enables us to handle industrialsize problems efficiently.