The following pages link to Petri nets and regular languages (Q1158763):
Displaying 30 items.
- On the expressive power of behavioral profiles (Q315288) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Checking system boundedness using ordinary differential equations (Q454908) (← links)
- Petri nets for modelling metabolic pathways: a survey (Q609029) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- The residue of vector sets with applications to decidability problems in Petri nets (Q797285) (← links)
- An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets (Q1059399) (← links)
- An investigation of controls for concurrent systems based on abstract control languages (Q1060008) (← links)
- A logical approach of Petri net languages (Q1083861) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
- Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
- Fine covers of a VAS language (Q1186433) (← links)
- The context-freeness of the languages associated with vector addition systems is decidable (Q1193880) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
- Petri nets and regular processes (Q1970202) (← links)
- Decentralized state estimation and diagnosis of p-time labeled Petri nets systems (Q2058497) (← links)
- Incremental construction of coverability graphs (Q2379973) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- ON YEN'S PATH LOGIC FOR PETRI NETS (Q3016216) (← links)
- (Q4968382) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- (Q5089309) (← links)
- (Q5094137) (← links)
- (Q5111264) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
