Step persistence in the design of GALS systems
DOI10.1007/978-3-642-38697-8_11zbMATH Open1381.68200OpenAlexW182067778MaRDI QIDQ5300872FDOQ5300872
Authors: Johnson Fernandes, Maciej Koutny, Marta Pietkiewicz-Koutny, Danil Sokolov, Alex Yakovlev 
Publication date: 28 June 2013
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=190093/FC2DE0A4-5D3C-4AA2-9AEF-D388079CB6DD.pdf&pub_id=190093
Recommendations
persistenceVLSI circuitsPetri netstep transition systemGALS systemglobally asynchronous locally synchronous system
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
- Logic Synthesis for Asynchronous Controllers and Interfaces
- Title not available (Why is that?)
- Properties of Conflict-Free and Persistent Petri Nets
- Modelling, analysis and synthesis of asynchronous control circuits using Petri nets
- Title not available (Why is that?)
- On persistent reachability in Petri nets
- Decomposition Theorems for Bounded Persistent Petri Nets
- Separability in Persistent Petri Nets
- Levels of persistency in place/transition nets
- A taxonomy of persistent and nonviolent steps
Cited In (5)
This page was built for publication: Step persistence in the design of GALS systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300872)
