default search action
Jens Chr. Godskesen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j7]Lijun Zhang, Pengfei Yang, Lei Song, Holger Hermanns, Christian Eisentraut, David N. Jansen, Jens Chr. Godskesen:
Probabilistic bisimulation for realistic schedulers. Acta Informatica 55(6): 461-488 (2018) - 2015
- [c25]Christian Eisentraut, Jens Chr. Godskesen, Holger Hermanns, Lei Song, Lijun Zhang:
Probabilistic Bisimulation for Realistic Schedulers. FM 2015: 248-264 - 2014
- [j6]Lei Song, Lijun Zhang, Holger Hermanns, Jens Chr. Godskesen:
Incremental Bisimulation Abstraction Refinement. ACM Trans. Embed. Comput. Syst. 13(4s): 142:1-142:23 (2014) - [c24]Lei Song, Lijun Zhang, Jens Chr. Godskesen:
Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes. VMCAI 2014: 98-117 - 2013
- [j5]Lei Song, Lijun Zhang, Jens Chr. Godskesen:
Bisimulations Meet PCTL Equivalences for Probabilistic Automata. Log. Methods Comput. Sci. 9(2) (2013) - [c23]Lei Song, Lijun Zhang, Holger Hermanns, Jens Chr. Godskesen:
Incremental Bisimulation Abstraction Refinement. ACSD 2013: 11-20 - 2012
- [c22]Lei Song, Jens Chr. Godskesen:
Broadcast Abstraction in a Stochastic Calculus for Mobile Networks. IFIP TCS 2012: 342-356 - [i2]Lei Song, Lijun Zhang, Jens Chr. Godskesen:
Late Weak Bisimulation for Markov Automata. CoRR abs/1202.4116 (2012) - [i1]Lei Song, Lijun Zhang, Jens Chr. Godskesen:
The Branching Time Spectrum for Continuous-time MDPs. CoRR abs/1204.1848 (2012) - 2011
- [c21]Lei Song, Lijun Zhang, Jens Chr. Godskesen:
Bisimulations Meet PCTL Equivalences for Probabilistic Automata. CONCUR 2011: 108-123 - 2010
- [c20]Jens Chr. Godskesen:
Observables for Mobile and Wireless Broadcasting Systems. COORDINATION 2010: 1-15 - [c19]Lei Song, Jens Chr. Godskesen:
Probabilistic Mobility Models for Mobile and Wireless Networks. IFIP TCS 2010: 86-100
2000 – 2009
- 2009
- [c18]Jens Chr. Godskesen, Sebastian Nanz:
Mobility Models and Behavioural Equivalence for Wireless Networks. COORDINATION 2009: 106-122 - [e1]Jens Chr. Godskesen, Massimo Merro:
Proceedings of the First Workshop on Formal Methods for Wireless Systems, FMWS@CONCUR 2008, Toronto, ON, Canada, August 23, 2008. Electronic Notes in Theoretical Computer Science 242(2), Elsevier 2009 [contents] - 2008
- [c17]Jens Chr. Godskesen, Massimo Merro:
Preface. FMWS@CONCUR 2008: 1 - [c16]Jens Chr. Godskesen, Hans Hüttel, Morten Kühnrich:
Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks. FOCLASA@ICALP 2008: 77-93 - [c15]Mikkel Bundgaard, Jens Chr. Godskesen, Bjørn Haagensen, Hans Hüttel:
Decidable Fragments of a Higher Order Calculus with Locations. EXPRESS 2008: 113-138 - [c14]Jens Chr. Godskesen:
A Calculus for Mobile Ad-hoc Networks with Static Location Binding. EXPRESS 2008: 161-183 - 2007
- [c13]Jens Chr. Godskesen:
A Calculus for Mobile Ad Hoc Networks. COORDINATION 2007: 132-150 - [c12]Mikkel Bundgaard, Thomas T. Hildebrandt, Jens Chr. Godskesen:
Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources. SecCO@CONCUR 2007: 23-38 - 2006
- [j4]Mikkel Bundgaard, Thomas T. Hildebrandt, Jens Chr. Godskesen:
A CPS encoding of name-passing in Higher-order mobile embedded resources. Theor. Comput. Sci. 356(3): 422-439 (2006) - 2005
- [c11]Jens Chr. Godskesen, Thomas T. Hildebrandt:
Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names. FSTTCS 2005: 140-151 - 2004
- [j3]Jens Chr. Godskesen:
Connectivity Testing. Formal Methods Syst. Des. 25(1): 5-38 (2004) - [c10]Jens Chr. Godskesen, Brian Nielsen, Arne Skou:
Connectivity Testing Through Model-Checking. FORTE 2004: 167-184 - [c9]Mikkel Bundgaard, Thomas T. Hildebrandt, Jens Chr. Godskesen:
A CPS Encoding of Name-Passing in Higher-Order Mobile Embedded Resources. EXPRESS 2004: 131-150 - 2002
- [c8]Jens Chr. Godskesen, Thomas T. Hildebrandt, Vladimiro Sassone:
A Calculus of Mobile Resources. CONCUR 2002: 272-287
1990 – 1999
- 1998
- [j2]Lars Bækgaard, Jens Chr. Godskesen:
Real-time event control in active databases. J. Syst. Softw. 42(3): 263-271 (1998) - 1996
- [c7]Simon Mørk, Jens Chr. Godskesen, Michael R. Hansen, Robin Sharp:
A Timed Semantics for SDL. FORTE 1996: 295-309 - 1995
- [j1]Jens Chr. Godskesen, Kim Guldstrand Larsen:
Synthesizing Distinguishing Formulae for Real Time Systems. Nord. J. Comput. 2(3): 338-357 (1995) - [c6]Jens Chr. Godskesen:
A Formal Framework for Feature Interaction with Emphasis on Testing. FIW 1995: 21-30 - [c5]Jens Chr. Godskesen, Kim Guldstrand Larsen:
Synthesizing Distinguishing Formulae for Real Time Systems (Extended Abstract). MFCS 1995: 519-528 - 1994
- [c4]Jens Chr. Godskesen, Kim Guldstrand Larsen, Arne Skou:
Automatic verification of real-tim systems using epsilon. PSTV 1994: 323-330 - 1993
- [c3]Karlis Cerans, Jens Chr. Godskesen, Kim Guldstrand Larsen:
Timed Modal Specification - Theory and Tools. CAV 1993: 253-267 - 1992
- [c2]Jens Chr. Godskesen, Kim Guldstrand Larsen:
Real-Time Calculi and Expansion Theorems. FSTTCS 1992: 302-315 - [c1]Jens Chr. Godskesen, Kim Guldstrand Larsen:
Real-Time Calculi and Expansion Theorems. NAPAW 1992: 3-12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint