Synthesis and reengineering of persistent systems (Q2257983): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Synet / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: APT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-014-0209-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060105961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis problem for elementary net systems is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for the synthesis of bounded nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for finite persistent transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3225713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri Net Distributability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of Persistent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Theory of Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Concurrency and Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidability theorem for a class of vector-addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis problem of Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial (set) 2-structures. I: Basic notions and the representation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronisationsgraphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial (set) 2-structures. II: State spaces of concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock-Freeness Analysis of Continuous Mono-T-Semiflow Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitration-free synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Conflict-Free and Persistent Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Causal Semantics of Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distributability of Petri Nets / rank
 
Normal rank

Revision as of 18:08, 9 July 2024

scientific article
Language Label Description Also known as
English
Synthesis and reengineering of persistent systems
scientific article

    Statements

    Synthesis and reengineering of persistent systems (English)
    0 references
    0 references
    0 references
    2 March 2015
    0 references
    0 references
    0 references
    0 references

    Identifiers