---
_id: '62701'
abstract:
- lang: eng
text: 'Learning continuous vector representations for knowledge graphs has
significantly improved state-of-the-art performances in many challenging tasks.
Yet, deep-learning-based models are only post-hoc and locally explainable. In
contrast, learning Web Ontology Language (OWL) class expressions in Description Logics (DLs) is ante-hoc and globally
explainable. However, state-of-the-art learners have two well-known lim-itations: scaling to large knowledge graphs and handling missing infor-mation. Here, we present a decision-tree-based learner (tDL) to learn
Web Ontology Languages (OWLs) class expressions over large knowl-edge
graphs, while imputing missing triples. Given positive and negative example individuals,
tDL firstly constructs unique OWL expressions in .SHOIN from concise bounded descriptions of individuals. Each OWL
class expression is used as a feature in a binary classification problem to represent
input individuals. Thereafter, tDL fits a CART decision tree to learn Boolean
decision rules distinguishing positive examples from nega-tive examples. A final
OWL expression in.SHOIN is built by traversing the built CART decision tree from the root node to leaf nodes for each
positive example. By this, tDL can learn OWL class expressions without exploration,
i.e., the number of queries to a knowledge graph is bounded by the number of input
individuals. Our empirical results show that tDL outperforms the current state-of-the-art models across
datasets. Impor-tantly, our experiments over a large knowledge graph (DBpedia
with 1.1 billion triples) show that tDL can effectively learn accurate OWL class
expressions, while the state-of-the-art models fail to return any results.
Finally, expressions learned by tDL can be seamlessly translated into
natural language explanations using a pre-trained large language model and a DL
verbalizer.'
author:
- first_name: Caglar
full_name: Demir, Caglar
last_name: Demir
- first_name: Moshood
full_name: Yekini, Moshood
last_name: Yekini
- first_name: Michael
full_name: Röder, Michael
last_name: Röder
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
last_name: Ngonga Ngomo
citation:
ama: 'Demir C, Yekini M, Röder M, Mahmood Y, Ngonga Ngomo A-C. Tree-Based OWL Class
Expression Learner over Large Graphs. In: Lecture Notes in Computer Science.
Springer Nature Switzerland; 2025. doi:10.1007/978-3-032-06066-2_29'
apa: Demir, C., Yekini, M., Röder, M., Mahmood, Y., & Ngonga Ngomo, A.-C. (2025).
Tree-Based OWL Class Expression Learner over Large Graphs. In Lecture Notes
in Computer Science. European Conference on Machine Learning and Principles
and Practice of Knowledge Discovery in Databases - ECML PKDD, Porto, Portugal.
Springer Nature Switzerland. https://doi.org/10.1007/978-3-032-06066-2_29
bibtex: '@inbook{Demir_Yekini_Röder_Mahmood_Ngonga Ngomo_2025, place={Cham}, title={Tree-Based
OWL Class Expression Learner over Large Graphs}, DOI={10.1007/978-3-032-06066-2_29},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland},
author={Demir, Caglar and Yekini, Moshood and Röder, Michael and Mahmood, Yasir
and Ngonga Ngomo, Axel-Cyrille}, year={2025} }'
chicago: 'Demir, Caglar, Moshood Yekini, Michael Röder, Yasir Mahmood, and Axel-Cyrille
Ngonga Ngomo. “Tree-Based OWL Class Expression Learner over Large Graphs.” In
Lecture Notes in Computer Science. Cham: Springer Nature Switzerland, 2025.
https://doi.org/10.1007/978-3-032-06066-2_29.'
ieee: 'C. Demir, M. Yekini, M. Röder, Y. Mahmood, and A.-C. Ngonga Ngomo, “Tree-Based
OWL Class Expression Learner over Large Graphs,” in Lecture Notes in Computer
Science, Cham: Springer Nature Switzerland, 2025.'
mla: Demir, Caglar, et al. “Tree-Based OWL Class Expression Learner over Large Graphs.”
Lecture Notes in Computer Science, Springer Nature Switzerland, 2025, doi:10.1007/978-3-032-06066-2_29.
short: 'C. Demir, M. Yekini, M. Röder, Y. Mahmood, A.-C. Ngonga Ngomo, in: Lecture
Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.'
conference:
end_date: 2025-09-19
location: Porto, Portugal
name: European Conference on Machine Learning and Principles and Practice of Knowledge
Discovery in Databases - ECML PKDD
start_date: 2025-09-15
date_created: 2025-11-28T14:09:17Z
date_updated: 2025-11-28T14:57:39Z
department:
- _id: '34'
- _id: '574'
doi: 10.1007/978-3-032-06066-2_29
keyword:
- Decision Tree
- OWL Class Expression Learning
- Description Logic
- Knowledge Graph
- Large Language Model
- Verbalizer
language:
- iso: eng
place: Cham
project:
- _id: '285'
name: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783032060655'
- '9783032060662'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: Tree-Based OWL Class Expression Learner over Large Graphs
type: book_chapter
user_id: '114533'
year: '2025'
...
---
_id: '55236'
abstract:
- lang: eng
text: 'From 1901 to 1919, Russell persistently maintained that there were two kinds
of logic and distinguished between one and the other as mathematical logic and
philosophical logic. In this paper, we discuss the concept of philosophical logic,
as used by Russell. This was only a tentative program that Russell did not clarify
in detail; therefore, our task will be to make it explicit. We shall show that
there are three (-and-a-half) kinds of Russellian philosophical logic: (i) “pure
logic”; (ii) philosophical logic investigating the logical forms of propositions;
(iii) philosophical logic exploring the logical forms of facts: in epistemology
and in the external world. In particular, Russell’s program or philosophical logic
of the facts of the external world remained less than sketchily outlined. '
author:
- first_name: Nikolay
full_name: Milkov, Nikolay
id: '357'
last_name: Milkov
citation:
ama: Milkov N. Bertrand Russell’s Philosophical Logic and its Logical Forms. Athens
Journal of Philosophy. 2023;2(3):193-209. doi:10.30958/ajphil.2-3-3
apa: Milkov, N. (2023). Bertrand Russell’s Philosophical Logic and its Logical Forms.
Athens Journal of Philosophy, 2(3), 193–209. https://doi.org/10.30958/ajphil.2-3-3
bibtex: '@article{Milkov_2023, title={Bertrand Russell’s Philosophical Logic and
its Logical Forms}, volume={2}, DOI={10.30958/ajphil.2-3-3},
number={3}, journal={Athens Journal of Philosophy}, author={Milkov, Nikolay},
year={2023}, pages={193–209} }'
chicago: 'Milkov, Nikolay. “Bertrand Russell’s Philosophical Logic and Its Logical
Forms.” Athens Journal of Philosophy 2, no. 3 (2023): 193–209. https://doi.org/10.30958/ajphil.2-3-3.'
ieee: 'N. Milkov, “Bertrand Russell’s Philosophical Logic and its Logical Forms,”
Athens Journal of Philosophy, vol. 2, no. 3, pp. 193–209, 2023, doi: 10.30958/ajphil.2-3-3.'
mla: Milkov, Nikolay. “Bertrand Russell’s Philosophical Logic and Its Logical Forms.”
Athens Journal of Philosophy, vol. 2, no. 3, 2023, pp. 193–209, doi:10.30958/ajphil.2-3-3.
short: N. Milkov, Athens Journal of Philosophy 2 (2023) 193–209.
date_created: 2024-07-14T16:27:50Z
date_updated: 2025-02-24T18:47:46Z
department:
- _id: '520'
- _id: '813'
doi: 10.30958/ajphil.2-3-3
intvolume: ' 2'
issue: '3'
keyword:
- Russell
- mathematical logic
- philosophical logic
- Wittgenstein
language:
- iso: eng
page: 193-209
publication: Athens Journal of Philosophy
publication_status: published
status: public
title: Bertrand Russell’s Philosophical Logic and its Logical Forms
type: journal_article
user_id: '357'
volume: 2
year: '2023'
...
---
_id: '45847'
abstract:
- lang: eng
text: "Abstract\r\n In this paper,
we investigate the parameterized complexity of model checking for Dependence and
Independence logic, which are well studied logics in the area of Team Semantics.
We start with a list of nine immediate parameterizations for this problem, namely
the number of disjunctions (i.e. splits)/(free) variables/universal quantifiers,
formula-size, the tree-width of the Gaifman graph of the input structure, the
size of the universe/team and the arity of dependence atoms. We present a comprehensive
picture of the parameterized complexity of model checking and obtain a division
of the problem into tractable and various intractable degrees. Furthermore, we
also consider the complexity of the most important variants (data and expression
complexity) of the model checking problem by fixing parts of the input."
author:
- first_name: Juha
full_name: Kontinen, Juha
last_name: Kontinen
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
citation:
ama: Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence
and independence logic. Journal of Logic and Computation. 2022;32(8):1624-1644.
doi:10.1093/logcom/exac070
apa: Kontinen, J., Meier, A., & Mahmood, Y. (2022). A parameterized view on
the complexity of dependence and independence logic. Journal of Logic and Computation,
32(8), 1624–1644. https://doi.org/10.1093/logcom/exac070
bibtex: '@article{Kontinen_Meier_Mahmood_2022, title={A parameterized view on the
complexity of dependence and independence logic}, volume={32}, DOI={10.1093/logcom/exac070},
number={8}, journal={Journal of Logic and Computation}, publisher={Oxford University
Press (OUP)}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022},
pages={1624–1644} }'
chicago: 'Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on
the Complexity of Dependence and Independence Logic.” Journal of Logic and
Computation 32, no. 8 (2022): 1624–44. https://doi.org/10.1093/logcom/exac070.'
ieee: 'J. Kontinen, A. Meier, and Y. Mahmood, “A parameterized view on the complexity
of dependence and independence logic,” Journal of Logic and Computation,
vol. 32, no. 8, pp. 1624–1644, 2022, doi: 10.1093/logcom/exac070.'
mla: Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence
and Independence Logic.” Journal of Logic and Computation, vol. 32, no.
8, Oxford University Press (OUP), 2022, pp. 1624–44, doi:10.1093/logcom/exac070.
short: J. Kontinen, A. Meier, Y. Mahmood, Journal of Logic and Computation 32 (2022)
1624–1644.
date_created: 2023-07-03T11:36:55Z
date_updated: 2024-06-04T16:06:37Z
doi: 10.1093/logcom/exac070
extern: '1'
intvolume: ' 32'
issue: '8'
keyword:
- Logic
- Hardware and Architecture
- Arts and Humanities (miscellaneous)
- Software
- Theoretical Computer Science
language:
- iso: eng
page: 1624-1644
publication: Journal of Logic and Computation
publication_identifier:
issn:
- 0955-792X
- 1465-363X
publication_status: published
publisher: Oxford University Press (OUP)
status: public
title: A parameterized view on the complexity of dependence and independence logic
type: journal_article
user_id: '99353'
volume: 32
year: '2022'
...
---
_id: '45844'
abstract:
- lang: eng
text: "Abstract\r\n Abductive reasoning
is a non-monotonic formalism stemming from the work of Peirce. It describes the
process of deriving the most plausible explanations of known facts. Considering
the positive version, asking for sets of variables as explanations, we study,
besides the problem of wether there exists a set of explanations, two explanation
size limited variants of this reasoning problem (less than or equal to, and equal
to a given size bound). In this paper, we present a thorough two-dimensional classification
of these problems: the first dimension is regarding the parameterized complexity
under a wealth of different parameterizations, and the second dimension spans
through all possible Boolean fragments of these problems in Schaefer’s constraint
satisfaction framework with co-clones (T. J. Schaefer. The complexity of satisfiability
problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing,
May 1–3, 1978, San Diego, California, USA, R.J. Lipton, W.A. Burkhard, W.J. Savitch,
E.P. Friedman, A.V. Aho eds, pp. 216–226. ACM, 1978). Thereby, we almost complete
the parameterized complexity classification program initiated by Fellows et al.
(The parameterized complexity of abduction. In Proceedings of the Twenty-Sixth
AAAI Conference on Articial Intelligence, July 22–26, 2012, Toronto, Ontario,
Canada, J. Homann, B. Selman eds. AAAI Press, 2012), partially building on the
results by Nordh and Zanuttini (What makes propositional abduction tractable.
Artificial Intelligence, 172, 1245–1284, 2008). In this process, we outline a
fine-grained analysis of the inherent parameterized intractability of these problems
and pinpoint their FPT parts. As the standard algebraic approach is not applicable
to our problems, we develop an alternative method that makes the algebraic tools
partially available again."
author:
- first_name: Yasir
full_name: Mahmood, Yasir
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Johannes
full_name: Schmidt, Johannes
last_name: Schmidt
citation:
ama: Mahmood Y, Meier A, Schmidt J. Parameterized complexity of abduction in Schaefer’s
framework. Journal of Logic and Computation. 2021;31(1):266-296. doi:10.1093/logcom/exaa079
apa: Mahmood, Y., Meier, A., & Schmidt, J. (2021). Parameterized complexity
of abduction in Schaefer’s framework. Journal of Logic and Computation,
31(1), 266–296. https://doi.org/10.1093/logcom/exaa079
bibtex: '@article{Mahmood_Meier_Schmidt_2021, title={Parameterized complexity of
abduction in Schaefer’s framework}, volume={31}, DOI={10.1093/logcom/exaa079},
number={1}, journal={Journal of Logic and Computation}, publisher={Oxford University
Press (OUP)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2021},
pages={266–296} }'
chicago: 'Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity
of Abduction in Schaefer’s Framework.” Journal of Logic and Computation
31, no. 1 (2021): 266–96. https://doi.org/10.1093/logcom/exaa079.'
ieee: 'Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized complexity of abduction
in Schaefer’s framework,” Journal of Logic and Computation, vol. 31, no.
1, pp. 266–296, 2021, doi: 10.1093/logcom/exaa079.'
mla: Mahmood, Yasir, et al. “Parameterized Complexity of Abduction in Schaefer’s
Framework.” Journal of Logic and Computation, vol. 31, no. 1, Oxford University
Press (OUP), 2021, pp. 266–96, doi:10.1093/logcom/exaa079.
short: Y. Mahmood, A. Meier, J. Schmidt, Journal of Logic and Computation 31 (2021)
266–296.
date_created: 2023-07-03T11:35:23Z
date_updated: 2024-06-04T16:03:14Z
department:
- _id: '574'
doi: 10.1093/logcom/exaa079
extern: '1'
intvolume: ' 31'
issue: '1'
keyword:
- Logic
- Hardware and Architecture
- Arts and Humanities (miscellaneous)
- Software
- Theoretical Computer Science
language:
- iso: eng
page: 266-296
publication: Journal of Logic and Computation
publication_identifier:
issn:
- 0955-792X
- 1465-363X
publication_status: published
publisher: Oxford University Press (OUP)
status: public
title: Parameterized complexity of abduction in Schaefer’s framework
type: journal_article
user_id: '99353'
volume: 31
year: '2021'
...
---
_id: '35811'
author:
- first_name: Rolf
full_name: Biehler, Rolf
id: '16274'
last_name: Biehler
- first_name: Viviane
full_name: Durand-Guerrier, Viviane
last_name: Durand-Guerrier
citation:
ama: 'Biehler R, Durand-Guerrier V. University Mathematics Didactic Research on
Number Theory, Algebra, Discrete Mathematics, Logic. In: Hausberger T, Bosch M,
Chelloughi F, eds. Proceedings of the Third Conference of the International
Network for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September
2020). University of Carthage and INDRUM; 2020:283-287.'
apa: Biehler, R., & Durand-Guerrier, V. (2020). University Mathematics Didactic
Research on Number Theory, Algebra, Discrete Mathematics, Logic. In T. Hausberger,
M. Bosch, & F. Chelloughi (Eds.), Proceedings of the Third Conference of
the International Network for Didactic Research in University Mathematics (INDRUM
2020, 12-19 September 2020) (pp. 283–287). University of Carthage and INDRUM.
bibtex: '@inbook{Biehler_Durand-Guerrier_2020, place={Bizerte, Tunisia}, title={University
Mathematics Didactic Research on Number Theory, Algebra, Discrete Mathematics,
Logic}, booktitle={Proceedings of the Third Conference of the International Network
for Didactic Research in University Mathematics (INDRUM 2020, 12-19 September
2020)}, publisher={University of Carthage and INDRUM}, author={Biehler, Rolf and
Durand-Guerrier, Viviane}, editor={Hausberger, T. and Bosch, M. and Chelloughi,
F.}, year={2020}, pages={283–287} }'
chicago: 'Biehler, Rolf, and Viviane Durand-Guerrier. “University Mathematics Didactic
Research on Number Theory, Algebra, Discrete Mathematics, Logic.” In Proceedings
of the Third Conference of the International Network for Didactic Research in
University Mathematics (INDRUM 2020, 12-19 September 2020), edited by T. Hausberger,
M. Bosch, and F. Chelloughi, 283–87. Bizerte, Tunisia: University of Carthage
and INDRUM, 2020.'
ieee: 'R. Biehler and V. Durand-Guerrier, “University Mathematics Didactic Research
on Number Theory, Algebra, Discrete Mathematics, Logic,” in Proceedings of
the Third Conference of the International Network for Didactic Research in University
Mathematics (INDRUM 2020, 12-19 September 2020), T. Hausberger, M. Bosch,
and F. Chelloughi, Eds. Bizerte, Tunisia: University of Carthage and INDRUM, 2020,
pp. 283–287.'
mla: Biehler, Rolf, and Viviane Durand-Guerrier. “University Mathematics Didactic
Research on Number Theory, Algebra, Discrete Mathematics, Logic.” Proceedings
of the Third Conference of the International Network for Didactic Research in
University Mathematics (INDRUM 2020, 12-19 September 2020), edited by T. Hausberger
et al., University of Carthage and INDRUM, 2020, pp. 283–87.
short: 'R. Biehler, V. Durand-Guerrier, in: T. Hausberger, M. Bosch, F. Chelloughi
(Eds.), Proceedings of the Third Conference of the International Network for Didactic
Research in University Mathematics (INDRUM 2020, 12-19 September 2020), University
of Carthage and INDRUM, Bizerte, Tunisia, 2020, pp. 283–287.'
date_created: 2023-01-10T11:14:02Z
date_updated: 2024-11-11T11:59:12Z
ddc:
- '510'
department:
- _id: '363'
editor:
- first_name: T.
full_name: Hausberger, T.
last_name: Hausberger
- first_name: M.
full_name: Bosch, M.
last_name: Bosch
- first_name: F.
full_name: Chelloughi, F.
last_name: Chelloughi
file:
- access_level: closed
content_type: application/pdf
creator: krueter
date_created: 2024-11-11T11:58:37Z
date_updated: 2024-11-11T11:58:37Z
file_id: '56978'
file_name: Biehler_INDRUM2020_283-287.pdf
file_size: 576039
relation: main_file
success: 1
file_date_updated: 2024-11-11T11:58:37Z
has_accepted_license: '1'
keyword:
- Number Theory
- Algebra
- Discrete Mathematics
- Logic
- Research in University Mathematics Edcuation
language:
- iso: eng
main_file_link:
- url: ⟨hal-03114041⟩
page: 283-287
place: Bizerte, Tunisia
publication: Proceedings of the Third Conference of the International Network for
Didactic Research in University Mathematics (INDRUM 2020, 12-19 September 2020)
publisher: University of Carthage and INDRUM
related_material:
link:
- relation: confirmation
url: https://hal.science/hal-03114041/
status: public
title: University Mathematics Didactic Research on Number Theory, Algebra, Discrete
Mathematics, Logic
type: book_chapter
user_id: '37888'
year: '2020'
...
---
_id: '3343'
abstract:
- lang: eng
text: In this paper we consider an extended variant of query learning where the
hidden concept is embedded in some Boolean circuit. This additional processing
layer modifies query arguments and answers by fixed transformation functions which
are known to the learner. For this scenario, we provide a characterization of
the solution space and an ordering on it. We give a compact representation of
the minimal and maximal solutions as quantified Boolean formulas and we adapt
the original algorithms for exact learning of specific classes of propositional
formulas.
author:
- first_name: Uwe
full_name: Bubeck, Uwe
last_name: Bubeck
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: Bubeck U, Kleine Büning H. Learning Boolean Specifications. Artificial Intelligence.
2015:246-257. doi:10.1016/j.artint.2015.09.003
apa: Bubeck, U., & Kleine Büning, H. (2015). Learning Boolean Specifications.
Artificial Intelligence, 246–257. https://doi.org/10.1016/j.artint.2015.09.003
bibtex: '@article{Bubeck_Kleine Büning_2015, title={Learning Boolean Specifications},
DOI={10.1016/j.artint.2015.09.003},
journal={Artificial Intelligence}, publisher={Elsevier}, author={Bubeck, Uwe and
Kleine Büning, Hans}, year={2015}, pages={246–257} }'
chicago: Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.”
Artificial Intelligence, 2015, 246–57. https://doi.org/10.1016/j.artint.2015.09.003.
ieee: U. Bubeck and H. Kleine Büning, “Learning Boolean Specifications,” Artificial
Intelligence, pp. 246–257, 2015.
mla: Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” Artificial
Intelligence, Elsevier, 2015, pp. 246–57, doi:10.1016/j.artint.2015.09.003.
short: U. Bubeck, H. Kleine Büning, Artificial Intelligence (2015) 246–257.
date_created: 2018-06-25T10:43:19Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1016/j.artint.2015.09.003
keyword:
- Query learning
- Propositional logic
language:
- iso: eng
page: 246 - 257
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Artificial Intelligence
publication_identifier:
issn:
- 0004-3702
publisher: Elsevier
status: public
title: Learning Boolean Specifications
type: journal_article
user_id: '315'
year: '2015'
...
---
_id: '10677'
author:
- first_name: Nam
full_name: Ho, Nam
last_name: Ho
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Ho N, Kaufmann P, Platzner M. Towards self-adaptive caches: A run-time reconfigurable
multi-core infrastructure. In: 2014 {IEEE} Intl. Conf. on Evolvable Systems
(ICES). ; 2014:31-37. doi:10.1109/ICES.2014.7008719'
apa: 'Ho, N., Kaufmann, P., & Platzner, M. (2014). Towards self-adaptive caches:
A run-time reconfigurable multi-core infrastructure. In 2014 {IEEE} Intl. Conf.
on Evolvable Systems (ICES) (pp. 31–37). https://doi.org/10.1109/ICES.2014.7008719'
bibtex: '@inproceedings{Ho_Kaufmann_Platzner_2014, title={Towards self-adaptive
caches: A run-time reconfigurable multi-core infrastructure}, DOI={10.1109/ICES.2014.7008719},
booktitle={2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)}, author={Ho, Nam
and Kaufmann, Paul and Platzner, Marco}, year={2014}, pages={31–37} }'
chicago: 'Ho, Nam, Paul Kaufmann, and Marco Platzner. “Towards Self-Adaptive Caches:
A Run-Time Reconfigurable Multi-Core Infrastructure.” In 2014 {IEEE} Intl.
Conf. on Evolvable Systems (ICES), 31–37, 2014. https://doi.org/10.1109/ICES.2014.7008719.'
ieee: 'N. Ho, P. Kaufmann, and M. Platzner, “Towards self-adaptive caches: A run-time
reconfigurable multi-core infrastructure,” in 2014 {IEEE} Intl. Conf. on Evolvable
Systems (ICES), 2014, pp. 31–37.'
mla: 'Ho, Nam, et al. “Towards Self-Adaptive Caches: A Run-Time Reconfigurable Multi-Core
Infrastructure.” 2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES), 2014,
pp. 31–37, doi:10.1109/ICES.2014.7008719.'
short: 'N. Ho, P. Kaufmann, M. Platzner, in: 2014 {IEEE} Intl. Conf. on Evolvable
Systems (ICES), 2014, pp. 31–37.'
date_created: 2019-07-10T11:23:00Z
date_updated: 2022-01-06T06:50:49Z
department:
- _id: '78'
doi: 10.1109/ICES.2014.7008719
keyword:
- Linux
- cache storage
- embedded systems
- granular computing
- multiprocessing systems
- reconfigurable architectures
- Leon3 SPARe processor
- custom logic events
- evolvable-self-adaptable processor cache
- fine granular profiling
- integer unit events
- measurement infrastructure
- microarchitectural events
- multicore embedded system
- perf_event standard Linux performance measurement interface
- processor properties
- run-time reconfigurable memory-to-cache address mapping engine
- run-time reconfigurable multicore infrastructure
- split-level caching
- Field programmable gate arrays
- Frequency locked loops
- Irrigation
- Phasor measurement units
- Registers
- Weaving
language:
- iso: eng
page: 31-37
publication: 2014 {IEEE} Intl. Conf. on Evolvable Systems (ICES)
status: public
title: 'Towards self-adaptive caches: A run-time reconfigurable multi-core infrastructure'
type: conference
user_id: '3118'
year: '2014'
...
---
_id: '17663'
abstract:
- lang: eng
text: 'In this paper, we define and study a new problem, referred to as the Dependent
Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the
context of large-scale powerful (radar/camera) sensor networks, but we believe
it has important applications on the admission of large flows in other networks
as well. In order to optimize the selection of flows transmitted to the gateway,
D-UFP takes into account possible dependencies between flows. We show that D-UFP
is more difficult than NP-hard problems for which no good approximation is known.
Then, we address two special cases of this problem: the case where all the sensors
have a shared channel and the case where the sensors form a mesh and route to
the gateway over a spanning tree.'
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: I.
full_name: Nudelman, I.
last_name: Nudelman
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
Sensor Networks. Networking, IEEE/ACM Transactions on. 2013;21(5):1461-1471.
doi:10.1109/TNET.2012.2227792
apa: Cohen, R., Nudelman, I., & Polevoy, G. (2013). On the Admission of Dependent
Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions On,
21(5), 1461–1471. https://doi.org/10.1109/TNET.2012.2227792
bibtex: '@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent
Flows in Powerful Sensor Networks}, volume={21}, DOI={10.1109/TNET.2012.2227792},
number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R.
and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }'
chicago: 'Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent
Flows in Powerful Sensor Networks.” Networking, IEEE/ACM Transactions On
21, no. 5 (2013): 1461–71. https://doi.org/10.1109/TNET.2012.2227792.'
ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
in Powerful Sensor Networks,” Networking, IEEE/ACM Transactions on, vol.
21, no. 5, pp. 1461–1471, 2013.
mla: Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”
Networking, IEEE/ACM Transactions On, vol. 21, no. 5, 2013, pp. 1461–71,
doi:10.1109/TNET.2012.2227792.
short: R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21
(2013) 1461–1471.
date_created: 2020-08-06T15:22:05Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2012.2227792
extern: '1'
intvolume: ' 21'
issue: '5'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Logic gates
- Radar
- Vectors
- Wireless sensor networks
- Dependent flow scheduling
- sensor networks
language:
- iso: eng
page: 1461-1471
publication: Networking, IEEE/ACM Transactions on
publication_identifier:
issn:
- 1063-6692
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: journal_article
user_id: '83983'
volume: 21
year: '2013'
...
---
_id: '10620'
author:
- first_name: Jahanzeb
full_name: Anwer, Jahanzeb
last_name: Anwer
- first_name: Sebastian
full_name: Meisner, Sebastian
last_name: Meisner
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Anwer J, Meisner S, Platzner M. Dynamic reliability management: Reconfiguring
reliability-levels of hardware designs at runtime. In: Reconfigurable Computing
and FPGAs (ReConFig), 2013 International Conference On. ; 2013:1-6. doi:10.1109/ReConFig.2013.6732280'
apa: 'Anwer, J., Meisner, S., & Platzner, M. (2013). Dynamic reliability management:
Reconfiguring reliability-levels of hardware designs at runtime. In Reconfigurable
Computing and FPGAs (ReConFig), 2013 International Conference on (pp. 1–6).
https://doi.org/10.1109/ReConFig.2013.6732280'
bibtex: '@inproceedings{Anwer_Meisner_Platzner_2013, title={Dynamic reliability
management: Reconfiguring reliability-levels of hardware designs at runtime},
DOI={10.1109/ReConFig.2013.6732280},
booktitle={Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
on}, author={Anwer, Jahanzeb and Meisner, Sebastian and Platzner, Marco}, year={2013},
pages={1–6} }'
chicago: 'Anwer, Jahanzeb, Sebastian Meisner, and Marco Platzner. “Dynamic Reliability
Management: Reconfiguring Reliability-Levels of Hardware Designs at Runtime.”
In Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
On, 1–6, 2013. https://doi.org/10.1109/ReConFig.2013.6732280.'
ieee: 'J. Anwer, S. Meisner, and M. Platzner, “Dynamic reliability management: Reconfiguring
reliability-levels of hardware designs at runtime,” in Reconfigurable Computing
and FPGAs (ReConFig), 2013 International Conference on, 2013, pp. 1–6.'
mla: 'Anwer, Jahanzeb, et al. “Dynamic Reliability Management: Reconfiguring Reliability-Levels
of Hardware Designs at Runtime.” Reconfigurable Computing and FPGAs (ReConFig),
2013 International Conference On, 2013, pp. 1–6, doi:10.1109/ReConFig.2013.6732280.'
short: 'J. Anwer, S. Meisner, M. Platzner, in: Reconfigurable Computing and FPGAs
(ReConFig), 2013 International Conference On, 2013, pp. 1–6.'
date_created: 2019-07-10T09:32:57Z
date_updated: 2022-01-06T06:50:48Z
department:
- _id: '78'
doi: 10.1109/ReConFig.2013.6732280
keyword:
- fault tolerant computing
- field programmable gate arrays
- logic design
- reliability
- BYU-LANL tool
- DRM tool flow
- FPGA based hardware designs
- avionic application
- device technologies
- dynamic reliability management
- fault-tolerant operation
- hardware designs
- reconfiguring reliability levels
- space applications
- Field programmable gate arrays
- Hardware
- Redundancy
- Reliability engineering
- Runtime
- Tunneling magnetoresistance
language:
- iso: eng
page: 1-6
publication: Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
on
status: public
title: 'Dynamic reliability management: Reconfiguring reliability-levels of hardware
designs at runtime'
type: conference
user_id: '3118'
year: '2013'
...
---
_id: '33825'
abstract:
- lang: eng
text: This article describes our approach for the specification and verification
of production automation systems with real-time properties. We focus on the graphical
MFERT notation and RT-OCL (Real-Time Object Constraint Language) for the specification
of state-oriented real-time properties. RT-OCL is an extension of the Object Constraint
Language (OCL) that is part of the Unified Modeling Language (UML). We introduce
the formal semantics of RT-OCL based on a formal model of UML Class and State
Diagrams and provide a mapping to temporal logics. The applicability of our approach
is demonstrated by the case study of a manufacturing system with automated guided
vehicles.
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Ulrich
full_name: Pape, Ulrich
last_name: Pape
- first_name: Jürgen
full_name: Ruf, Jürgen
last_name: Ruf
citation:
ama: 'Flake S, Müller W, Pape U, Ruf J. Specification and Formal Verification of
Temporal Properties of Production Automation Systems. In: Ehrig H, Damm W, Desel
J, et al., eds. Integration of Software Specification Techniques for Applications
in Engineering. Vol 3147. Lecture Notes in Computer Science. Springer-Verlag;
2004:206-226. doi:10.1007/978-3-540-27863-4_13'
apa: Flake, S., Müller, W., Pape, U., & Ruf, J. (2004). Specification and Formal
Verification of Temporal Properties of Production Automation Systems. In H. Ehrig,
W. Damm, J. Desel, M. Große-Rhode, W. Reif, E. Schnieder, & E. Westkämper
(Eds.), Integration of Software Specification Techniques for Applications in
Engineering (Vol. 3147, pp. 206–226). Springer-Verlag. https://doi.org/10.1007/978-3-540-27863-4_13
bibtex: '@inbook{Flake_Müller_Pape_Ruf_2004, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={Specification and Formal Verification of Temporal
Properties of Production Automation Systems}, volume={3147}, DOI={10.1007/978-3-540-27863-4_13},
booktitle={Integration of Software Specification Techniques for Applications in
Engineering}, publisher={Springer-Verlag}, author={Flake, Stephan and Müller,
Wolfgang and Pape, Ulrich and Ruf, Jürgen}, editor={Ehrig, Hartmut and Damm, Werner
and Desel, Jörg and Große-Rhode, Martin and Reif, Wolfgang and Schnieder, Eckehard
and Westkämper, Engelbert}, year={2004}, pages={206–226}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Flake, Stephan, Wolfgang Müller, Ulrich Pape, and Jürgen Ruf. “Specification
and Formal Verification of Temporal Properties of Production Automation Systems.”
In Integration of Software Specification Techniques for Applications in Engineering,
edited by Hartmut Ehrig, Werner Damm, Jörg Desel, Martin Große-Rhode, Wolfgang
Reif, Eckehard Schnieder, and Engelbert Westkämper, 3147:206–26. Lecture Notes
in Computer Science. Berlin, Heidelberg: Springer-Verlag, 2004. https://doi.org/10.1007/978-3-540-27863-4_13.'
ieee: 'S. Flake, W. Müller, U. Pape, and J. Ruf, “Specification and Formal Verification
of Temporal Properties of Production Automation Systems,” in Integration of
Software Specification Techniques for Applications in Engineering, vol. 3147,
H. Ehrig, W. Damm, J. Desel, M. Große-Rhode, W. Reif, E. Schnieder, and E. Westkämper,
Eds. Berlin, Heidelberg: Springer-Verlag, 2004, pp. 206–226.'
mla: Flake, Stephan, et al. “Specification and Formal Verification of Temporal Properties
of Production Automation Systems.” Integration of Software Specification Techniques
for Applications in Engineering, edited by Hartmut Ehrig et al., vol. 3147,
Springer-Verlag, 2004, pp. 206–26, doi:10.1007/978-3-540-27863-4_13.
short: 'S. Flake, W. Müller, U. Pape, J. Ruf, in: H. Ehrig, W. Damm, J. Desel, M.
Große-Rhode, W. Reif, E. Schnieder, E. Westkämper (Eds.), Integration of Software
Specification Techniques for Applications in Engineering, Springer-Verlag, Berlin,
Heidelberg, 2004, pp. 206–226.'
date_created: 2022-10-20T09:25:53Z
date_updated: 2022-10-20T09:26:15Z
department:
- _id: '672'
doi: 10.1007/978-3-540-27863-4_13
editor:
- first_name: Hartmut
full_name: Ehrig, Hartmut
last_name: Ehrig
- first_name: Werner
full_name: Damm, Werner
last_name: Damm
- first_name: Jörg
full_name: Desel, Jörg
last_name: Desel
- first_name: Martin
full_name: Große-Rhode, Martin
last_name: Große-Rhode
- first_name: Wolfgang
full_name: Reif, Wolfgang
last_name: Reif
- first_name: Eckehard
full_name: Schnieder, Eckehard
last_name: Schnieder
- first_name: Engelbert
full_name: Westkämper, Engelbert
last_name: Westkämper
intvolume: ' 3147'
keyword:
- Model Check
- Temporal Logic
- Object Constraint Language
- Abstract Syntax
- Temporal Logic Formula
language:
- iso: eng
page: 206-226
place: Berlin, Heidelberg
publication: Integration of Software Specification Techniques for Applications in
Engineering
publication_identifier:
isbn:
- 978-3-540-27863-4
publisher: Springer-Verlag
series_title: Lecture Notes in Computer Science
status: public
title: Specification and Formal Verification of Temporal Properties of Production
Automation Systems
type: book_chapter
user_id: '5786'
volume: 3147
year: '2004'
...
---
_id: '39061'
abstract:
- lang: eng
text: This article presents an approach, which combines theorem proving-based refinement
with model checking for state based real-time systems. Our verification flow starts
from UML state diagrams, which are translated to the formal B language and are
model checked for real-time properties. By means of the B language and a B theorem
prover, refined state diagrams are verified against their abstract representation.
The approach is presented by means of the refinement of a digital echo cancellation
unit.
author:
- first_name: Alexander
full_name: Krupp, Alexander
last_name: Krupp
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Ian
full_name: Oliver, Ian
last_name: Oliver
citation:
ama: 'Krupp A, Müller W, Oliver I. Formal Refinement and Model Checking of An Echo
Cancellation Unit. In: Proceedings of DATE’04 Designers’ Forum. ; 2004.
doi:10.1109/DATE.2004.1269214'
apa: Krupp, A., Müller, W., & Oliver, I. (2004). Formal Refinement and Model
Checking of An Echo Cancellation Unit. Proceedings of DATE’04 Designers’ Forum.
Proceedings Design, Automation and Test in Europe Conference and Exhibition. https://doi.org/10.1109/DATE.2004.1269214
bibtex: '@inproceedings{Krupp_Müller_Oliver_2004, place={Paris}, title={Formal Refinement
and Model Checking of An Echo Cancellation Unit}, DOI={10.1109/DATE.2004.1269214},
booktitle={Proceedings of DATE’04 Designers’ Forum}, author={Krupp, Alexander
and Müller, Wolfgang and Oliver, Ian}, year={2004} }'
chicago: Krupp, Alexander, Wolfgang Müller, and Ian Oliver. “Formal Refinement and
Model Checking of An Echo Cancellation Unit.” In Proceedings of DATE’04 Designers’
Forum. Paris, 2004. https://doi.org/10.1109/DATE.2004.1269214.
ieee: 'A. Krupp, W. Müller, and I. Oliver, “Formal Refinement and Model Checking
of An Echo Cancellation Unit,” presented at the Proceedings Design, Automation
and Test in Europe Conference and Exhibition, 2004, doi: 10.1109/DATE.2004.1269214.'
mla: Krupp, Alexander, et al. “Formal Refinement and Model Checking of An Echo Cancellation
Unit.” Proceedings of DATE’04 Designers’ Forum, 2004, doi:10.1109/DATE.2004.1269214.
short: 'A. Krupp, W. Müller, I. Oliver, in: Proceedings of DATE’04 Designers’ Forum,
Paris, 2004.'
conference:
name: Proceedings Design, Automation and Test in Europe Conference and Exhibition
date_created: 2023-01-24T08:53:26Z
date_updated: 2023-01-24T08:53:31Z
department:
- _id: '672'
doi: 10.1109/DATE.2004.1269214
keyword:
- Echo cancellers
- Logic
- Unified modeling language
- Automata
- Data structures
- Boolean functions
- Electronic design automation and methodology
- Prototypes
- Specification languages
- Constraint theory
language:
- iso: eng
place: Paris
publication: Proceedings of DATE’04 Designers' Forum
publication_identifier:
isbn:
- 0-7695-2085-5
status: public
title: Formal Refinement and Model Checking of An Echo Cancellation Unit
type: conference
user_id: '5786'
year: '2004'
...
---
_id: '39069'
abstract:
- lang: eng
text: We present the syntax and semantics of a past- and future-oriented temporal
extension of the Object Constraint Language (OCL). Our extension supports designers
to express time-bounded properties over a state-oriented UML model of a system
under development. The semantics is formally defined over the system states of
a mathematical object model. Additionally, we present a mapping to Clocked Linear
Temporal Logic (Clocked LTL) formulae, which is the basis for further application
in verification with model checking. We demonstrate the applicability of the approach
by the example of a buffer specification in the context of a production system.
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Flake S, Müller W. Past- and Future-Oriented Time-Bound Temporal Properties
with OCL. In: Proceedings of SEFM´04. IEEE; 2004. doi:10.1109/SEFM.2004.1347516'
apa: Flake, S., & Müller, W. (2004). Past- and Future-Oriented Time-Bound Temporal
Properties with OCL. Proceedings of SEFM´04. Proceedings of the Second
International Conference on Software Engineering and Formal Methods. https://doi.org/10.1109/SEFM.2004.1347516
bibtex: '@inproceedings{Flake_Müller_2004, place={Beijing, China}, title={Past-
and Future-Oriented Time-Bound Temporal Properties with OCL}, DOI={10.1109/SEFM.2004.1347516},
booktitle={Proceedings of SEFM´04}, publisher={IEEE}, author={Flake, Stephan and
Müller, Wolfgang}, year={2004} }'
chicago: 'Flake, Stephan, and Wolfgang Müller. “Past- and Future-Oriented Time-Bound
Temporal Properties with OCL.” In Proceedings of SEFM´04. Beijing, China:
IEEE, 2004. https://doi.org/10.1109/SEFM.2004.1347516.'
ieee: 'S. Flake and W. Müller, “Past- and Future-Oriented Time-Bound Temporal Properties
with OCL,” presented at the Proceedings of the Second International Conference
on Software Engineering and Formal Methods, 2004, doi: 10.1109/SEFM.2004.1347516.'
mla: Flake, Stephan, and Wolfgang Müller. “Past- and Future-Oriented Time-Bound
Temporal Properties with OCL.” Proceedings of SEFM´04, IEEE, 2004, doi:10.1109/SEFM.2004.1347516.
short: 'S. Flake, W. Müller, in: Proceedings of SEFM´04, IEEE, Beijing, China, 2004.'
conference:
name: ' Proceedings of the Second International Conference on Software Engineering
and Formal Methods'
date_created: 2023-01-24T09:03:36Z
date_updated: 2023-01-24T09:03:41Z
department:
- _id: '672'
doi: 10.1109/SEFM.2004.1347516
keyword:
- Unified modeling language
- Logic
- Clocks
- Boolean functions
- Application software
- Time factors
- Real time systems
- Formal verification
- Buffer storage
- Software packages
language:
- iso: eng
place: Beijing, China
publication: Proceedings of SEFM´04
publication_identifier:
isbn:
- 0-7695-2222-X
publisher: IEEE
status: public
title: Past- and Future-Oriented Time-Bound Temporal Properties with OCL
type: conference
user_id: '5786'
year: '2004'
...
---
_id: '34447'
abstract:
- lang: eng
text: "The Object Constraint Language (OCL) was introduced to support the specification
of constraints for UML diagrams and is mainly used to formulate invariants and
operation pre- and postconditions. Though OCL is also applied in behavioral diagrams,
e.g., as guards for state transitions, it is currently not possible to specify
constraints concerning the dynamic behavior and timing properties of such diagrams.\r\n\r\nThis
article discusses OCL’s application for the dynamic behavior of UML Statechart
diagrams and presents an OCL extension for specification of state-oriented time-bounded
constraints.We introduce operations to extract state configurations from diagrams
and define additional predicates over states and state configurations. The semantics
of our OCL extension is given by employing time-bounded Computational Tree Logic
(CTL) formulae. An example of a flexible manufacturing system with automated guided
vehicles demonstrates the application of our extension."
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Flake S, Müller W. An OCL Extension for Real-Time Constraints. In: Clark T,
Warmer J, eds. Advances in Object Modelling with the OCL. Springer-Verlag;
2002:150-171. doi:10.1007/3-540-45669-4_8'
apa: Flake, S., & Müller, W. (2002). An OCL Extension for Real-Time Constraints.
In T. Clark & J. Warmer (Eds.), Advances in Object Modelling with the OCL
(pp. 150–171). Springer-Verlag. https://doi.org/10.1007/3-540-45669-4_8
bibtex: '@inbook{Flake_Müller_2002, place={Berlin, Heidelberg}, title={An OCL Extension
for Real-Time Constraints}, DOI={10.1007/3-540-45669-4_8},
booktitle={Advances in Object Modelling with the OCL}, publisher={Springer-Verlag},
author={Flake, Stephan and Müller, Wolfgang}, editor={Clark, T. and Warmer, J.},
year={2002}, pages={150–171} }'
chicago: 'Flake, Stephan, and Wolfgang Müller. “An OCL Extension for Real-Time Constraints.”
In Advances in Object Modelling with the OCL, edited by T. Clark and J.
Warmer, 150–71. Berlin, Heidelberg: Springer-Verlag, 2002. https://doi.org/10.1007/3-540-45669-4_8.'
ieee: 'S. Flake and W. Müller, “An OCL Extension for Real-Time Constraints,” in
Advances in Object Modelling with the OCL, T. Clark and J. Warmer, Eds.
Berlin, Heidelberg: Springer-Verlag, 2002, pp. 150–171.'
mla: Flake, Stephan, and Wolfgang Müller. “An OCL Extension for Real-Time Constraints.”
Advances in Object Modelling with the OCL, edited by T. Clark and J. Warmer,
Springer-Verlag, 2002, pp. 150–71, doi:10.1007/3-540-45669-4_8.
short: 'S. Flake, W. Müller, in: T. Clark, J. Warmer (Eds.), Advances in Object
Modelling with the OCL, Springer-Verlag, Berlin, Heidelberg, 2002, pp. 150–171.'
date_created: 2022-12-15T11:38:20Z
date_updated: 2022-12-15T11:38:47Z
department:
- _id: '672'
doi: 10.1007/3-540-45669-4_8
editor:
- first_name: T.
full_name: Clark, T.
last_name: Clark
- first_name: J.
full_name: Warmer, J.
last_name: Warmer
keyword:
- Model Check Temporal Logic Object Constraint Language Execution Path Kripke
Structure
language:
- iso: eng
page: 150 - 171
place: Berlin, Heidelberg
publication: Advances in Object Modelling with the OCL
publication_identifier:
isbn:
- 978-3-540-45669-8
publisher: Springer-Verlag
status: public
title: An OCL Extension for Real-Time Constraints
type: book_chapter
user_id: '5786'
year: '2002'
...
---
_id: '39382'
abstract:
- lang: eng
text: We present a rigorous but transparent semantics definition of the SpecC language
that covers the execution of SpecC behaviors and their interaction with the kernel
process. The semantics include wait, wait for, par, and try statements as they
are introduced in SpecC. We present our definition in form of distributed abstract
state machine (ASM) rules strictly following the lines of the SpecC Language Reference
Manual. We mainly see our formal semantics in three application areas. First,
it is a concise, unambiguous description for documentation and standardization.
Second, it applies as a high-level, pseudo code-oriented specification for the
implementation of a SpecC simulator. Finally, it is a first step for SpecC synthesis
in order to identify similar concepts with other languages like VHDL and SystemC
for the definition of common patterns and language subsets.
author:
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Rainer
full_name: Dömer, Rainer
last_name: Dömer
- first_name: Andreas
full_name: Gerstlauer, Andreas
last_name: Gerstlauer
citation:
ama: 'Müller W, Dömer R, Gerstlauer A. The Formal Execution Semantics of SpecC.
In: Proceedings of the ISSS02. ; 2002. doi:10.1145/581199.581234 '
apa: Müller, W., Dömer, R., & Gerstlauer, A. (2002). The Formal Execution Semantics
of SpecC. Proceedings of the ISSS02. https://doi.org/10.1145/581199.581234
bibtex: '@inproceedings{Müller_Dömer_Gerstlauer_2002, place={Nagoya, Japan}, title={The
Formal Execution Semantics of SpecC}, DOI={10.1145/581199.581234 }, booktitle={Proceedings of the ISSS02}, author={Müller,
Wolfgang and Dömer, Rainer and Gerstlauer, Andreas}, year={2002} }'
chicago: Müller, Wolfgang, Rainer Dömer, and Andreas Gerstlauer. “The Formal Execution
Semantics of SpecC.” In Proceedings of the ISSS02. Nagoya, Japan, 2002.
https://doi.org/10.1145/581199.581234
.
ieee: 'W. Müller, R. Dömer, and A. Gerstlauer, “The Formal Execution Semantics of
SpecC,” 2002, doi: 10.1145/581199.581234
.'
mla: Müller, Wolfgang, et al. “The Formal Execution Semantics of SpecC.” Proceedings
of the ISSS02, 2002, doi:10.1145/581199.581234
.
short: 'W. Müller, R. Dömer, A. Gerstlauer, in: Proceedings of the ISSS02, Nagoya,
Japan, 2002.'
date_created: 2023-01-24T10:10:24Z
date_updated: 2023-01-24T10:10:28Z
department:
- _id: '672'
doi: '10.1145/581199.581234 '
keyword:
- Standardization
- Kernel
- Permission
- Formal verification
- Logic functions
- Documentation
- Reasoning about programs
- Specification languages
- Formal specifications
- Software systems
language:
- iso: eng
place: Nagoya, Japan
publication: Proceedings of the ISSS02
publication_identifier:
isbn:
- 1-58113-576-9
status: public
title: The Formal Execution Semantics of SpecC
type: conference
user_id: '5786'
year: '2002'
...
---
_id: '39403'
abstract:
- lang: eng
text: The Unified Modeling Language (UML) has received wide acceptance as a standard
language in the field of software specification by means of different diagram
types. In a recent version of UML, the textual Object Constraint Language (OCL)
was introduced to support specification of constraints for UML models. But OCL
currently does not provide sufficient means to specify constraints over the dynamic
behavior of a model. This article presents an OCL extension that is consistent
with current OCL and enables modelers to specify state-related time-bounded constraints.
We consider the case study of a flexible manufacturing system and identify typical
real-time constraints. The constraints are presented in our temporal OCL extension
as well as in temporal logic formulae. For general application, we define a semantics
of our OCL extension by means of a time-bounded temporal logic based on Computational
Tree Logic (CTL).
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Flake S, Müller W. Specification of Real-Time Properties for UML Models. In:
Proceedings of HICSS-35. ; 2002. doi:10.1109/HICSS.2002.994469'
apa: Flake, S., & Müller, W. (2002). Specification of Real-Time Properties for
UML Models. Proceedings of HICSS-35. Proceedings of the 35th Annual Hawaii
International Conference on System Sciences, Big Island, HI, USA . https://doi.org/10.1109/HICSS.2002.994469
bibtex: '@inproceedings{Flake_Müller_2002, place={Big Island, HI, USA }, title={Specification
of Real-Time Properties for UML Models}, DOI={10.1109/HICSS.2002.994469},
booktitle={Proceedings of HICSS-35}, author={Flake, Stephan and Müller, Wolfgang},
year={2002} }'
chicago: Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties
for UML Models.” In Proceedings of HICSS-35. Big Island, HI, USA , 2002.
https://doi.org/10.1109/HICSS.2002.994469.
ieee: 'S. Flake and W. Müller, “Specification of Real-Time Properties for UML Models,”
presented at the Proceedings of the 35th Annual Hawaii International Conference
on System Sciences, Big Island, HI, USA , 2002, doi: 10.1109/HICSS.2002.994469.'
mla: Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties
for UML Models.” Proceedings of HICSS-35, 2002, doi:10.1109/HICSS.2002.994469.
short: 'S. Flake, W. Müller, in: Proceedings of HICSS-35, Big Island, HI, USA ,
2002.'
conference:
location: 'Big Island, HI, USA '
name: Proceedings of the 35th Annual Hawaii International Conference on System Sciences
date_created: 2023-01-24T10:22:12Z
date_updated: 2023-01-24T10:22:16Z
department:
- _id: '672'
doi: 10.1109/HICSS.2002.994469
keyword:
- Unified modeling language
- Logic
- Formal verification
- Real time systems
- Programming profession
- Vehicle dynamics
- Software standards
- Flexible manufacturing systems
- Electronics industry
- Protocols
language:
- iso: eng
place: 'Big Island, HI, USA '
publication: Proceedings of HICSS-35
publication_identifier:
isbn:
- 0-7695-1435-9
status: public
title: Specification of Real-Time Properties for UML Models
type: conference
user_id: '5786'
year: '2002'
...
---
_id: '39421'
abstract:
- lang: eng
text: We present a rigorous but transparent semantics definition of SystemC that
covers method, thread, and clocked thread behavior as well as their interaction
with the simulation kernel process. The semantics includes watching statements,
signal assignment, and wait statements as they are introduced in SystemC V1.O.
We present our definition in form of distributed Abstract State Machines (ASMs)
rules reflecting the view given in the SystemC User's Manual and the reference
implementation. We mainly see our formal semantics as a concise, unambiguous,
high-level specification for SystemC-based implementations and for standardization.
Additionally, it can be used as a sound basis to investigate SystemC interoperability
with Verilog and VHDL.
author:
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Jürgen
full_name: Ruf, Jürgen
last_name: Ruf
- first_name: D. W.
full_name: Hoffmann, D. W.
last_name: Hoffmann
- first_name: Joachim
full_name: Gerlach, Joachim
last_name: Gerlach
- first_name: Thomas
full_name: Kropf, Thomas
last_name: Kropf
- first_name: W.
full_name: Rosenstiehl, W.
last_name: Rosenstiehl
citation:
ama: 'Müller W, Ruf J, Hoffmann DW, Gerlach J, Kropf T, Rosenstiehl W. The Simulation
Semantics of SystemC. In: Proceedings of the Design, Automation, and Test in
Europe (DATE’01). IEEE; 2001. doi:10.1109/DATE.2001.915002'
apa: Müller, W., Ruf, J., Hoffmann, D. W., Gerlach, J., Kropf, T., & Rosenstiehl,
W. (2001). The Simulation Semantics of SystemC. Proceedings of the Design,
Automation, and Test in Europe (DATE’01). Proceedings Design, Automation
and Test in Europe. Conference and Exhibition 2001. https://doi.org/10.1109/DATE.2001.915002
bibtex: '@inproceedings{Müller_Ruf_Hoffmann_Gerlach_Kropf_Rosenstiehl_2001, place={Munich,
Germany }, title={The Simulation Semantics of SystemC}, DOI={10.1109/DATE.2001.915002},
booktitle={Proceedings of the Design, Automation, and Test in Europe (DATE’01)},
publisher={IEEE}, author={Müller, Wolfgang and Ruf, Jürgen and Hoffmann, D. W.
and Gerlach, Joachim and Kropf, Thomas and Rosenstiehl, W.}, year={2001} }'
chicago: 'Müller, Wolfgang, Jürgen Ruf, D. W. Hoffmann, Joachim Gerlach, Thomas
Kropf, and W. Rosenstiehl. “The Simulation Semantics of SystemC.” In Proceedings
of the Design, Automation, and Test in Europe (DATE’01). Munich, Germany :
IEEE, 2001. https://doi.org/10.1109/DATE.2001.915002.'
ieee: 'W. Müller, J. Ruf, D. W. Hoffmann, J. Gerlach, T. Kropf, and W. Rosenstiehl,
“The Simulation Semantics of SystemC,” presented at the Proceedings Design, Automation
and Test in Europe. Conference and Exhibition 2001, 2001, doi: 10.1109/DATE.2001.915002.'
mla: Müller, Wolfgang, et al. “The Simulation Semantics of SystemC.” Proceedings
of the Design, Automation, and Test in Europe (DATE’01), IEEE, 2001, doi:10.1109/DATE.2001.915002.
short: 'W. Müller, J. Ruf, D.W. Hoffmann, J. Gerlach, T. Kropf, W. Rosenstiehl,
in: Proceedings of the Design, Automation, and Test in Europe (DATE’01), IEEE,
Munich, Germany , 2001.'
conference:
name: ' Proceedings Design, Automation and Test in Europe. Conference and Exhibition
2001'
date_created: 2023-01-24T10:39:33Z
date_updated: 2023-01-24T10:39:38Z
department:
- _id: '672'
doi: 10.1109/DATE.2001.915002
keyword:
- Yarn
- Formal verification
- Kernel
- Hardware design languages
- Electronic design automation and methodology
- Algebra
- Computational modeling
- Logic functions
- Computer languages
- Clocks
language:
- iso: eng
place: 'Munich, Germany '
publication: Proceedings of the Design, Automation, and Test in Europe (DATE’01)
publication_identifier:
isbn:
- 0-7695-0993-2
publisher: IEEE
status: public
title: The Simulation Semantics of SystemC
type: conference
user_id: '5786'
year: '2001'
...