Petri nets and regular languages

DOI10.1016/0022-0000(81)90067-2zbMath0473.68057OpenAlexW2008435081MaRDI QIDQ1158763

Ruediger Valk, Guy Vidal-Naquet

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90067-2

zbMATH Keywords

regularity problem for firing sequence sets of Petri netsterminal languages of labelled Petri nets

Mathematics Subject Classification ID

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

Related Items

A logical approach of Petri net languages, Word problems of groups: formal languages, characterizations and decidability, Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, On the expressive power of behavioral profiles, Incremental construction of coverability graphs, Completeness results for conflict-free vector replacement systems, Unnamed Item, On selective unboundedness of VASS, Problems concerning fairness and temporal logic for conflict-free Petri nets, Petri nets for modelling metabolic pathways: a survey, Checking system boundedness using ordinary differential equations, Petri nets and regular processes, A unified approach for deciding the existence of certain petri net paths, Concurrent regular expressions and their relationship to Petri nets, Fine covers of a VAS language, Undecidability of bisimilarity for Petri nets and some related problems, Forward Analysis and Model Checking for Trace Bounded WSTS, The context-freeness of the languages associated with vector addition systems is decidable, ON YEN'S PATH LOGIC FOR PETRI NETS, Normal and sinkless Petri nets, Pushdown automata, multiset automata, and Petri nets, Unnamed Item, Unnamed Item, Unnamed Item, Decentralized state estimation and diagnosis of p-time labeled Petri nets systems, Analyzing Reachability for Some Petri Nets With Fast Growing Markings, The residue of vector sets with applications to decidability problems in Petri nets, An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets, An investigation of controls for concurrent systems based on abstract control languages, Coverability, Termination, and Finiteness in Recursive Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vector addition systems and regular languages
• Reversal-bounded multipushdown machines
• Computation sequence sets
• The covering and boundedness problems for vector addition systems
• Parallel program schemata
• Petri nets and szilard languages
• An Infinite Hierarchy of Context-Free Languages
• Decidability of Second-Order Theories and Automata on Infinite Trees