Proceedings of the international workshop on Automatic verification methods for finite state systems
Bisimulation through probabilistic testing
Information and Computation
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Three logics for branching bisimulation
Journal of the ACM (JACM)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
A compositional approach to performance modelling
A compositional approach to performance modelling
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Model Checking
Communication and Concurrency
Probabilistic Temporal Logics via the Modal Mu-Calculus
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
| Hi-index | 0.00 |
We build on the established work on modal transition systems and probabilistic specifications to sketch a framework in which system description, abstraction, and finite-state model checking all have a uniform presentation across various levels of qualitative and quantitative views together with mediating abstraction and concretization maps. We prove safety results for abstractions within and across such views for the entire modal mu-calculus and show that such abstractions allow for some compositional reasoning with respect to a uniform family of process algebras à la CCS.