The theory of interactive generalized semi-Markov processes

DOI10.1016/S0304-3975(01)00043-3zbMath0997.68083OpenAlexW2028079360MaRDI QIDQ1603705

Mario Bravetti, Roberto Gorrieri

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00043-3

zbMATH Keywords

stochastic process algebrasprobabilistic bisimulationobservational congruencegeneralized semi-Markov processes

Mathematics Subject Classification ID

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

Related Items (16)

A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Unnamed Item ⋮ Reduction semantics in Markovian process algebra ⋮ Foundational aspects of multiscale modeling of biological systems with process algebras ⋮ A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Compositional Design of Stochastic Timed Automata ⋮ Testing from a stochastic timed system with a fault model ⋮ Bio-PEPAd: a non-Markovian extension of Bio-PEPA ⋮ An expressiveness study of priority in process calculi ⋮ A theory of stochastic systems. I: Stochastic automata ⋮ A theory of stochastic systems. II: Process algebra ⋮ YMCA ⋮ Stochastic and Real Time in Process Algebra: A Conceptual Overview ⋮ Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition system specifications with negative premises
• Model-checking in dense real-time
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Bisimulation through probabilistic testing
• A complete axiomatisation for observational congruence of finite-state behaviours
• Adding action refinement to a finite process algebra
• On “Axiomatising Finite Concurrent Processes”

This page was built for publication: The theory of interactive generalized semi-Markov processes