Fine covers of a VAS language

DOI10.1016/0304-3975(92)90071-MzbMath0745.68082OpenAlexW1970286620MaRDI QIDQ1186433

Sylvianne R. Schwer

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90071-m

zbMATH Keywords

Petri netsvector addition systemscovering automaton

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A note on fine covers and iterable factors of VAS languages ⋮ The context-freeness of the languages associated with vector addition systems is decidable ⋮ S-arrangements with repetitions

Cites Work

• On the rationality of Petri net languages
• Vector addition systems and regular languages
• Petri nets and regular languages
• The context-freeness of the languages associated with vector addition systems is decidable
• Parallel program schemata
• Integer Programming with a Fixed Number of Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item