The Experts below are selected from a list of 78 Experts worldwide ranked by ideXlab platform
Gerard J. Holzmann - One of the best experts on this subject based on the ideXlab platform.
-
A multi-paradigm language for reactive synthesis
Electronic Proceedings in Theoretical Computer Science, 2016Co-Authors: Ioannis Filippidis, Richard M. Murray, Gerard J. HolzmannAbstract:This paper proposes a language for describing reactive synthesis problems that integrates imperative and Declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language Promela. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and Declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The Declarative Part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms, extended with past LTL. The implementation translates Promela to input for the Slugs synthesizer and is written in Python. The AMBA AHB bus case study is revisited and synthesized efficiently, identifying the need to reorder binary decision diagrams during strategy construction, in order to prevent the exponential blowup observed in previous work.
-
Synthesis from multi-paradigm specifications
2015Co-Authors: Ioannis Filippidis, Richard M. Murray, Gerard J. HolzmannAbstract:This work proposes a language for describing reactive synthesis problems that integrates imperative and Declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language Promela. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and Declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The Declarative Part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms. The implementation translates Promela to input for the Slugs synthesizer and is written in Python.
-
SYNT - A multi-paradigm language for reactive synthesis
2015Co-Authors: Ioannis Filippidis, Richard M. Murray, Gerard J. HolzmannAbstract:This paper proposes a language for describing reactive synthesis problems that integrates imperative and Declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language PROMELA. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and Declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The Declarative Part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms, extended with past LTL. The implementation translates PROMELA to input for the SLUGS synthesizer and is written in PYTHON. The AMBA AHB bus case study is revisited and synthesized efficiently, identifying the need to reorder binary decision diagrams during strategy construction, in order to prevent the exponential blowup observed in previous work.
Yuval Shahar - One of the best experts on this subject based on the ideXlab platform.
-
KR4HC/ProHealth - iALARM: An Intelligent Alert Language for Activation, Response, and Monitoring of Medical Alerts
Lecture Notes in Computer Science, 2013Co-Authors: Denis Klimov, Yuval ShaharAbstract:Management of alerts triggered by unexpected or hazardous changes in a patient's state is a key task in continuous monitoring of patients. Using domain knowledge enables us to specify more sophisticated triggering patterns for alerts, based on temporal patterns detected in a stream of patient data, which include both the temporal element and significant domain knowledge, such as "rapidly increasing fever" instead of monitoring of only raw vital signals, such as "temperature higher than 39 C". In the current study, we introduce iALARM, a two-tier computational architecture, accompanied by a language for specification of intelligent alerts, which represents an additional computational [meta] level above the temporal-abstraction level. Alerts in the iALARM language consist of (a) the target population Part (Who is to be monitored?); (b) a Declarative Part (What is the triggering pattern?), i.e., a set of time and value constraints, specifying the triggering pattern to be computed by the bottom tier; and (c) a procedural Part (How should we raise the alarm? How should we continue the monitoring and follow-up?), i.e., an action or a whole plan to apply when the alert is triggered, and a list of meta-properties of the alert and action. One of our underlying principles is to avoid alert fatigue as much as possible; for instance, one can specify that a certain alert should be activated only the first time that the triggering pattern is detected, or only if it has not been raised over the past hour. Thus, we introduce a complete life cycle for alerts. Finally, we discuss the implied requirements for the knowledge- acquisition tool and for the alert monitoring and procedural application engines to support the iALARM language. We intend to evaluate our architecture in several clinical domains, within a large project for remote patient monitoring.
Lionel Zupan - One of the best experts on this subject based on the ideXlab platform.
-
ISMIS - Explanation-based Learning Helps Acquire Knowledge from Natural Language Texts
Lecture Notes in Computer Science, 1991Co-Authors: Sylvain Delisle, Stan Matwin, Jiandong Wang, Lionel ZupanAbstract:Existing systems to acquire knowledge from expository texts do not perform any learning beyond interpreting the contents of the text. The opportunity to learn from examples included in texts is not exploited. This is a needless limitation because examples in texts are usually show the reader how to integrate the Declarative Part of the text into an operational concept or procedure. Explanation-based Learning (EBL) seems to fill this gap as it explains the example within the domain theory, generalizes the explanation and operationalizes the concept definition by compiling necessary knowledge from the domain theory into the definition. In this paper, we study the synergistic combination of automatic text analysis and EBL. EBL is used realistically, where the domain theory and the training examples are obtained from a specification or a regulation by a text analysis program, rather than being given a priori. We present a prototype system which demonstrates the potential of this approach. The paper includes a detailed example using the Canadian Income Tax Guide.
T. Libourel - One of the best experts on this subject based on the ideXlab platform.
-
An integrated object-role oriented database model
Data & Knowledge Engineering, 2002Co-Authors: S. Coulondre, T. LibourelAbstract:The management of object dynamics, commonly called role in the database field, refers to the evolution of object structure and behavior. However, in this Particular area, the task is complicated by many constraints such as strong typing, persistence, encapsulation, late binding and inheritance. These constraints, together with data definition and manipulation languages, form the basis of the ODMG standard. The proposed approaches have not so far taken all ODMG guidelines into account. The present paper introduces a model which does so, based on Declarative specifications. The Declarative Part provides additional modeling flexibility and allows the manipulation of views at user level.
Ioannis Filippidis - One of the best experts on this subject based on the ideXlab platform.
-
A multi-paradigm language for reactive synthesis
Electronic Proceedings in Theoretical Computer Science, 2016Co-Authors: Ioannis Filippidis, Richard M. Murray, Gerard J. HolzmannAbstract:This paper proposes a language for describing reactive synthesis problems that integrates imperative and Declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language Promela. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and Declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The Declarative Part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms, extended with past LTL. The implementation translates Promela to input for the Slugs synthesizer and is written in Python. The AMBA AHB bus case study is revisited and synthesized efficiently, identifying the need to reorder binary decision diagrams during strategy construction, in order to prevent the exponential blowup observed in previous work.
-
Synthesis from multi-paradigm specifications
2015Co-Authors: Ioannis Filippidis, Richard M. Murray, Gerard J. HolzmannAbstract:This work proposes a language for describing reactive synthesis problems that integrates imperative and Declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language Promela. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and Declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The Declarative Part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms. The implementation translates Promela to input for the Slugs synthesizer and is written in Python.
-
SYNT - A multi-paradigm language for reactive synthesis
2015Co-Authors: Ioannis Filippidis, Richard M. Murray, Gerard J. HolzmannAbstract:This paper proposes a language for describing reactive synthesis problems that integrates imperative and Declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language PROMELA. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and Declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The Declarative Part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms, extended with past LTL. The implementation translates PROMELA to input for the SLUGS synthesizer and is written in PYTHON. The AMBA AHB bus case study is revisited and synthesized efficiently, identifying the need to reorder binary decision diagrams during strategy construction, in order to prevent the exponential blowup observed in previous work.
