Concurrency and Nets 1987
DOI: 10.1007/978-3-642-72822-8_34
|View full text |Cite
|
Sign up to set email alerts
|

Petri Nets for Sequence Constraint Propagation in Knowledge Based Approaches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1990
1990
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…From a given space (mark), an applicable rule must be found to pass to next state. One way to implement the dynamic behavior in Petri nets in a grand domain variety is the concept of Token Player [25].…”
Section: Token Playermentioning
confidence: 99%
“…From a given space (mark), an applicable rule must be found to pass to next state. One way to implement the dynamic behavior in Petri nets in a grand domain variety is the concept of Token Player [25].…”
Section: Token Playermentioning
confidence: 99%