Modular Synthesis of Timed Circuits using Partial Orders on LPNs

DOI10.1016/S1571-0661(04)80476-6zbMath1270.68217DBLPjournals/entcs/MercerMY02OpenAlexW2039330627WikidataQ59859602 ScholiaQ59859602MaRDI QIDQ2842584

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

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)

Uses Software

• Kronos

Cites Work

• Defining conditional independence using collapses
• A theory of timed automata
• Symbolic model checking for real-time systems
• On the learnability of infinitary regular sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modular Synthesis of Timed Circuits using Partial Orders on LPNs