Parallel finite automata for modeling concurrent software systems


The class of parallel nite automata PFA is described that naturally expresses the interleaving parallelism inherent in Petri net notation without admitting the possibility of an in nite state space The equivalence of this class to deterministic nite automata DFA is demonstrated using an algorithm for generating an equivalent nondeterministic nite automaton… (More)
DOI: 10.1016/0164-1212(94)90112-0


1 Figure or Table

Slides referencing similar topics