Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Towards an algebraic semantics for the object paradigm
Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Synthesis of Controllers of Processes Modeled as ColoredPetri Nets
Discrete Event Dynamic Systems
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
Specifying reactive systems with attributed finite state machines
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Control of Parameterized Discrete Event Systems
Discrete Event Dynamic Systems
Systems-theoretic view of component-based software development
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
| Hi-index | 0.00 |
This paper presents a new paradigm for designing reactive systems. It combines the use of formal methods widely recognized in software engineering and synthesis procedures developed within the framework of the Supervisory Control Theory for discrete event systems. It promotes design exploration by means of a synthesis approach with the sole aim of producing reliable reactive systems. The adoption of these particular synthesis procedures is, however, not sufficient to achieve this objective, because of scalability and computational complexity issues. To circumvent these difficulties, this paper suggests two extensions with respect to conventional synthesis procedures. The first one concerns the representation of reactive programs by attributed controllers. This requires that the process to be controlled must be described not only in terms of controllable active components but also in terms of uncontrollable passive components by using timed transition graphs and algebraic specifications, respectively. The second one involves abstraction and equational reasoning to take into account the use of strongly typed objects. This requires various kinds of transformation applied to the original problem specification as well as to intermediate solutions.