Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Performance Evaluation of Mobile Processes via Abstract Machines
IEEE Transactions on Software Engineering
Process algebra for performance evaluation
Theoretical Computer Science
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Language-based performance prediction for distributed and mobile systems
Information and Computation
Additive models of probabilistic processes
Theoretical Computer Science
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Reward Based Congruences: Can We Aggregate More?
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Expressing Processes with Different Action Durations through Probabilities
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Action Refinement for Probabilistic Processes with True Concurrency Models
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Security Analysis of a Probabilistic Non-repudiation Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th 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
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Stochastic Process Algebras Meet Eden
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
An Axiomatization of Probabilistic Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Universal aspects of probabilistic automata
Mathematical Structures in Computer Science
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
Theoretical Computer Science
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
A translation of TPALp into a class of timed-probabilistic Petri nets
Theoretical Computer Science
Comparative branching-time semantics for Markov chains
Information and Computation
A theory of stochastic systems: part I: Stochastic automata
Information and Computation
Quantitative information in the tuple space coordination model
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Mathematical Structures in Computer Science
A Hierarchy of Equivalences for Probabilistic Processes
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
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
From Gene Regulation to Stochastic Fusion
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
On the verification of probabilistic I/O automata with unspecified rates
Proceedings of the 2009 ACM symposium on Applied Computing
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Mutation testing from probabilistic and stochastic finite state machines
Journal of Systems and Software
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressive Power of Schedulers in Distributed Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
On Quantitative Analysis of Probabilistic Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressiveness of Probabilistic and Prioritized Data-retrieval in Linda
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Approach to Noninterference for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for Action-labelled Quantitative Transition Systems
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
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
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
Quantitative model checking revisited: neither decidable nor approximable
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Calibrating the power of schedulers for probabilistic polynomial-time calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
A comparative study of STOPA and RTPA
Transactions on computational science II
Annotated probabilistic temporal logic
ACM Transactions on Computational Logic (TOCL)
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Generic forward and backward simulations II: probabilistic simulation
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Quantitative Kleene coalgebras
Information and Computation
Linear-time and may-testing in a probabilistic reactive setting
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal testing of timed and probabilistic systems
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Implementation relations for stochastic finite state machines
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Probabilistic linda-based coordination languages
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Derivation of a suitable finite test suite for customized probabilistic systems
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
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
Axiomatizations for probabilistic finite-state behaviors
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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
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
Probability and nondeterminism in operational models of concurrency
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
Assessing the expressivity of formal specification languages
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Testing semantics: connecting processes and process logics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Games and the impossibility of realizable ideal functionality
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Value-passing CCS with noisy channels
Theoretical Computer Science
Weighted probabilistic equivalence preserves ω-regular properties
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
Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Probabilistic transition system specification: congruence and full abstraction of bisimulation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Coalgebraic trace semantics for probabilistic transition systems based on measure theory
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Discrete Time Stochastic Petri Box Calculus with Immediate Multiactions dtsiPBC
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithmic probabilistic game semantics
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 |