A symbolic reachability graph for coloured Petri nets (Q1392273): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A symbolic reachability graph for coloured Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability trees for high-level Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359783 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(96)00010-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027139596 / rank
 
Normal rank

Latest revision as of 10:20, 30 July 2024

scientific article
Language Label Description Also known as
English
A symbolic reachability graph for coloured Petri nets
scientific article

    Statements

    A symbolic reachability graph for coloured Petri nets (English)
    0 references
    0 references
    23 July 1998
    0 references
    symbolic reachability graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers