Language Classes Defined by Concurrent Finite Automata

Authors:
Matthias Jantzen;Manfred Kudlek;Georg Zetzsche
Affiliations:
(Correspd.) Department Informatik, MIN-Fakultät, Universität Hamburg, Vogt-Kölln-Straße 30. D-22527 Hamburg, Germany. {jantzen,kudlek,3zetzsch}@informatik.uni-hamburg.de;Department Informatik, MIN-Fakultät, Universität Hamburg, Vogt-Kölln-Straße 30. D-22527 Hamburg, Germany. {jantzen,kudlek,3zetzsch}@informatik.uni-hamburg.de;Department Informatik, MIN-Fakultät, Universität Hamburg, Vogt-Kölln-Straße 30. D-22527 Hamburg, Germany. {jantzen,kudlek,3zetzsch}@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 1
Cited 0

An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents results regarding the various relations among the language classes defined by Concurrent Finite Automata, relations to other language classes, as well as decidability and closure properties.