Prohlížení dle autora "Moller, Faron"

Deciding bisimilarity between BPA and BPP processes

Jančar, Petr; Kučera, Antonín; Moller, Faron (CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. 2003, p. 159-173.)

DP lower bounds for equivalence-checking and model-checking of one-counter automata

Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk (Information and Computation. 2004, vol. 188, issue 1, p. 1-19.)

Equivalence-checking with one-counter automata: A generic method for proving lower bounds

Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk (Foundations of software science and computation structures : 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002. Proceedings. 2002, p. 172-186.)

Petri nets and regular processes

Jančar, Petr; Esparza, Javier; Moller, Faron (Journal of Computer and System Sciences. 1999, vol. 59, issue 3, p. 476-503.)

Simulation and bisimulation over one-counter processes

Jančar, Petr; Kučera, Antonín; Moller, Faron (STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000. Proceedings. 2000, p. 334-335.)

Simulation problems for one-counter machines

Jančar, Petr; Moller, Faron; Sawa, Zdeněk (SOFSEM 1999 : theory and practice of informatics : 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27-December 4, 1999. Proceedings. 1999, p. 404-413.)

Techniques for decidability and undecidability of bisimilarity

Jančar, Petr; Moller, Faron (CONCUR'99 - Concurrency Theory : 14th International Conference, Eindhoven, The Netherlands, August 1999. Proceedings. 1999, p. 30-45.)