Faron Moller

Available identifiers

zbMath Open moller.faronDBLPm/FaronMollerWikidataQ102368876 ScholiaQ102368876MaRDI QIDQ355064

List of research outcomes

Publication	Date of Publication	Type
Decidability results in automata and process theory	2024-06-21	Paper
Infinite results	2023-06-28	Paper
Behavioural abstraction in TCCS	2019-12-04	Paper
A specification theory of real-time processes	2018-03-26	Paper
Automated Verification of Signalling Principles in Railway Interlocking Systems	2015-03-18	Paper
Modelling computing systems. Mathematics for computer science	2013-07-23	Paper
CONCUR 2003 - Concurrency Theory	2010-03-30	Paper
Weak Bisimulation Approximants	2009-03-12	Paper
On the computational complexity of bisimulation, redux	2005-01-11	Paper
DP lower bounds for equivalence-checking and model-checking of one-counter automata	2004-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4738225	2004-08-11	Paper
Counting on CTL\(^*\): On the expressive power of monadic path logic	2003-07-29	Paper
Pushdown automata, multiset automata, and Petri nets	2001-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q2760246	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4501545	2000-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4496250	2000-08-13	Paper
Petri nets and regular processes	2000-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4270051	1999-11-10	Paper
A polynomial algorithm for deciding bisimilarity of normed context-free processes	1997-02-27	Paper
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes	1996-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q4038732	1993-05-18	Paper
Unique decomposition of processes	1993-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q4712664	1992-06-25	Paper

Research outcomes over time

This page was built for person: Faron Moller