scientific article; zbMATH DE number 7163281
From MaRDI portal
Publication:5214815
zbMath1442.68113arXiv1806.05654MaRDI QIDQ5214815
Thorsten Wißmann, Stefan Milius, Lutz Schröder, Ulrich Dorsch
Publication date: 5 February 2020
Full work available at URL: https://arxiv.org/abs/1806.05654
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods in Markov chains (60J22) Analysis of algorithms (68W40) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Minimality Notions via Factorization Systems and Examples, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, Unnamed Item, Lowerbounds for Bisimulation by Partition Refinement, From generic partition refinement to weighted tree automata minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the final sequence of a finitary set functor
- Bisimulation minimization and symbolic model checking
- 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
- Bisimulation through probabilistic testing
- Sheaves in geometry and logic: a first introduction to topos theory
- An optimal lower bound on the number of variables for graph identification
- Introduction to extensive and distributive categories
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- 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.
- From generic partition refinement to weighted tree automata minimization
- A new foundation for finitary corecursion and iterative algebras
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Bisimulation relations for weighted automata
- Bisimulation for labelled Markov processes
- Describing an algorithm by Hopcroft
- An efficient algorithm to determine probabilistic bisimulation
- Introduction to Coalgebra
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
- Structural Operational Semantics for Weighted Transition Systems
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- Simple O(m logn) Time Markov Chain Lumping
- Bisimilarity Minimization in O(m logn) Time
- Three Partition Refinement Algorithms
- Monoid-labeled transition systems
- A final coalgebra theorem
- An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
- Formal verification of timed properties of randomized distributed algorithms
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
