A simple realization of a parallel device recognizing regular trace languages

Authors:
Ryszard Janicki;Thomasz Muldner
Affiliations:
Department of Computer Science and Systems, McMaster University, 1280 Main Street West, Hamilton, L8S 4K1 Ontario, Canada;Jodrey School of Computer Science, Acadia University, Wolfville, B0P 1X0 Nova Scotia, Canada
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 11
Cited 1

Concurrent and maximally concurrent evolution of nonsequential systems

Theoretical Computer Science
An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs

14th International Colloquium on Automata, languages and programming
Theory of traces

Theoretical Computer Science
Complete sequential specification allows for concurrent execution

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Transformations of sequential specifications into concurrent specifications by synchronization guards

Conference proceedings on Algebraic methodology and software technology
How to relieve a programmer from synchronization details

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Semigroups and Combinatorial Applications

Semigroups and Combinatorial Applications
Specification and Analysis of Concurrent Systems: The COSY Approach

Specification and Analysis of Concurrent Systems: The COSY Approach
Safe Executions of Recognizable Trace Languages by Asynchronous Automata

Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Adequate Path Expressions

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Trace Theory

Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II

A bibliography on parallel parsing

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies parallel devices recognizing trace languages. We introduce a concept of an asynchronous automaton with &egr;-moves and show that for a given regularly defined trace language there exists a simple version of an asynchronous automaton with &egr;-moves recognizing this language.