Petri nets and regular languages

DOI10.1016/0022-0000(81)90067-2MaRDI QIDQ1158763zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• An Infinite Hierarchy of Context-Free Languages
• Computation sequence sets
• Decidability of Second-Order Theories and Automata on Infinite Trees
• scientific article; zbMATH DE number 3688732 (Why is no real title available?)
• scientific article; zbMATH DE number 3574998 (Why is no real title available?)
• scientific article; zbMATH DE number 3628412 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Parallel program schemata
• Petri nets and szilard languages
• Reversal-bounded multipushdown machines
• The covering and boundedness problems for vector addition systems
• Vector addition systems and regular languages

Cited in

(35)

• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• An investigation of controls for concurrent systems based on abstract control languages
• A logical approach of Petri net languages
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• Completeness results for conflict-free vector replacement systems
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• 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
• The context-freeness of the languages associated with vector addition systems is decidable
• Normal and sinkless Petri nets
• Word problems of groups: formal languages, characterizations and decidability
• Petri nets and regular processes
• Decentralized state estimation and diagnosis of p-time labeled Petri nets systems
• Incremental construction of coverability graphs
• Forward analysis and model checking for trace bounded WSTS
• ON YEN'S PATH LOGIC FOR PETRI NETS
• On the expressive power of behavioral profiles
• On selective unboundedness of VASS
• Checking system boundedness using ordinary differential equations
• Regular separability of one counter automata
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• Coverability, termination, and finiteness in recursive Petri nets
• scientific article; zbMATH DE number 7559498 (Why is no real title available?)
• Determinisability of register and timed automata
• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• Pushdown automata, multiset automata, and Petri nets
• Petri nets for modelling metabolic pathways: a survey
• Fast termination and workflow nets
• Dimension-minimality and primality of counter nets
• Undecidability of bisimilarity for Petri nets and some related problems
• History-deterministic vector addition systems
• About decisiveness of dynamic probabilistic models
• Languages of boundedly-ambiguous vector addition systems with states
• The residue of vector sets with applications to decidability problems in Petri nets

This page was built for publication: Petri nets and regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158763)