Step Persistence in the Design of GALS Systems

DOI10.1007/978-3-642-38697-8_11zbMath1381.68200OpenAlexW182067778MaRDI QIDQ5300872

Danil Sokolov, Maciej Koutny, Marta Pietkiewicz-Koutny, Johnson Fernandes, A. V. 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

zbMATH Keywords

persistencePetri netVLSI circuitsstep transition systemGALS systemglobally asynchronous locally synchronous system

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 (1)

Non-atomic Transition Firing in Contextual Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On persistent reachability in Petri nets
• Decomposition Theorems for Bounded Persistent Petri Nets
• Separability in Persistent Petri Nets
• Properties of Conflict-Free and Persistent Petri Nets
• Modelling, analysis and synthesis of asynchronous control circuits using Petri nets
• Logic Synthesis for Asynchronous Controllers and Interfaces
• A Taxonomy of Persistent and Nonviolent Steps

This page was built for publication: Step Persistence in the Design of GALS Systems