The theory of interactive generalized semi-Markov processes
From MaRDI portal
Publication:1603705
DOI10.1016/S0304-3975(01)00043-3zbMATH Open0997.68083OpenAlexW2028079360MaRDI QIDQ1603705FDOQ1603705
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
Recommendations
stochastic process algebrasprobabilistic bisimulationobservational congruencegeneralized semi-Markov processes
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Model-checking in dense real-time
- Bisimulation through probabilistic testing
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Title not available (Why is that?)
- A complete axiomatisation for observational congruence of finite-state behaviours
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transition system specifications with negative premises
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adding action refinement to a finite process algebra
- Title not available (Why is that?)
- On “Axiomatising Finite Concurrent Processes”
Cited In (22)
- A theory of stochastic systems. II: Process algebra
- Compositional design of stochastic timed automata
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- Reduction semantics in Markovian process algebra
- Foundational aspects of multiscale modeling of biological systems with process algebras
- Title not available (Why is that?)
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- Axiomatizing maximal progress and discrete time
- Fixed-delay events in generalized semi-Markov processes revisited
- A theory of stochastic systems. I: Stochastic automata
- 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
- Title not available (Why is that?)
- Testing from a stochastic timed system with a fault model
- Stochastic and Real Time in Process Algebra: A Conceptual Overview
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
- Revisiting interactive Markov chains
- 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)