Automata, Languages and Programming

DOI10.1007/b99859zbMath1098.68092OpenAlexW2505584480MaRDI QIDQ5466453

Mariëlle I. A. Stoelinga, Marco Faella, Luca de Alfaro

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (26)

Recursively defined metric spaces without contraction ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Probabilistic Weighted Automata ⋮ Converging from branching to linear metrics on Markov chains ⋮ SOS specifications for uniformly continuous operators ⋮ Quantitative safety and liveness ⋮ Up-to techniques for behavioural metrics via fibrations ⋮ Model checking games for the quantitative \(\mu \)-calculus ⋮ On behavioural pseudometrics and closure ordinals ⋮ Approximate simulation relations for hybrid systems ⋮ Fixpoint theory -- upside down ⋮ A quantified coalgebraic van Benthem theorem ⋮ Up-To Techniques for Behavioural Metrics via Fibrations ⋮ Approximate bisimulation relations for constrained linear systems ⋮ Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems ⋮ Model Checking Quantitative Linear Time Logic ⋮ A Behavioural Pseudometric based on λ–Bisimilarity ⋮ Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Unnamed Item ⋮ Quantitative analysis of weighted transition systems ⋮ Robustness of temporal logic specifications for continuous-time signals ⋮ Compositionality for quantitative specifications ⋮ Approximate equivalence and synchronization of metric transition systems ⋮ Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity ⋮ Compositional weak metrics for group key update

This page was built for publication: Automata, Languages and Programming