Metrics for weighted transition systems: axiomatization and complexity

DOI10.1016/J.TCS.2011.04.003MaRDI QIDQ549202zbMATHOpenAlexFDO

Authors Uli Fahrenberg, Claus Thrane, Kim G. Larsen

Publication date 7 July 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01088055/file/tcs.pdf

zbMATH Keywords

complexityaxiomatizationsystem distanceweighted transition system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automata, Languages and Programming
• Simulation distances
• Simulation distances
• Quantitative analysis of weighted transition systems
• Distances for weighted transition systems: games and properties

Cites work

• scientific article; zbMATH DE number 1107491 (Why is no real title available?)
• A complete inference system for a class of regular behaviours
• A quantitative characterization of weighted Kripke structures in temporal logic
• CCS expressions, finite state processes, and three problems of equivalence
• Formal Modeling and Analysis of Timed Systems
• Handbook of process algebra
• Looking for MUM and DAD: text-text comparisons do help
• Metrics for labelled Markov processes
• Metrics for weighted transition systems: axiomatization and complexity
• On the regularization of Zeno hybrid automata
• Quantitative analysis of weighted transition systems
• Simulation distances
• The complexity of stochastic games
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Topologies, Continuity and Bisimulations
• Transfinite reductions in orthogonal term rewriting systems

Cited in

(29)

• Interface simulation distances
• Simulation for lattice-valued doubly labeled transition systems
• Weighted modal transition systems
• Weighted branching systems: behavioural equivalence, behavioural distance, and their logical characterisations
• A complete approximation theory for weighted transition systems
• scientific article; zbMATH DE number 6987095 (Why is no real title available?)
• The quantitative linear-time-branching-time spectrum
• Convex lattice equation systems
• General quantitative specification theories with modal transition systems
• Approximate equivalence and synchronization of metric transition systems
• Quantitative simulation games
• Quantitative analysis of weighted transition systems
• Simulation distances
• Computing branching distances with quantitative games
• Metrics for weighted transition systems: axiomatization and complexity
• Weak simulation quasimetric in a gossip scenario
• Parametric and quantitative extensions of modal transition systems
• Some complexity results on transition systems and elementary net systems
• Polynomial-time algorithms for computing distances of fuzzy transition systems
• scientific article; zbMATH DE number 7566075 (Why is no real title available?)
• Automata, Languages and Programming
• Specification Theories for Probabilistic and Real-Time Systems
• Distances between processes: a pure algebraic approach
• Kantorovich functors and characteristic logics for behavioural distances
• Quantitative analysis of software approximate correctness
• Simulation distances
• scientific article; zbMATH DE number 1107491 (Why is no real title available?)
• Interface simulation distances
• Generalized quantitative analysis of metric transition systems

This page was built for publication: Metrics for weighted transition systems: axiomatization and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549202)