Sofia Cassel, Falk Hower, Bengt Jonsson, Maik Merten & Bernhard Steffen (2011):
A Succinct Canonical Register Automaton Model.
ATVA 2011 LNCS 6996,
pp. 366–380,
doi:10.1007/978-3-642-24372-1_26.
Sofia Cassel, Falk Hower, Bengt Jonsson & Bernhard Steffen (2012):
Inferring Canonical Register Automata.
VMCAI 2012 LNCS 7148,
pp. 251–266,
doi:10.1007/978-3-642-27940-9_17.
Edmund M. Clarke, Jr., Orna Grumberg & Doron A. Peled (1999):
Model Checking.
MIT Press.
Stéphane Demri & Ranko Lazic (2009):
LTL with the Freeze Quantifier and Register Automata.
ACM Transactions on Computational Logic 10(16),
doi:10.1145/1507244.1507246.
Diego Figueira, Piotr Hofman & Slawomir Lasota (2010):
Relating timed and register automata.
EPTCS 41,
pp. 61–75,
doi:10.4204/EPTCS.41.5.
Michael Kaminiski & Nissim Francez (1994):
Finite-memory automata.
Theoretical Computer Science 134,
pp. 329–363,
doi:10.1016/0304-3975(94)90242-9.
D. Kroening & O. Strichman (2008):
Decision Procedures - an algorithmic point of view.
EATCS.
Springer,
doi:10.1007/s10817-013-9295-4.
Leslie Lamport, Robert Shostak & Marshall Pease (1982):
The Byzantine Generals Problem.
ACM Transactions on Programming Languages and Systems 4(3),
pp. 382–401,
doi:10.1145/357172.357176.
Frank Neven, Thomas Schwentick & Victor Vianu (2004):
Finite State Machines for Strings Over Infinite Alphabets.
ACM Transsactions on Computational Logic 5(3),
pp. 403–435,
doi:10.1145/1013560.1013562.
Junxing Wang (2012):
A Simple Byzantine Generals Protocol.
Journal of Combinatorial Optimization,
doi:10.1007/s10878-012-9534-3.
eptcs@eptcs.org