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