General quantitative specification theories with modal transition systems
From MaRDI portal
Publication:404008
DOI10.1007/S00236-014-0196-8zbMATH Open1360.68585OpenAlexW2034111423MaRDI QIDQ404008FDOQ404008
Publication date: 29 August 2014
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01087314/file/Acta-27-12.pdf
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theory of timed automata
- A lattice-theoretical fixpoint theorem and its applications
- Verification, Model Checking, and Abstract Interpretation
- Positional strategies for mean payoff games
- Timed I/O automata
- Timed Automata Can Always Be Made Implementable
- On determinism in modal transition systems
- Modal event-clock specifications for timed component-based design
- Weighted modal transition systems
- Dual-Priced Modal Transition Systems with Time Durations
- General Quantitative Specification Theories with Modalities
- Extending modal transition systems with structured labels
- The quantitative linear-time-branching-time spectrum
- Quantitative languages
- Quantitative Refinement for Weighted Modal Transition Systems
- Energy Games in Multiweighted Automata
- Modal Transition Systems: Composition and LTL Model Checking
- Simulation Distances
- Refinement and Consistency of Timed Modal Specifications
- Modal transition systems with weight intervals
- Metrics for weighted transition systems: axiomatization and complexity
- CONCUR 2005 – Concurrency Theory
- Formal Modeling and Analysis of Timed Systems
- Quantitative analysis of weighted transition systems
- On using priced timed automata to achieve optimal scheduling
Cited In (6)
- Computing branching distances with quantitative games
- A linear-time-branching-time spectrum for behavioral specification theories
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
- Compositionality for quantitative specifications
- Sequential Relational Decomposition
- Quantitative Modal Transition Systems
This page was built for publication: General quantitative specification theories with modal transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404008)
