Formal Modeling and Analysis of Timed Systems

DOI10.1007/11603009zbMath1175.68281OpenAlexW2493457341MaRDI QIDQ5897965

Vinayak S. Prabhu, Rupak Majumdar, Thomas A. Henzinger

Publication date: 14 November 2006

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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 (15)

Crossing the Bridge between Similar Games ⋮ Predictable real-time software synthesis ⋮ General quantitative specification theories with modal transition systems ⋮ Convex lattice equation systems ⋮ Computing branching distances with quantitative games ⋮ The quantitative linear-time-branching-time spectrum ⋮ The approximate correctness of systems based on \(\delta\)-bisimulation ⋮ Unifying behavioral equivalences of timed transition systems ⋮ Metrics for weighted transition systems: axiomatization and complexity ⋮ Discount-Optimal Infinite Runs in Priced Timed Automata ⋮ Quantitative analysis of weighted transition systems ⋮ Robustness of temporal logic specifications for continuous-time signals ⋮ Compositionality for quantitative specifications ⋮ Timed Automata Can Always Be Made Implementable ⋮ Dynamics of reputation in mobile agents systems and weighted timed automata

This page was built for publication: Formal Modeling and Analysis of Timed Systems