Faron Moller

MaRDI QIDQ355064zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Decidability results in automata and process theory	2024-06-21	Paper
Infinite results CONCUR '96: Concurrency Theory	2023-06-28	Paper
Behavioural abstraction in TCCS Automata, Languages and Programming	2019-12-04	Paper
A specification theory of real-time processes	2018-03-26	Paper
Automated Verification of Signalling Principles in Railway Interlocking Systems Electronic Notes in Theoretical Computer Science	2015-03-18	Paper
Modelling computing systems. Mathematics for computer science Undergraduate Topics in Computer Science	2013-07-23	Paper
Deciding bisimilarity between BPA and BPP processes. Lecture Notes in Computer Science	2010-03-30	Paper
Weak Bisimulation Approximants Computer Science Logic	2009-03-12	Paper
On the computational complexity of bisimulation, redux Information and Computation	2005-01-11	Paper
DP lower bounds for equivalence-checking and model-checking of one-counter automata Information and Computation	2004-11-23	Paper
scientific article; zbMATH DE number 2087430 (Why is no real title available?)	2004-08-11	Paper
Counting on CTL\(^*\): On the expressive power of monadic path logic Information and Computation	2003-07-29	Paper
Pushdown automata, multiset automata, and Petri nets Theoretical Computer Science	2001-08-20	Paper
Verification on infinite structures.	2001-01-01	Paper
scientific article; zbMATH DE number 1500527 (Why is no real title available?)	2000-09-04	Paper
scientific article; zbMATH DE number 1490007 (Why is no real title available?)	2000-08-13	Paper
Petri nets and regular processes Journal of Computer and System Sciences	2000-03-19	Paper
scientific article; zbMATH DE number 1361117 (Why is no real title available?)	1999-11-10	Paper
A polynomial algorithm for deciding bisimilarity of normed context-free processes Theoretical Computer Science	1997-02-27	Paper
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes Mathematical Structures in Computer Science	1996-11-18	Paper
scientific article; zbMATH DE number 177854 (Why is no real title available?)	1993-05-18	Paper
Unique decomposition of processes Theoretical Computer Science	1993-05-16	Paper
scientific article; zbMATH DE number 4777 (Why is no real title available?)	1992-06-25	Paper

Research outcomes over time

This page was built for person: Faron Moller