Výsledky vyhledávání - "Godskesen, Jens Christian"

Aktører: Samarbejde med erhvervet er nøglen til forskningsbaserede startups

Autor: Mommsen, Morten, Thellersen, Marianne, Broeng, Jes, Westensee, John, Stigaard, Dorte, Godskesen, Jens Christian, Steffensen, Georg Dam, Gjede, Andreas Aasted, Winterø, Trine, Kjær, Peter

Publikováno v: Mommsen, M, Thellersen, M, Broeng, J, Westensee, J, Stigaard, D, Godskesen, J C, Steffensen, G D, Gjede, A A, Winterø, T & Kjær, P 2020, ' Aktører: Samarbejde med erhvervet er nøglen til forskningsbaserede startups ', Altinget . < https://www.altinget.dk/arbejdsmarked/artikel/debat-samarbejde-med-erhvervslivet-er-noeglen-til-forskningsbaserede-startups >

DEBAT: En vej til succesfuld innovation er, at erhvervslivet inviteres helt ind på universiteterne. Relationerne er vigtige, men tager tid at udvikle, skriver styregruppen for Open Entrepreneurship.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::29a4ca79098eaf8d9a101e1ccf9034c3
https://vbn.aau.dk/da/publications/569d88bb-578f-40d5-a6d8-6f25d7c3330b

Zobrazit plný text záznamu

Probabilistic Bisimulation for Realistic Schedulers

Autor: Eisentraut, Christian, Godskesen, Jens Christian, Hermanns, Holger, Song, Lei, Zhang, Lijun

Publikováno v: Eisentraut, C, Godskesen, J C, Hermanns, H, Song, L & Zhang, L 2015, Probabilistic Bisimulation for Realistic Schedulers . in FM 2015: Formal Methods : 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings . vol. 9109, Springer, Lecture Notes in Computer Science, pp. 248-264, The 20th International Symposium on Formal Methods, Oslo, Norway, 22/06/2015 . https://doi.org/10.1007/978-3-319-19249-9_16

Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally proposed for Markov automata. It has gained some popularity as the coarsest behavioral equivalence enjoying valuable properties like preservation of trace d

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2988::8c1edd4bc0447ec9634deb4a746517c7
https://pure.itu.dk/ws/files/81821873/MEALS_Deliverable_1.3_2.pdf

Zobrazit plný text záznamu

Bisimulation Meet PCTL Equivalences for Probabilistic Automata (Journal Version)

Autor: Song, Lei, Zhang, Lijun, Godskesen, Jens Christian

Publikováno v: Song, L, Zhang, L & Godskesen, J C 2013, ' Bisimulation Meet PCTL Equivalences for Probabilistic Automata (Journal Version) ', Logical Methods in Computer Science, vol. 9, no. 2 .

Probabilistic automata (PA) have been successfully applied in the formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2988::b41eb879320e88fb80e1292618fc82e2
https://pure.itu.dk/portal/da/publications/b1d96155-b491-4126-a0f3-396faa048150

Zobrazit plný text záznamu

Broadcast Abstraction in a Stochastic Calculus for Mobile Networks

Autor: Song, Lei, Godskesen, Jens Christian

Publikováno v: Song, L & Godskesen, J C 2012, Broadcast Abstraction in a Stochastic Calculus for Mobile Networks . in Theoretical Computer Science : Proceedings of the 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012 . vol. 4604, Springer, Lecture Notes in Computer Science, vol. 4604, pp. 342-356, IFIP Theoretical Computer Science 2012, Amsterdam, Netherlands, 26/09/2012 . < http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-33474-0 >

We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network is modeled by a stochastic mobility function which allows to change part of a network topology depending on an expo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2988::b12cde897b037d796fe4b5082f24fc36
https://pure.itu.dk/ws/files/37561702/TCS.pdf

Zobrazit plný text záznamu

Bisimulations Meet PCTL Equivalences for Probabilistic Automata

Autor: Song, Lei, Zhang, Lijun, Godskesen, Jens Christian

Publikováno v: Song, L, Zhang, L & Godskesen, J C 2011, Bisimulations Meet PCTL Equivalences for Probabilistic Automata . in CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory . Springer, pp. 108-123, 22nd International Conference on Concurrency Theory 2011 (CONCUR 2011), Aachen, Germany, 05/09/2011 . https://doi.org/10.1007/978-3-642-23217-6_8

Probabilistic automata (PA) have beensuccessfully applied in the formal verification of concurrent andstochastic systems. Efficient model checking algorithms have beenstudied, where the most often used logics for expressing propertiesare based on PCT

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2988::a48bd9e11eae4a4709c8fbacb358b57d
https://pure.itu.dk/ws/files/34476269/pctl.pdf

Zobrazit plný text záznamu

Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks

Autor: Hüttel, Hans, Kühnrich, Morten, Godskesen, Jens Christian

Publikováno v: Hüttel, H, Kühnrich, M & Godskesen, J C 2009, Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks . in Proceedings of the 7th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2008) . 229 edn, vol. 2, Elsevier, Electronic Notes in Theoretical Computer Science, no. 229, vol. 2, pp. 77-93, 7th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2008), Reykjavik, Iceland, 13/07/2008 . https://doi.org/doi:10.1016/j.entcs.2009.06.030

We introduce a novel process calculus called DBSPI (distributed broadcast SPI-calculus) which models mobile ad hoc networks (MANET). The calculus is a cryptographic broadcast calculus with locations and migration. Communication and migration are limi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::63adb848b6766011801c06c0333c6075
https://vbn.aau.dk/da/publications/4c389ea0-6aca-11dd-92a2-000ea68e967b

Zobrazit plný text záznamu

Decidable Fragments of a Higher Order Calculus with Locations

Autor: Hüttel, Hans, Godskesen, Jens Christian, Haagensen, Bjørn, Bundgaard, Mikkel

Publikováno v: Hüttel, H, Godskesen, J C, Haagensen, B & Bundgaard, M 2009, Decidable Fragments of a Higher Order Calculus with Locations . in D Gorla & T Hildebrandt (eds), Proceedings of the 15th Workshop on Expressiveness in Concurrency (EXPRESS 2008) . Elsevier, Electronic Notes in Theoretical Computer Science, no. 242, vol. 1, pp. 113-138, International Workshop on Expressiveness in Concurrency (EXPRESS'08), Toronto, Canada, 23/08/2008 . https://doi.org/doi:10.1016/j.entcs.2009.06.016

Homer is a higher order process calculus with locations. In this paper we study Homer in the setting of the semantic finite control property, which is a finite reachability criterion that implies decidability of barbed bisimilarity. We show that stro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d00bdf73d27897a31b40b5705fb83e5a
https://vbn.aau.dk/da/publications/5a94af40-6ac8-11dd-92a2-000ea68e967b

Zobrazit plný text záznamu