Computing branching distances with quantitative games (Q2210522): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PEPA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SpaceEx / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TAPAAL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRISM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HySAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2982420068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic analysis of hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking continuous-time Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Refinement for Weighted Modal Transition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted modal transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Quantitative Specification Theories with Modalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Runs in Weighted Timed Automata with Energy Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative fair simulation games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking discounted temporal properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositionality for quantitative specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time-branching-time spectrum for behavioral specification theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: General quantitative specification theories with modal transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantitative linear-time-branching-time spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing branching distances using quantitative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HySAT: An efficient proof engine for bounded model checking of hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Metrics for Discrete and Continuous Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured operational semantics and bisimulation as a congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: HyTech: A model checker for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Modeling and Analysis of Timed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Model Checking to Model Measuring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compositional Approach to Performance Modelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics for weighted transition systems: axiomatization and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uppaal in a nutshell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverability of Communication Protocols--Implications of a Theoretical Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative analysis of weighted transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to metric semantics: Operational and denotational models for programming and specification languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A behavioural pseudometric for probabilistic transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 00:40, 24 July 2024

scientific article
Language Label Description Also known as
English
Computing branching distances with quantitative games
scientific article

    Statements

    Computing branching distances with quantitative games (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quantitative verification
    0 references
    branching distance
    0 references
    quantitative game
    0 references
    path-building game
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references