Metrics for weighted transition systems: axiomatization and complexity
DOI10.1016/J.TCS.2011.04.003zbMATH Open1216.68191OpenAlexW2092216144MaRDI QIDQ549202FDOQ549202
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- The complexity of stochastic games
- On the regularization of Zeno hybrid automata
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Metrics for labelled Markov processes
- Handbook of process algebra
- CCS expressions, finite state processes, and three problems of equivalence
- A complete inference system for a class of regular behaviours
- Simulation distances
- Title not available (Why is that?)
- Metrics for weighted transition systems: axiomatization and complexity
- Formal Modeling and Analysis of Timed Systems
- Quantitative analysis of weighted transition systems
- Transfinite reductions in orthogonal term rewriting systems
- Looking for MUM and DAD: Text-text comparisons do help
- Title not available (Why is that?)
- Topologies, Continuity and Bisimulations
Cited In (25)
- Title not available (Why is that?)
- Simulation for lattice-valued doubly labeled transition systems
- General quantitative specification theories with modal transition systems
- Automata, Languages and Programming
- Metrics for weighted transition systems: axiomatization and complexity
- Quantitative analysis of weighted transition systems
- Simulation distances
- Simulation distances
- Kantorovich functors and characteristic logics for behavioural distances
- Weighted modal transition systems
- Quantitative simulation games
- Computing branching distances with quantitative games
- Quantitative analysis of software approximate correctness
- Specification Theories for Probabilistic and Real-Time Systems
- Interface simulation distances
- Distances between processes: a pure algebraic approach
- Generalized quantitative analysis of metric transition systems
- Parametric and quantitative extensions of modal transition systems
- Some complexity results on transition systems and elementary net systems
- The quantitative linear-time-branching-time spectrum
- Multi-weighted automata and MSO logic
- Convex lattice equation systems
- Title not available (Why is that?)
- Approximate equivalence and synchronization of metric transition systems
- Title not available (Why is that?)
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)
