Fairness
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Functional documents for computer systems
Science of Computer Programming
Proceedings of the 17th international conference on Software engineering
Communicating sequential processes
Communications of the ACM
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Formal Development of Reactive Systems: Case Study Production Cell
Formal Development of Reactive Systems: Case Study Production Cell
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Goal-Oriented Requirements Engineering: A Guided Tour
RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
Fluent model checking for event-based systems
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Faster Solutions of Rabin and Streett Games
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Synthesis of Open Reactive Systems from Scenario-Based Specifications
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Plan-directed architectural change for autonomous systems
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
A reuse-based approach to the correct and automatic composition of web-services
International workshop on Engineering of software services for pervasive environments: in conjunction with the 6th ESEC/FSE joint meeting
Deriving event-based transition systems from goal-oriented requirements models
Automated Software Engineering
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A Case Study in Goal-Driven Architectural Adaptation
Software Engineering for Self-Adaptive Systems
MTSA: The Modal Transition System Analyser
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Synthesis of live behaviour models
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Synthesis of reactive(1) designs
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
dCTL: a branching time temporal logic for fault-tolerant system verification
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Effective synthesis of asynchronous systems from GR(1) specifications
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Synthesis of event-based controllers: a software engineering challenge
Proceedings of the 34th International Conference on Software Engineering
Learning revised models for planning in adaptive systems
Proceedings of the 2013 International Conference on Software Engineering
Requirements modelling by synthesis of deontic input-output automata
Proceedings of the 2013 International Conference on Software Engineering
Controller synthesis: from modelling to enactment
Proceedings of the 2013 International Conference on Software Engineering
Supporting incremental behaviour model elaboration
Computer Science - Research and Development
Supporting incremental behaviour model elaboration
Computer Science - Research and Development
Hi-index | 0.00 |
We revisit synthesis of live controllers for event-based operational models. We remove one aspect of an idealised problem domain by allowing to integrate failures of controller actions in the environment model. Classical treatment of failures through strong fairness leads to a very high computational complexity and may be insufficient for many interesting cases. We identify a realistic stronger fairness condition on the behaviour of failures. We show how to construct controllers satisfying liveness specifications under these fairness conditions. The resulting controllers exhibit the only possible behaviour in face of the given topology of failures: they keep retrying and never give up. We then identify some well-structure conditions on the environment. These conditions ensure that the resulting controller will be eager to satisfy its goals. Furthermore, for environments that satisfy these conditions and have an underlying probabilistic behaviour, the measure of traces that satisfy our fairness condition is 1, giving a characterisation of the kind of domains in which the approach is applicable.