Katoen, Joost-Pieter, 1964-
Katoen, Joost-Pieter
Katoen, Joost-Peter (1964- ).
Joost-Pieter Katoen researcher
VIAF ID: 59929404 ( Personal )
Permalink: http://viaf.org/viaf/59929404
Preferred Forms
- 100 0 _ ‡a Joost-Pieter Katoen ‡c researcher
-
- 100 1 0 ‡a Katoen, Joost-Pieter
- 100 1 _ ‡a Katoen, Joost-Pieter
-
-
-
- 100 1 _ ‡a Katoen, Joost-Pieter (sparse)
-
-
- 100 1 _ ‡a Katoen, Joost-Pieter ‡d 1964-
-
-
- 100 1 _ ‡a Katoen, Joost-Pieter, ‡d 1964-
4xx's: Alternate Name Forms (15)
5xx's: Related Names (9)
- 551 _ _ ‡a Aachen ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 510 2 _ ‡a Formal Methods and Tools (FMT)
- 551 _ _ ‡a Krimpen aan den Ijssel ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _ ‡a Proefschrift Universiteit Twente, Enschede
- 510 2 _ ‡a Rheinisch-Westfälische Technische Hochschule Aachen ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a TACAS 2002 (2002 : Grenoble, France)
- 510 2 _ ‡a Technische Hochschule Aachen
- 510 2 _ ‡a Technische Hogeschool Twente ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 551 _ _ ‡a Twente ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
Works
Title | Sources |
---|---|
Abstractions pour les automates temporisés | |
Abstraktions-basierte Verifikation von POMDPs im Motion-Planning-Kontext | |
Advanced weakest precondition calculi for probabilistic programs | |
Analyzing memory accesses for performance and correctness of parallel programs | |
ARTS'99 | |
Automated reasoning and randomization in separation logic | |
B-ISDN to the cell site switch versus B-ISDN to the mobile terminal | |
Bayesian Inference by Symbolic Model Checking | |
A Calculus for Amortized Expected Runtimes | |
Causal ambiguity and partial orders in event structures | |
Causal behaviours and nets | |
Code generation based on formal BURS theory and heuristic search | |
CONCUR 2011 - Concurrency theory : 22nd International Conference, CONCUR 2011 Aachen, Germany, September 6-9, 2011 Proceedings | |
Counterexamples in probabilistic verification | |
Dependable software engineering : theories, tools, and applications : 4th International Symposium, SETTA 2019, Shanghai, China, November 27-29, Proceedings | |
Dynamic fault tree analysis using binary decision diagrams | |
Erweiterte wp-Kalküle für Probabilistische Programme | |
Fine-Tuning the Odds in Bayesian Networks | |
Formal methods for real-time and probabilistic systems : 5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999 : proceedings | |
Foundations of probabilistic programming | |
Functional integration of UMTS and B-ISDN | |
Gradient descent on parametric Markov Chains | |
Interpretation-Based Violation Witness Validation for C NITWIT | |
Konzepte zur Laufzeiterkennung von kritischem Wettlauf für OpenSHMEM-Programme | |
Learning probabilistic automata with SMT solving | |
Lectures on formal methods and performance analysis : first EEF/Euro Summer School on Trends in Computer Science, Berg en Dal, The Netherlands, July 3-7, 2000 : revised lectures | |
Model-based reliability analysis of aerospace systems | |
ModelEd, TestEd, TrustEd : Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday | |
Modeling systems by probabilistic process algebra : an event structures approach | |
Monitoring CTMCs by Multi-clock Timed Automata | |
Multi-objective Optimization of Long-run Average and Total Rewards | |
On the Complexity of Reachability in Parametric Markov Decision Processes | |
Parameter synthesis in Markov models | |
POMDP-based execution models for probabilistic programs with partial observability | |
PrIC3: Property Directed Reachability for MDPs | |
Principles of model checking | |
probabilistic model checker STORM | |
probabilistic termination tool amber | |
Probably on time and within budget : on reachability in prices probabilistic timed automatica | |
QEST 2011: fast abstracts | |
Quantitative and qualitative extensions of event structures | |
Quantitative and structural analysis of real-time and probabilistic systems | |
Randomized strategies in concurrent games. | |
Safe on-the-fly steady-state detection for time-bounded reachability | |
Scenario-based verification of uncertain parametric MDPs | |
Search and Explore: Symbiotic Policy Synthesis in POMDPs | |
Semantics and loop invariant synthesis for probabilistic programs | |
A semi-Markov model of a home network access protocol | |
Shepherding Hordes of Markov Chains | |
Simple Strategies in Multi-Objective MDPs | |
Sound Value Iteration | |
Stochastic games with lexicographic objectives | |
Stochastic simulation of event structures | |
Synthesizing FDIR recovery strategies for space systems | |
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming | |
Synthesizing optimal bias in randomized self-stabilization | |
"The systematic development of a pattern-matching algorithm using term rewrite systems | |
Tools and algorithms for the construction and analysis of systems : 8th International Conference, TACAS 2002, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002 : proceedings | |
Towards Concurrent Quantitative Separation Logic | |
A UMTS network architecture | |
Under-Approximating Expected Total Rewards in POMDPs | |
Validation of stochastic systems a guide to current research | |
Various Ways to Quantify BDMPs | |
Verification of multi-objective Markov models | |
Verification of pointer programs | |
Verifikation zeigermanipulierender Programme | |
Vers la prédiction de performance de modèles compositionnels dans les architectures GALS | |
Weighted programming a programming paradigm for specifying mathematical models | |
Who is pointing when to whom : on model-checking pointer structures |