Formal Testing of Timed and Probabilistic Systems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-24580-0_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Model-Based Testing of Probabilistic Systems

Formal Aspects of Computing
Theoretical Computer ScienceSoftware
2018English

Development of Probabilistic Timed CEGAR

2014English

A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems

Annals of Mathematics and Artificial Intelligence
Applied MathematicsArtificial Intelligence
2007English

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

Combining Timed Coordination Primitives and Probabilistic Tuple Spaces

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Critical Behavior in Physics and Probabilistic Formal Languages

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2017English

Synthesis of Non-Interferent Timed Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy