From generic partition refinement to weighted tree automata minimization
From MaRDI portal
Publication:1982644
DOI10.1007/s00165-020-00526-zOpenAlexW3136454149MaRDI QIDQ1982644
Lutz Schröder, Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann
Publication date: 14 September 2021
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.01250
Related Items
Lumpability for uncertain continuous-time Markov chains, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural operational semantics for stochastic and weighted transition systems
- Backward and forward bisimulation minimization of tree automata
- CCS expressions, finite state processes, and three problems of equivalence
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Optimal state-space lumping in Markov chains
- A calculus of communicating systems
- Universal coalgebra: A theory of systems
- Re-describing an algorithm by Hopcroft
- An efficient algorithm for computing bisimulation equivalence
- Deciding bisimilarity and similarity for probabilistic processes.
- Aggregation-based minimization of finite state automata
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Bisimulation relations for weighted automata
- Describing an algorithm by Hopcroft
- An efficient algorithm to determine probabilistic bisimulation
- Automata theory in nominal sets
- Nominal Automata with Name Binding
- Simple Bisimilarity Minimization in O(m log n) Time
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- Simple O(m logn) Time Markov Chain Lumping
- Bisimilarity Minimization in O(m logn) Time
- Three Partition Refinement Algorithms
- A decomposition approach for stochastic reward net models
- Generalizing determinization from automata to coalgebras
- Efficient Coalgebraic Partition Refinement
- An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
- Bisimulation Minimisation for Weighted Tree Automata
- Tools and Algorithms for the Construction and Analysis of Systems
- Tiburon: A Weighted Tree Automata Toolkit
