Model checking and synthesis for branching multi-weighted logics

Autor: Isabella Kaufmann, Lasse S. Jensen, Jiri Srba, Kim Guldstrand Larsen, Søren M. Nielsen

Publikováno v: Journal of Logic and Algebraic Programming
Jensen, J S, Kaufmann, I, Larsen, K G, Nielsen, S M & Srba, J 2019, ' Model Checking and Synthesis for Branching Multi-Weighted Logics ', Journal of Logic and Algebraic Programming, vol. 105, no. 1, pp. 28-46 . https://doi.org/10.1016/j.jlamp.2019.02.001

We investigate the open synthesis problem in a quantitative game theoretic setting where the system model is annotated with multiple nonnegative weights representing quantitative resources such as energy, discrete time or cost. We consider system spe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff4f793e6851e3664003baa8d2026f62
https://doi.org/10.1016/j.jlamp.2019.02.001

Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation

Autor: Samuel Pastva, Søren Enevoldsen, Tobias Skovgaard Jepsen, Andreas Engelbredt Dalsgaard, Peter Fogh, Mads Chr. Olesen, Søren M. Nielsen, Jiri Srba, Lasse S. Jensen, Isabella Kaufmann, Kim Guldstrand Larsen

Publikováno v: Lecture Notes in Computer Science
Dalsgaard, A E, Enevoldsen, S, Fogh, P, Jensen, L S, Jepsen, T S, Kaufmann, I, Larsen, K G, Nielsen, S M, Olesen, M C, Pastva, S & Srba, J 2017, Extended dependency graphs and efficient distributed fixed-point computation . in Application and Theory of Petri Nets and Concurrency-38th International Conference, PETRI NETS 2017, Proceedings . vol. 10258 LNCS, Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10258 LNCS, pp. 139-158, 38th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2017, Zaragoza, Spain, 25/06/2017 . https://doi.org/10.1007/978-3-319-57861-3_10
Lecture Notes in Computer Science-Application and Theory of Petri Nets and Concurrency
Application and Theory of Petri Nets and Concurrency ISBN: 9783319578606
Petri Nets

Equivalence and model checking problems can be encoded into computing fixed points on dependency graphs. Dependency graphs represent causal dependencies among the nodes of the graph by means of hyper-edges. We suggest to extend the model of dependenc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f69bc694405657c6a46c5e244d5db6d