Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Gebler

dblp:117/9238 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0002-6549-9418ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 4 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 50% Automata and formal languages · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
probabilistic transition systems
0.212016
A general SOS theory for the specification of probabilistic transition systems · Inf. Comput. 2016
Logic in computer science › program semantics › operational semantics
structural operational semantics
0.212016
A general SOS theory for the specification of probabilistic transition systems · Inf. Comput. 2016
YearPublicationVenuePosition
2018 SOS specifications for uniformly continuous operators
Daniel Gebler, Simone Tini
J. Comput. Syst. Sci.1
2018 SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes
abstract
We propose a method for the decomposition of modal formulae on processes with nondeterminism and probability with respect to Structural Operational Semantics. The purpose is to reduce the satisfaction problem of a formula for a process to verifying whether its subprocesses satisfy certain formulae obtained from the decomposition. To deal with the probabilistic behavior of processes, and thus with the decomposition of formulae characterizing it, we introduce a SOS-like machinery allowing for the specification of the behavior of open distribution terms. By our decomposition, we obtain (pre)congruence formats for probabilistic bisimilarity, ready similarity and similarity.
Valentina Castiglioni, Daniel Gebler, Simone Tini
Log. Methods Comput. Sci.2
2016 Modal Decomposition on Nondeterministic Probabilistic Processes
abstract
We propose a SOS-based method for decomposing modal formulae for nondeterministic probabilistic processes. The purpose is to reduce the satisfaction problem of a formula for a process to verifying whether its subprocesses satisfy certain formulae obtained from its decomposition. By our decomposition, we obtain (pre)congruence formats for probabilistic bisimilarity, ready similarity and similarity.
Valentina Castiglioni, Daniel Gebler, Simone Tini
CONCUR2
2016 Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
Wenjie Du 0001, Yuxin Deng 0001, Daniel Gebler
SETTA3
2016 A general SOS theory for the specification of probabilistic transition systems
Pedro R. D'Argenio, Daniel Gebler, Matias David Lee
Inf. Comput.2
2015 SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators
abstract
Compositional reasoning over probabilistic systems wrt. behavioral metric semantics requires the language operators to be uniformly continuous. We study which SOS specifications define uniformly continuous operators wrt. bisimulation metric semantics. We propose an expressive specification format that allows us to specify operators of any given modulus of continuity. Moreover, we provide a method that allows to derive from any given specification the modulus of continuity of its operators.
Daniel Gebler, Simone Tini
CONCUR1
2015 Compositional Metric Reasoning with Probabilistic Process Calculi
Daniel Gebler, Kim G. Larsen, Simone Tini
FoSSaCS1
2014 Generalized Bisimulation Metrics
Konstantinos Chatzikokolakis 0001, Daniel Gebler, Catuscia Palamidessi
CONCUR2
2014 Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
Pedro R. D'Argenio, Daniel Gebler, Matias David Lee
FoSSaCS2
2012 Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
Daniel Gebler, Wan J. Fokkink
CONCUR1