The complexity of stochastic games
Information and Computation
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
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Dual-Priced modal transition systems with time durations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Moving from specifications to contracts in component-based design
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Ariadne: dominance checking of nonlinear hybrid automata using reachability analysis
RP'12 Proceedings of the 6th international conference on Reachability Problems
Weighted modal transition systems
Formal Methods in System Design
A completion algorithm for lattice tree automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Specification theories as a tool in the development process of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature and hence fragile and unsuited for modern software systems. We propose the first specification theory which allows to capture quantitative aspects during the refinement and implementation process.