Synthesis of Persistent Systems

DOI10.1007/978-3-319-07734-5_7zbMATH Open1334.68146OpenAlexW1577372958MaRDI QIDQ5166759FDOQ5166759

Eike Best, Raymond Devillers

Publication date: 8 July 2014

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07734-5_7

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

zbMATH Keywords

Petri netspersistencylabelled transition systemsParikh vectorssystem synthesisregion theorycyclic behaviourreengineering

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• A decomposition theorem for finite persistent transition systems
• Properties of Conflict-Free and Persistent Petri Nets
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
• Petri net synthesis
• Petri Net Distributability

Cited In (9)

• Synthesis of (choice-free) reset nets
• Title not available (Why is that?)
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Synthesis and reengineering of persistent systems
• Synthesis of succinct systems
• State space axioms for T-systems
• Bounded choice-free Petri net synthesis: algorithmic issues
• Target-oriented Petri Net Synthesis
• Characterisation of the state spaces of marked graph Petri nets

Uses Software

• GitHub

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)