Quantitative Analysis of Concurrent Reversible Computations

DOI10.1007/978-3-319-22975-1_14zbMath1465.68197MaRDI QIDQ2945596

Andrea Marin, Sabina Rossi

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22975-1_14

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q09: Other nonclassical models of computation

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Applying Reversibility Theory for the Performance Evaluation of Reversible Computations, Towards Bridging Time and Causal Reversibility, Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach, Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses

Cites Work

• Interactive Markov chains. And the quest for quantified quality
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Turning back time in Markovian process algebra.
• Reversing algebraic process calculi
• Model checking for performability
• On the Statistical Thermodynamics of Reversible Communicating Processes
• CONCUR 2004 - Concurrency Theory
• Concurrent Flexible Reversibility
• A Compositional Approach to Performance Modelling
• Logical Reversibility of Computation
• Process algebra for performance evaluation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item