Confluence reduction for Markov automata
type: Item
instance of: scholarly article
title: Confluence reduction for Markov automata
zbMATH Open document ID: 1356.68136
author: Mark Timmer
author: Joost-Pieter Katoen
author: Jaco van de Pol
author: Mariëlle I. A. Stoelinga
published in: Theoretical Computer Science
publication date: 2017-02-06T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 6680836
zbMATH Keywords: Markov automata
zbMATH Keywords: confluence
zbMATH Keywords: state space reduction
zbMATH Keywords: process algebra
zbMATH Keywords: divergence-sensitive branching bisimulation
zbMATH Keywords: partial order reduction
describes a project that uses: PRISM
describes a project that uses: SCOOP
describes a project that uses: CADP
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.01.017
OpenAlex ID: W2784133204
Wikidata QID: Q57800637
cites work: Concurrency and Composition in a Stochastic World
cites work: On the semantics of Markov automata
cites work: A Semantics for Every GSPN
cites work: Analysis of timed and long-run objectives for Markov automata
cites work: Confluence for process verification
cites work: Q4806211
cites work: Confluence Reduction for Probabilistic Systems
cites work: Branching time and abstraction in bisimulation semantics
cites work: Efficient Modelling and Generation of Markov Automata
cites work: A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
cites work: Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
cites work: Confluence Reduction for Markov Automata
cites work: The How and Why of Interactive Markov Chains
cites work: Q4038723
cites work: Model Checking Interactive Markov Chains
cites work: Delayed Nondeterminism in Continuous-Time Markov Decision Processes
cites work: Q5322945
cites work: Q4813198
cites work: Depth-First Search and Linear Graph Algorithms
cites work: State Space Reduction of Linear Processes Using Control Flow Reconstruction
cites work: Simplifying Itai-Rodeh leader election for anonymous rings
cites work: Q4835250
cites work: Computer Aided Verification
cites work: EQUIVALENCE OF LABELED MARKOV CHAINS
cites work: Probabilistic Bisimulation: Naturally on Distributions
DOI: 10.1016/J.TCS.2016.01.017
DBLP publication ID: journals/tcs/TimmerKPS16
description: scientific article; zbMATH DE number 6680836