J. Balcázar, J. Gabarro & M. Santha (1992):
Deciding bisimilarity is P-complete.
Formal aspects of computing 4(1),
pp. 638–648,
doi:10.1007/BF03180566.
N. Bell & J. Hoberock (2012):
Thrust: A Productivity-Oriented Library for CUDA.
In: GPU Computing Gems Jade Edition, chapter 26.
Morgan Kaufmann Publishers Inc.,
pp. 359–371,
doi:10.1016/C2010-0-68654-8.
G. Castiglione, A. Restivo & M. Sciortino (2008):
Hopcroft's Algorithm and Cyclic Automata.
In: C. Martín-Vide, F. Otto & H. Fernau: Proc. of LATA 2008,
LNCS 5196.
Springer,
pp. 172–183,
doi:10.1007/978-3-540-88282-4_17.
S. Cho & D.T. Huynh (1992):
The parallel complexity of coarsest set partition problems.
Information Processing Letters 42(2),
pp. 89–94,
doi:10.1016/0020-0190(92)90095-D.
J.T. Fineman (2018):
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability.
In: Proc. of STOC 2018.
ACM,
pp. 457–470,
doi:10.1145/3188745.3188926.
J.F. Groote, J.J.M. Martens & E.P. de Vink (2023):
Lowerbounds for bisimulation by partition refinement.
Logical Methods in Computer Science Volume 19, Issue 2,
doi:10.46298/lmcs-19(2:10)2023.
W.D. Hillis & G.L. Steele Jr. (1986):
Data Parallel Algorithms.
Communications of the ACM 29(12),
pp. 1170–1183,
doi:10.1145/7902.7903.
J. Hopcroft (1971):
An nłog n algorithm for minimizing states in a finite automaton.
In: Z. Kohavi & A. Paz: Theory of Machines and Computations.
Academic Press,
pp. 189–196,
doi:10.1016/b978-0-12-417750-5.50022-1.
J. JáJá (1992):
An introduction to parallel algorithms.
Addison Wesley Longman Publishing Co., Inc.,
USA.
A. Jambulapati, Y.P. Liu & A. Sidford (2019):
Parallel reachability in almost linear work and square root depth.
In: Proc. of FOCS 2019.
IEEE,
pp. 1664–1686,
doi:10.1109/FOCS.2019.00098.
S. Khuller & U. Vishkin (1994):
On the parallel complexity of digraph reachability.
Information Processing Letters 52(5),
pp. 239–241,
doi:10.1016/0020-0190(94)00153-7.
J.J.M. Martens, J.F. Groote, L.B. Haak, P. Hijma & A.J. Wijs (2022):
Linear parallel algorithms to compute strong and branching bisimilarity.
Software and Systems Modeling,
pp. 1–25,
doi:10.1007/s10270-022-01060-7.
E.F. Moore (1956):
Gedanken-Experiments on Sequential Machines.
In: Claude Shannon & John McCarthy: Automata Studies.
Princeton University Press,
Princeton, NJ,
pp. 129–153,
doi:10.1515/9781400882618-006.
R. Paige & R. E. Tarjan (1987):
Three partition refinement algorithms.
SIAM Journal on Computing 16(6),
pp. 973–989,
doi:10.1137/0216062.
M.O. Rabin & D. Scott (1959):
Finite automata and their decision problems.
IBM Journal of Research and Development 3(2),
pp. 114–125,
doi:10.1147/rd.32.0114.
B. Ravikumar & X. Xiong (1996):
A Parallel Algorithm for Minimization of Finite Automata.
In: Proceedings of the 10th International Parallel Processing Symposium,
IPPS '96.
IEEE Computer Society,
USA,
pp. 187–191,
doi:10.1109/IPPS.1996.508056.
L. Stockmeyer & U. Vishkin (1984):
Simulation of parallel random access machines by circuits.
SIAM Journal on Computing 13(2),
pp. 409–422,
doi:10.1137/0213027.
A. Tewari, U. Srivastava & P. Gupta (2002):
A Parallel DFA Minimization Algorithm.
In: Proc. of HiPC,
LNCS 2552.
Springer,
pp. 34–40,
doi:10.1007/3-540-36265-7_4.
J. Ullman & M. Yannakakis (1990):
High-Probability Parallel Transitive Closure Algorithms.
In: Proc. of SPAA 1990,
pp. 200–209,
doi:10.1145/97444.97686.
A.J. Wijs (2015):
GPU Accelerated Strong and Branching Bisimilarity Checking.
In: C. Baier & C. Tinelli: Proc. of TACAS,
LNCS 9035.
Springer,
pp. 368–383,
doi:10.1007/978-3-662-46681-0_29.
eptcs@eptcs.org