An algebra-based method to associate rewards with EMPA terms

DOI10.1007/3-540-63165-8_192zbMath1401.68222OpenAlexW1496748552MaRDI QIDQ4571967

Marco Bernardo

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_192

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Equivalence checking 40 years after: a review of bisimulation tools, Process algebra for performance evaluation, A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, Performance measure sensitive congruences for Markovian process algebras

Cites Work

• Unnamed Item
• Unnamed Item
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Bisimulation through probabilistic testing
• Specification styles in distributed systems design and verification
• Algebraic laws for nondeterminism and concurrency
• A Compositional Approach to Performance Modelling
• Extended Markovian Process Algebra