Communicating sequential processes
Communicating sequential processes
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Process algebra
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A temporal calculus of communicating systems
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
On "Axiomatising Finite Concurrent Processes"
SIAM Journal on Computing
A process algebra for timed systems
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
“Closed interval process algebra” versus “Interval process algebra”
Acta Informatica
Comparing the QoS of Internet audio mechanisms via formal methods
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Communication and Concurrency
Computer Networks
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
On the Ill-Timed but Well-Caused
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
A translation of TPALp into a class of timed-probabilistic Petri nets
Theoretical Computer Science
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematical Structures in Computer Science
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
On Quantitative Analysis of Probabilistic Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Approach to Noninterference for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Performance-oriented comparison of web services via client-specific testing preorders
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Formal testing of systems presenting soft and hard deadlines
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Testing of symbolic-probabilistic systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Testing probabilistic distributed 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
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
Hi-index | 5.23 |
We present a process algebra expressing probabilistic external/internal choices, multi-way synchronizations, and processes with different advancing speeds in the context of discrete time, i.e. where time is not continuous but is represented by a sequence of discrete steps as in discrete time Markov chains (DTMCs). To this end, we introduce a variant of CSP that employs a probabilistic asynchronous parallel operator whose synchronization mechanism is based on a mixture of the classical generative and reactive models of probability. In particular, differently from existing discrete time process algebras, where parallel processes are executed in synchronous locksteps, the parallel operator that we adopt allows processes with different probabilistic advancing speeds (mean number of actions executed per time unit) to be modeled. Moreover, our generative-reactive synchronization mechanism makes it possible to always derive DTMCs in the case of fully specified systems. We then present a sound and complete axiomatization of probabilistic bisimulation over finite processes of our calculus, that is a smooth extension of the axiom system for a standard process algebra, thus solving the open problem of cleanly axiomatizing action restriction in the generative model. As a further result, we show that, when evaluating steady state based performance measures which are expressible by attaching rewards to actions, our approach provides an exact solution even if the advancing speeds are considered not to be probabilistic, without incurring the state space explosion problem that arises with standard synchronous approaches. We finally present a case study on multi-path routing showing the expressiveness of our calculus and that it makes it particularly easy to produce scalable specifications.