Modular synthesis of timed circuits using partial orders on LPNs

DOI10.1016/S1571-0661(04)80476-6MaRDI QIDQ2842584zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eric G. Mercer, Chris J. Myers, Tomohiro Yoneda, Hao Zheng

Publication date 15 August 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0661(04)80476-6

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 1361136
• Synthesis of Petri nets from finite partial languages
• Comparison of different algorithms to synthesize a Petri net from a partial language
• Timed Petri nets with reset for pipelined synchronous circuit design

Cites work

• A theory of timed automata
• Defining conditional independence using collapses
• scientific article; zbMATH DE number 177237 (Why is no real title available?)
• scientific article; zbMATH DE number 177513 (Why is no real title available?)
• scientific article; zbMATH DE number 1361136 (Why is no real title available?)
• scientific article; zbMATH DE number 1796133 (Why is no real title available?)
• On the learnability of infinitary regular sets
• Symbolic model checking for real-time systems

Describes a project that uses

Uses Software

• Kronos

This page was built for publication: Modular synthesis of timed circuits using partial orders on LPNs

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