The complexity of stochastic games
Information and Computation
Generalized metric spaces: completion, topology, and power domains via the Yoneda embedding
Theoretical Computer Science
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Complexity of Mean Payoff Games
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Synchronous and Bidirectional Component Interfaces
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Symbolic algorithms for verification and control
Symbolic algorithms for verification and control
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Weighted automata and weighted logics
Theoretical Computer Science
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear and Branching System Metrics
IEEE Transactions on Software Engineering
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Handbook of Weighted Automata
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Quantitative refinement for weighted modal transition systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Theoretical Computer Science
Statistical abstraction and model-checking of large heterogeneous systems
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Extending modal transition systems with structured labels
Mathematical Structures in Computer Science
Hi-index | 0.00 |
Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore fragile in the sense that the inevitable approximation of systems by models, combined with the fundamental unpredictability of hardware platforms, makes it difficult to transfer conclusions about the behavior, based on models, to the actual system. Hence this approach is arguably unsuited for modern software systems. We propose here the first specification theory which allows to capture quantitative aspects during the refinement and implementation process, thus leveraging the problems of the qualitative setting.Our proposed quantitative specification framework uses weighted modal transition systems as a formal model of specifications. These are labeled transition systems with the additional feature that they can model optional behavior which may or may not be implemented by the system. Satisfaction and refinement is lifted from the well-known qualitative to our quantitative setting, by introducing a notion of distances between weighted modal transition systems. We show that quantitative versions of parallel composition as well as quotient (the dual to parallel composition) inherit the properties from the Boolean setting.