Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Verification of multiprocess probabilistic protocols
Distributed Computing
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Algebraic theory of processes
Reasoning about uncertainty in fault-tolerant distributed systems
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Communication and concurrency
Fast randomized consensus using shared memory
Journal of Algorithms
Bisimulation through probabilistic testing
Information and Computation
Randomized mutual exclusion algorithms revisited
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Forward and Backward Simulations for Timing-Based Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Composition and Behaviors of Probabilistic I/O Automata
CONCUR '94 Proceedings of the Concurrency Theory
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Time Optimal Self-Stabilizing Spanning Tree Algorithms
On the generalized dining philosophers problem
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Process algebra for performance evaluation
Theoretical Computer Science
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
General distributions in process algebra
Lectures on formal methods and performance analysis
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
A Timed Verification of the IEEE 1394 Leader Election Protocol
Formal Methods in System Design
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Norm Functions for Probabilistic Bisimulations with Delays
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Decidable Model Checking of Probabilistic Hybrid Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Probabilistic Extension of UML Statecharts
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Fully Abstract Characterization of Probabilistic May Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Parametric real-time model checking using splitting trees
Nordic Journal of Computing
Randomized dining philosophers without fairness assumption
Distributed Computing
QoS modelling and analysis with UML-statecharts: the StoCharts approach
ACM SIGMETRICS Performance Evaluation Review
From StoCharts to MoDeST: a comparative reliability analysis of train radio communications
Proceedings of the 5th international workshop on Software and performance
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
Comparative branching-time semantics for Markov chains
Information and Computation
A theory of stochastic systems: part I: Stochastic automata
Information and Computation
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Branching bisimulation for probabilistic systems: characteristics and decidability
Theoretical Computer Science - Expressiveness in concurrency
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Theoretical Computer Science - Automated reasoning for security protocol analysis
State explosion in almost-sure probabilistic reachability
Information Processing Letters
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
IEEE Transactions on Software Engineering
Probabilistic bisimulations for quantum processes
Information and Computation
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Theoretical Computer Science
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
Preservation of probabilistic information flow under refinement
Information and Computation
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Quantitative evaluation in embedded system design: trends in modeling and analysis techniques
Proceedings of the conference on Design, automation and test in Europe
Theory and Practice of Probabilistic Timed Game for Embedded Systems
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
An Experimental Evaluation of Probabilistic Simulation
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Generating Compact MTBDD-Representations from Probmela Specifications
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Modeling Computational Security in Long-Lived Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Space-Efficient Probabilistic Simulation Algorithm
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Branching Bisimulation Congruence for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Theoretical Computer Science
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Significant Diagnostic Counterexamples in Probabilistic Model Checking
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A Statistical Approach to Test Stochastic and Probabilistic Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of stochastic systems part I: Stochastic automata
Information and Computation
Comparative branching-time semantics for Markov chains
Information and Computation
Codesign of dependable systems: a component-based modeling language
MEMOCODE'09 Proceedings of the 7th IEEE/ACM international conference on Formal Methods and Models for Codesign
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Testing a probabilistic FSM using interval estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Probabilistic anonymity via coalgebraic simulations
ESOP'07 Proceedings of the 16th European conference on Programming
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
Deciding simulations on probabilistic automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Conditional probabilities over probabilistic and nondeterministic systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Compositional methods for information-hiding
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Making random choices invisible to the scheduler
Information and Computation
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Simulation and bisimulation for probabilistic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Probabilistic Logical Characterization
Information and Computation
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
Towards probabilistic modelling in event-B
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
The earlier the better: a theory of timed actor interfaces
Proceedings of the 14th international conference on Hybrid systems: computation and control
Measurability and safety verification for stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Confluence reduction for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
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
Probabilistic bisimulation and simulation algorithms by abstract interpretation
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Bisimulations meet PCTL equivalences for probabilistic automata
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A spectrum of behavioral relations over LTSs on probability distributions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On the controller synthesis for finite-state markov decision processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Improved probabilistic models for 802.11 protocol verification
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Stochastic transition systems for continuous state spaces and non-determinism
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A formal framework for confidentiality-preserving refinement
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Symmetry reduction for probabilistic model checking using generic representatives
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
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
Measurable stochastics for Brane Calculus
Theoretical Computer Science
An algorithm for probabilistic alternating simulation
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A general framework for probabilistic characterizing formulae
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Approximate planning and verification for large markov decision processes
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Formal Methods in System Design
Learning Probabilistic Systems from Tree Samples
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Computing game metrics on markov decision processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Assume-guarantee abstraction refinement for probabilistic systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Modelling probabilistic wireless networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Bisimulation and logical preservation for continuous-time markov decision processes
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Compositional abstraction techniques for probabilistic automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Broadcast abstraction in a stochastic calculus for mobile networks
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the semantics of Markov automata
Information and Computation
Compositional reverification of probabilistic safety properties for large-scale complex IT systems
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Taming confusion for modeling and implementing probabilistic concurrent systems
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
The quest for minimal quotients for probabilistic automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
Compositional probabilistic verification through multi-objective model checking
Information and Computation
Abstract Probabilistic Automata
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking for probabilistic timed automata
Formal Methods in System Design
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
Informational Analysis of Security and Integrity
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Quantification of Positive and Negative Attacker's Information
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.01 |
Several probabilistic simulation relations for probabili stic systems are defined and evaluated according to two criteria: compositionality and preservation of "interesting" properties. Here, the interesting properties of a system are identified with those that are expressible in an untimed version of the Timed Probabilistic concurrent Computation Tree Logic (TPCTL) of Hansson. The definitions are made, and the evaluations carried out, in terms of a general labeled transition system model for concurrent probabilistic computation. The results cover weak simulations, which abstract from internal computation, as well as strong simulations, which do not