Processes with probabilities, priority and time

DOI10.1007/BF01211867zbMath0820.68072OpenAlexW2062442550MaRDI QIDQ1343865

Chris Tofts

Publication date: 11 September 1995

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01211867

zbMATH Keywords

process algebrafault tolerancesynchronisationtask allocationself-organisation

Mathematics Subject Classification ID

Related Items (22)

Using process algebra to develop predator-prey models of within-host parasite dynamics ⋮ A calculus and logic of resources and processes ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ A general overview of formal languages for individual-based modelling of ecosystems ⋮ Exploring probabilistic bisimulations. I ⋮ From individuals to populations: a mean field semantics for process algebra ⋮ Unnamed Item ⋮ Deciding bisimilarity and similarity for probabilistic processes. ⋮ Improved Continuous Approximation of PEPA Models through Epidemiological Examples ⋮ Unnamed Item ⋮ A symbolic investigation of superspreaders ⋮ An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA ⋮ Process Algebra Models of Population Dynamics ⋮ Process algebra for performance evaluation ⋮ A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems ⋮ Algebra and logic for resource-based systems modelling ⋮ Quantitative information in the tuple space coordination model ⋮ Performance measure sensitive congruences for Markovian process algebras ⋮ Discrete time generative-reactive probabilistic processes with different advancing speeds ⋮ On the verification of qualitative properties of probabilistic processes under fairness constraints. ⋮ Hiding resources that can fail: An axiomatic perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for task allocation in ants. (A study of temporal polyethism: Theory)
• Calculi for synchrony and asynchrony
• Bisimulation through probabilistic testing
• Markov chain models - rarity and exponentiality
• Priority as extremal probability

This page was built for publication: Processes with probabilities, priority and time