Quantitative analysis of weighted transition systems

DOI10.1016/j.jlap.2010.07.010zbMath1204.68137OpenAlexW2094017389MaRDI QIDQ710680

Claus Thrane, Uli Fahrenberg, Kim Guldstrand Larsen

Publication date: 22 October 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.07.010

zbMATH Keywords

simulationquantitative analysishemimetricsweighted transition systemsweighted timed automatatrace inclusion

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (15)

Crossing the Bridge between Similar Games ⋮ General quantitative specification theories with modal transition systems ⋮ Quantitative safety and liveness ⋮ Convex lattice equation systems ⋮ Computing branching distances with quantitative games ⋮ Lattice-valued simulations for quantitative transition systems ⋮ The quantitative linear-time-branching-time spectrum ⋮ Limited approximate bisimulations and the corresponding rough approximations ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ Weighted modal transition systems ⋮ Metrics for weighted transition systems: axiomatization and complexity ⋮ Unnamed Item ⋮ Enhancing Automata Learning by Log-Based Metrics ⋮ Timed Automata Can Always Be Made Implementable ⋮ Simulation for lattice-valued doubly labeled transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal paths in weighted timed automata
• Weighted automata and weighted logics with discounting
• A theory of timed automata
• A structural approach to operational semantics
• Weighted automata and weighted logics
• Model checking discounted temporal properties
• Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
• A quantitative characterization of weighted Kripke structures in temporal logic
• On the definition of a family of automata
• Quantitative Languages
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Concavely-Priced Timed Automata
• Discount-Optimal Infinite Runs in Priced Timed Automata
• Hybrid Systems: Computation and Control
• Reactive Systems
• Automata, Languages and Programming
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Quantitative analysis of weighted transition systems