Synthesis and reengineering of persistent systems
DOI10.1007/S00236-014-0209-7zbMATH Open1310.68148OpenAlexW2060105961MaRDI QIDQ2257983FDOQ2257983
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Marked directed graphs
- On causal semantics of Petri nets (extended abstract)
- Title not available (Why is that?)
- Deadlock-Freeness Analysis of Continuous Mono-T-Semiflow Petri Nets
- Title not available (Why is that?)
- The synthesis problem of Petri nets
- 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
- Synchronisationsgraphen
- Properties of Conflict-Free and Persistent Petri Nets
- Synthesis of Persistent Systems
- Characterisation of the state spaces of live and bounded marked graph Petri nets
- A decidability theorem for a class of vector-addition systems
- The synthesis problem for elementary net systems is NP-complete
- On Distributability of Petri Nets
- Polynomial algorithms for the synthesis of bounded nets
- Separability in persistent Petri nets
- Petri net distributability
- Lectures on Concurrency and Petri Nets
- Structure theory of Petri nets
- Arbitration-free synchronization
Cited In (10)
- 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
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
Uses Software
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)
