Synthesis and reengineering of persistent systems

DOI10.1007/S00236-014-0209-7MaRDI QIDQ2257983zbMATH OpenOpenAlexFDO

Authors Eike Best, Raymond Devillers

Publication date 2 March 2015

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-014-0209-7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Synthesis of Persistent Systems
• Synthesis of live and bounded persistent systems
• Characterisation of the state spaces of marked graph Petri nets
• Simultaneous Petri Net Synthesis
• Synthesis of bounded choice-free Petri nets

Cites work

• scientific article; zbMATH DE number 1302048 (Why is no real title available?)
• scientific article; zbMATH DE number 1341754 (Why is no real title available?)
• A decidability theorem for a class of vector-addition systems
• A decomposition theorem for finite persistent transition systems
• Arbitration-free synchronization
• Characterisation of the state spaces of live and bounded marked graph Petri nets
• Deadlock-Freeness Analysis of Continuous Mono-T-Semiflow Petri Nets
• Lectures on Concurrency and Petri Nets
• Marked directed graphs
• On Distributability of Petri Nets
• On causal semantics of Petri nets (extended abstract)
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Petri net distributability
• Polynomial algorithms for the synthesis of bounded nets
• Properties of Conflict-Free and Persistent Petri Nets
• Separability in persistent Petri nets
• Structure theory of Petri nets
• Synchronisationsgraphen
• Synthesis of Persistent Systems
• The synthesis problem for elementary net systems is NP-complete
• The synthesis problem of Petri nets

Cited in

(10)

• Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
• Target-oriented Petri net synthesis
• Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
• State space axioms for T-systems
• Synthesis of live and bounded persistent systems
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Bounded choice-free Petri net synthesis: algorithmic issues
• An extension of the taxonomy of persistent and nonviolent steps
• Synthesis of Persistent Systems
• Characterisation of the state spaces of marked graph Petri nets

Describes a project that uses

Uses Software

• GitHub
• APT
• Synet

This page was built for publication: Synthesis and reengineering of persistent systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2257983)