Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(3)
Computational Complexity
Controller Synthesis
Satisfiability
Subscribe
Academic
Publications
Synthesis of live behaviour models for fallible domains
Synthesis of live behaviour models for fallible domains,10.1145/1985793.1985823,Nicolás D'Ippolito,Víctor A. Braberman,Nir Piterman,Sebastián Uchitel
Edit
Synthesis of live behaviour models for fallible domains
BibTex
|
RIS
|
RefWorks
Download
Nicolás D'Ippolito
,
Víctor A. Braberman
,
Nir Piterman
,
Sebastián Uchitel
We revisit synthesis of live controllers for event-based op- erational models. We remove one aspect of an idealised problem domain by allowing to integrate failures of con- troller actions in the environment model. Classical treat- ment of failures through strong fairness leads to a very high
computational complexity
and may be insucient 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 prob- abilistic 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.
Conference:
International Conference on Software Engineering - ICSE
, pp. 211-220, 2011
DOI:
10.1145/1985793.1985823
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
dl.acm.org
)
(
www.informatik.uni-trier.de
)
(
doi.acm.org
)
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
More »
References
(22)
A markov decision process
(
Citations: 100
)
R. E. Bellman
Synthesis of Open Reactive Systems from Scenario-Based Specifications
(
Citations: 20
)
Yves Bontemps
,
Pierre-yves Schobbens
,
Christof Löding
Journal:
Fundamenta Informaticae - FUIN
, vol. 62, no. 2, pp. 139-169, 2004
Interface automata
(
Citations: 529
)
Luca de Alfaro
,
Thomas A. Henzinger
Journal:
ACM Sigsoft Software Engineering Notes
, vol. 26, no. 5, pp. 109-120, 2001
MTSA: The Modal Transition System Analyser
(
Citations: 8
)
Nicolás D'ippolito
,
Dario Fischbein
,
Marsha Chechik
,
Sebastián Uchitel
Conference:
Automated Software Engineering - ASE
, pp. 475-476, 2008
The Complexity of Tree Automata and Logics of Programs
(
Citations: 181
)
E. Allen Emerson
,
Charanjit S. Jutla
Journal:
Siam Journal on Computing - SIAMCOMP
, vol. 29, no. 1, pp. 132-158, 1999