Synthesis of Persistent Systems
From MaRDI portal
Publication:5166759
Recommendations
- Synthesis and reengineering of persistent systems
- Synthesis of live and bounded persistent systems
- Uniformly Persistent Systems
- Synthesizing robust systems
- Synthesis of Asynchronous Systems
- Synthesis of succinct systems
- Synthesis of succinct systems
- scientific article; zbMATH DE number 2086659
- scientific article; zbMATH DE number 3956418
- Synthesis and equivalence of concurrent systems
Cites work
- scientific article; zbMATH DE number 1302048 (Why is no real title available?)
- A decomposition theorem for finite persistent transition systems
- Characterisation of the state spaces of live and bounded marked graph Petri nets
- Petri net distributability
- Petri net synthesis
- Properties of Conflict-Free and Persistent Petri Nets
Cited in
(10)- Synthesis of succinct systems
- Synthesis of (choice-free) reset nets
- State space axioms for T-systems
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- scientific article; zbMATH DE number 2086659 (Why is no real title available?)
- Bounded choice-free Petri net synthesis: algorithmic issues
- Characterisation of the state spaces of marked graph Petri nets
- Synthesis of live and bounded persistent systems
- Target-oriented Petri net synthesis
- Synthesis and reengineering of persistent systems
This page was built for publication: Synthesis of Persistent Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166759)