Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A Compositional Rule for Hardware Design Refinement
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Making random choices invisible to the scheduler
Information and Computation
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Reasoning about probabilistic security using task-PIOAs
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Automated learning of probabilistic assumptions for compositional reasoning
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Learning-based compositional verification for synchronous probabilistic systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Switched probabilistic i/o automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Assume-Guarantee verification for probabilistic systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Probabilistic CSP: preserving the laws via restricted schedulers
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
New results for Constraint Markov Chains
Performance Evaluation
Learning Probabilistic Systems from Tree Samples
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Assume-guarantee abstraction refinement for probabilistic systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Probabilistic contracts for component-based design
Formal Methods in System Design
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Verification of partial-information probabilistic systems using counterexample-guided refinements
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
From software verification to `everyware' verification
Computer Science - Research and Development
Quantitative reactive modeling and verification
Computer Science - Research and Development
Compositional probabilistic verification through multi-objective model checking
Information and Computation
| Hi-index | 0.00 |
We present a compositional trace-based model for probabilistic systems. The behavior of a system with probabilistic choice is a stochastic process, namely, a probability distribution on traces, or "bundle." Consequently, the semantics of a system with both nondeterministic and probabilistic choice is a set of bundles. The bundles of a composite system can be obtained by combining the bundles of the components in a simple mathematical way. Refinement between systems is bundle containment. We achieve assume-guarantee compositionality for bundle semantics by introducing two scoping mechanisms. The first mechanism, which is standard in compositional modeling, distinguishes inputs from outputs and hidden state. The second mechanism, which arises in probabilistic systems, partitions the state into probabilistically independent regions.