( en | de | ru )

 

Disambiguation of "Jansen, David N."

Author of the publication

copydeleteadd this publication to your clipboard
Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata.

, , and . QEST, page 311-322. IEEE Computer Society, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

David Jansen

David N Ehrat

n n n

n AÊ¿w n

N -L N Nguyen

 

Other publications of authors with the same name

Stuttering equivalence is too slow!, and . CoRR, (2016)An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation., , , and . ACM Trans. Comput. Log., 18 (2): 13:1-13:34 (2017)Formal Verification of Consensus in the Taurus Distributed Database., , , , , , and . FM, volume 13047 of Lecture Notes in Computer Science, page 741-751. Springer, (2021)CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper)., , , , , , and . SEFM, volume 13550 of Lecture Notes in Computer Science, page 324-331. Springer, (2022)Fortuna: Model Checking Priced Probabilistic Timed Automata., , and . QEST, page 273-281. IEEE Computer Society, (2010)Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata., , and . QEST, page 311-322. IEEE Computer Society, (2006)Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts., , and . Requir. Eng., 7 (4): 243-263 (2002)Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS., , , and . Formal Aspects Comput., 35 (4): 25:1-25:21 (December 2023)A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems., , , and . CoRR, (2019)Accelerated Verification of Parametric Protocols with Decision Trees., , , , and . ICCD, page 397-404. IEEE, (2020)