The theory of interactive generalized semi-Markov processes

DOI10.1016/S0304-3975(01)00043-3MaRDI QIDQ1603705zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Formal Methods for the Design of Real-Time Systems
• An integrated approach for the specification and analysis of stochastic real-time systems
• The how and why of interactive Markov chains
• Process algebra for performance evaluation
• scientific article; zbMATH DE number 1786481

Cites work

• scientific article; zbMATH DE number 1670867 (Why is no real title available?)
• scientific article; zbMATH DE number 4030999 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1497781 (Why is no real title available?)
• scientific article; zbMATH DE number 836615 (Why is no real title available?)
• scientific article; zbMATH DE number 1397300 (Why is no real title available?)
• scientific article; zbMATH DE number 3217463 (Why is no real title available?)
• A complete axiomatisation for observational congruence of finite-state behaviours
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Adding action refinement to a finite process algebra
• Bisimulation through probabilistic testing
• Model-checking in dense real-time
• On “Axiomatising Finite Concurrent Processes”
• Transition system specifications with negative premises

Cited in

(22)

• A theory of stochastic systems. II: Process algebra
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
• Compositional design of stochastic timed automata
• Reduction semantics in Markovian process algebra
• Foundational aspects of multiscale modeling of biological systems with process algebras
• scientific article; zbMATH DE number 1786481 (Why is no real title available?)
• Discrete time generative-reactive probabilistic processes with different advancing speeds
• Axiomatizing maximal progress and discrete time
• A theory of stochastic systems. I: Stochastic automata
• Fixed-delay events in generalized semi-Markov processes revisited
• YMCA: why Markov chain algebra?
• Timed comparisons of semi-Markov processes
• Formal Methods for the Design of Real-Time Systems
• An expressiveness study of priority in process calculi
• An integrated approach for the specification and analysis of stochastic real-time systems
• Bio-PEPAd: a non-Markovian extension of Bio-PEPA
• Testing from a stochastic timed system with a fault model
• scientific article; zbMATH DE number 1884419 (Why is no real title available?)
• Revisiting interactive Markov chains
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603705)