Computing the reveals relation in occurrence nets (Q391112): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244022 / rank
 
Normal rank
Property / zbMATH Keywords
 
structure of Petri nets
Property / zbMATH Keywords: structure of Petri nets / rank
 
Normal rank
Property / zbMATH Keywords
 
behavior of Petri nets
Property / zbMATH Keywords: behavior of Petri nets / rank
 
Normal rank
Property / zbMATH Keywords
 
partial-order theory of concurrency
Property / zbMATH Keywords: partial-order theory of concurrency / rank
 
Normal rank
Property / zbMATH Keywords
 
automatic analysis
Property / zbMATH Keywords: automatic analysis / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PEP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mole / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072146911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of McMillan's unfolding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical prefixes of Petri net unfoldings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial order techniques for distributed discrete event systems: why you cannot avoid using them / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching processes of Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure future local temporal logics are expressively complete for Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local to global temporal logics over Mazurkiewicz traces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagnosis of asynchronous discrete-event systems: a net unfolding approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed monitoring of concurrent and asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247290 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:44, 7 July 2024

scientific article
Language Label Description Also known as
English
Computing the reveals relation in occurrence nets
scientific article

    Statements

    Computing the reveals relation in occurrence nets (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    structure of Petri nets
    0 references
    behavior of Petri nets
    0 references
    partial-order theory of concurrency
    0 references
    automatic analysis
    0 references
    0 references
    0 references

    Identifiers