Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Moller, Faron"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
DP
lower bounds for equivalence-checking and model-checking of one-counter automata
Petr Janc̑ar
,
Antonín Kuc̑era
,
Faron Moller
,
Zdenék Sawa
Information and Computation
188
(1), 2004, pp. 1-19
On the computational complexity of bisimulation, redux
Faron Moller
,
Scott Smolka
,
Jiȓí Srba
Information and Computation
194
(2), 2004, pp. 129-143
Counting on CTL*: On the expressive power of monadic path logic
Faron Moller
,
Alexander Rabinovich
Information and Computation
184
(1), 2003, pp. 147-159
Pushdown automata, multiset automata, and Petri nets
Yoram Hirsheld
,
Faron Moller
Theoretical Computer Science
256
(1-2), 2001, pp. 3-21
Simulation and bisimulation over one-counter processes
Petr Janc̑ar
,
Antonín Kuc̑era
,
Faron Moller
Lecture Notes in Computer Science
1770
, 2000, pp. 334-345
Contents and abstracts of the electronic notes in Theoretical Computer Science Vol. 9
Faron Moller
Theoretical Computer Science
230
(1-2), 2000, pp. 269-273
Petri nets and regular processes
Petr Janc̑ar
,
Javier Esparza
,
Faron Moller
Journal of Computer and System Sciences
59
(3), 1999, pp. 476-503
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Yoram Hirshfeld
,
Mark Jerrum
,
Faron Moller
Theoretical Computer Science
158
(1-2), 1996, pp. 143-159
Checking regular properties of Petri nets
Petr Janc̑ar
,
Faron Moller
Lecture Notes in Computer Science
962
, 1995, pp. 348-362
A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes
Yoram Hirshfeld
,
Mark Jerrum
,
Faron Moller
Technical Report (ECS-LFCS-94-288), 1994, April
A polynomial-time algorithm for deciding equivalence of normed context-free processes
Yoram Hirshfeld
,
Mark Jerrum
,
Faron Moller
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 623-631
A fast algorithm for deciding bisimilarity of normed context-free processes
Yoram Hirshfeld
,
Faron Moller
Lecture Notes in Computer Science
836
, 1994, pp. 48-63
Bisimulation equivalence is decidable for basic parallel processes
Sren Christensen
,
Yoram Hirshfeld
,
Faron Moller
Lecture Notes in Computer Science
715
, 1993, pp. 143-157
Unique decomposition of processes
Robin Milner
,
Faron Moller
Theoretical Computer Science
107
, 1993, pp. 357-363
Behavioural abstraction in TCCS
Faron Moller
,
Chris Tofts
Lecture Notes in Computer Science
623
, 1992, pp. 559-570
The importance of the left merge operator in process algebras
Faron Moller
Lecture Notes in Computer Science
443
, 1990, pp. 752-764