Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
Synthesis of Discrete-Event Controllers Based on the SignalEnvironment
Discrete Event Dynamic Systems
Computer
Synchronous and Bidirectional Component Interfaces
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Synthesis and Implementation of Local Modular Supervisory Control for a Manufacturing Cell
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
Feedback Control of Computing Systems
Feedback Control of Computing Systems
Supervisory Control of Software Systems
IEEE Transactions on Computers
Logical-Time Contracts for Reactive Embedded Components
EUROMICRO '04 Proceedings of the 30th EUROMICRO Conference
A conservative extension of synchronous data-flow with state machines
Proceedings of the 5th ACM international conference on Embedded software
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Schedulability Analysis of Petri Nets Based on Structural Properties
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Generation of concurrency control code using discrete-event systems theory
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
The theory of deadlock avoidance via discrete control
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controller Synthesis from LSC Requirements
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Petri nets and programming: a survey
ACC'09 Proceedings of the 2009 conference on American Control Conference
Programming with angelic nondeterminism
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Contracts for modular discrete controller synthesis
Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
Using controller-synthesis techniques to build property-enforcing layers
ESOP'03 Proceedings of the 12th European conference on Programming
Concurrency control generation for dynamic threads using discrete-event systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Synchronous control of reconfiguration in fractal component-based systems: a case study
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Synthesis revisited: generating statechart models from scenario-based requirements
Formal Methods in Software and Systems Modeling
Reactive model-based control of reconfiguration in the fractal component-based model
CBSE'10 Proceedings of the 13th international conference on Component-Based Software Engineering
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
We define a mixed imperative/declarative programming language: declarative contracts are enforced upon imperatively described behaviors. This paper describes the semantics of the language, making use of the notion of Discrete Controller Synthesis (DCS). We target the application domain of adaptive and reconfigurable systems: our language can serve programming closed-loop adaptation controllers, enabling flexible execution of functionalities w.r.t. changing resource and environment conditions. DCS is integrated into a1 programming language compiler, which facilitates its use by users and programmers, performing executable code generation. The tool is concretely built upon the basis of a reactive programming language compiler, where the nodes describe behaviors that can be modeled in terms of transition systems. Our compiler integrates this with a DCS tool, making it a new environment for formal methods. We define the trace semantics of our contracts language, describe its compilation and establish its correctness, and discuss implementation and examples.