Faron Moller

	2009
42		Karim Kanso, Faron Moller, Anton Setzer: Automated Verification of Signalling Principles in Railway Interlocking Systems. Electr. Notes Theor. Comput. Sci. 250(2): 19-31 (2009)
	2008
41		Arnold Beckmann, Faron Moller: On the Complexity of Parity Games. BCS Int. Acad. Conf. 2008: 237-248
	2006
40		Will Harwood, Faron Moller, Anton Setzer: Weak Bisimulation Approximants. CSL 2006: 365-379
	2005
39		Julian C. Bradfield, Faron Moller: Preface. Electr. Notes Theor. Comput. Sci. 138(3): 1 (2005)
	2004
38		Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa: DP lower bounds for equivalence-checking and model-checking of one-counter automata. Inf. Comput. 188(1): 1-19 (2004)
37		Faron Moller, Scott A. Smolka, Jirí Srba: On the computational complexity of bisimulation, redux. Inf. Comput. 194(2): 129-143 (2004)
	2003
36		Petr Jancar, Antonín Kucera, Faron Moller: Deciding Bisimilarity between BPA and BPP Processes. CONCUR 2003: 157-171
35		Faron Moller, Scott A. Smolka: On the Computational Complexity of Bisimulation, Redux. PCK50 2003: 55-59
34		Faron Moller, Alexander Moshe Rabinovich: Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput. 184(1): 147-159 (2003)
	2002
33		Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa: Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. FoSSaCS 2002: 172-186
32		Faron Moller: Formal Methods in Computation. Comput. J. 45(1): 1 (2002)
	2001
31		Yoram Hirshfeld, Faron Moller: Pushdown automata, multiset automata, and Petri nets. Theor. Comput. Sci. 256(1-2): 3-21 (2001)
	2000
30		Yoram Hirshfeld, Faron Moller: On the star height of unary regular behaviours. Proof, Language, and Interaction 2000: 497-510
29		Petr Jancar, Antonín Kucera, Faron Moller: Simulation and Bisimulation over One-Counter Processes. STACS 2000: 334-345
	1999
28		Petr Jancar, Faron Moller: Techniques for Decidability and Undecidability of Bisimilarity. CONCUR 1999: 30-45
27		Faron Moller, Alexander Moshe Rabinovich: On the Expressive Power of CTL. LICS 1999: 360-369
26		Petr Jancar, Faron Moller, Zdenek Sawa: Simulation Problems for One-Counter Machines. SOFSEM 1999: 404-413
25		Petr Jancar, Javier Esparza, Faron Moller: Petri Nets and Regular Processes. J. Comput. Syst. Sci. 59(3): 476-503 (1999)
	1998
24		Faron Moller: A Taxonomy of Infinite State Processes. Electr. Notes Theor. Comput. Sci. 18: (1998)
	1997
23		Faron Moller: Preface. Electr. Notes Theor. Comput. Sci. 9: (1997)
	1996
22		Faron Moller, Graham M. Birtwistle: Logics for Concurrency - Structure versus Automata (8th Banff Higher Order Workshop, August 27 - September 3, 1995, Proceedings) Springer 1996
21		Faron Moller: Infinite Results. CONCUR 1996: 195-216
20		Faron Moller: Logics for Concurrency: Structure Versus Automata. ACM Comput. Surv. 28(4es): 50 (1996)
19		Yoram Hirshfeld, Mark Jerrum, Faron Moller: A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. Mathematical Structures in Computer Science 6(3): 251-259 (1996)
18		Yoram Hirshfeld, Mark Jerrum, Faron Moller: A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci. 158(1&2): 143-159 (1996)
	1995
17		Yoram Hirshfeld, Faron Moller: Decidability Results in Automata and Process Theory. Banff Higher Order Workshop 1995: 102-148
16		Petr Jancar, Faron Moller: Checking Regular Properties of Petri Nets. CONCUR 1995: 348-362
15		Faron Moller, Scott A. Smolka: On the Computational Complexity of Bisimulation. ACM Comput. Surv. 27(2): 287-289 (1995)
	1994
14		Björn Victor, Faron Moller: The Mobility Workbench - A Tool for the pi-Calculus. CAV 1994: 428-440
13		Yoram Hirshfeld, Faron Moller: A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. CONCUR 1994: 48-63
12		Yoram Hirshfeld, Mark Jerrum, Faron Moller: A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes FOCS 1994: 623-631
11		Søren Christensen, Yoram Hirshfeld, Faron Moller: Decidable Subsets of CCS. Comput. J. 37(4): 233-242 (1994)
	1993
10		Søren Christensen, Yoram Hirshfeld, Faron Moller: Bisimulation Equivalence is Decidable for Basic Parallel Processes. CONCUR 1993: 143-157
9		Søren Christensen, Yoram Hirshfeld, Faron Moller: Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes LICS 1993: 386-396
8		Robin Milner, Faron Moller: Unique Decomposition of Processes. Theor. Comput. Sci. 107(2): 357-363 (1993)
	1992
7		Jan Friso Groote, Faron Moller: Verification of Parallel Systems via Decomposition. CONCUR 1992: 62-76
6		Faron Moller, Chris M. N. Tofts: Behavioural Abstraction in TCCS. ICALP 1992: 559-570
	1991
5		Faron Moller, Chris M. N. Tofts: Relating Processes With Respect to Speed. CONCUR 1991: 424-438
	1990
4		Faron Moller, Chris M. N. Tofts: A Temporal Calculus of Communicating Systems. CONCUR 1990: 401-415
3		Faron Moller: The Importance of the Left Merge Operator in Process Algebras. ICALP 1990: 752-764
2		Faron Moller: The Nonexistence of Finite Axiomatisations for CCS Congruences LICS 1990: 142-153
1		Robin Milner, Faron Moller: Unique decomposition of processes. Bulletin of the EATCS 41: 226-233 (1990)

Coauthor Index

1	Arnold Beckmann	[41]
2	Graham M. Birtwistle	[22]
3	Julian C. Bradfield	[39]
4	Søren Christensen	[9] [10] [11]
5	Javier Esparza	[25]
6	Jan Friso Groote	[7]
7	Will Harwood	[40]
8	Yoram Hirshfeld	[9] [10] [11] [12] [13] [17] [18] [19] [30] [31]
9	Petr Jancar	[16] [25] [26] [28] [29] [33] [36] [38]
10	Mark Jerrum	[12] [18] [19]
11	Karim Kanso	[42]
12	Antonín Kucera	[29] [33] [36] [38]
13	Robin Milner	[1] [8]
14	Alexander Moshe Rabinovich (Alexander Rabinovich)	[27] [34]
15	Zdenek Sawa	[26] [33] [38]
16	Anton Setzer	[40] [42]
17	Scott A. Smolka	[15] [35] [37]
18	Jirí Srba	[37]
19	Chris M. N. Tofts	[4] [5] [6]
20	Björn Victor	[14]

Colors in the list of coauthors