Synthesis and reengineering of persistent systems

DOI10.1007/s00236-014-0209-7zbMath1310.68148OpenAlexW2060105961MaRDI QIDQ2257983

Raymond Devillers, Eike Best

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)

Related Items (7)

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

Uses Software

• Synet
• GitHub
• APT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Partial (set) 2-structures. II: State spaces of concurrent systems
• A decomposition theorem for finite persistent transition systems
• A decidability theorem for a class of vector-addition systems
• The synthesis problem for elementary net systems is NP-complete
• The synthesis problem of Petri nets
• Marked directed graphs
• Synchronisationsgraphen
• On Distributability of Petri Nets
• On Causal Semantics of Petri Nets
• Petri Net Distributability
• Properties of Conflict-Free and Persistent Petri Nets
• Structure Theory of Petri Nets
• Polynomial algorithms for the synthesis of bounded nets
• Arbitration-free synchronization
• Synthesis of Persistent Systems
• Deadlock-Freeness Analysis of Continuous Mono-T-Semiflow Petri Nets
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
• Lectures on Concurrency and Petri Nets

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