Coupling asynchrony and interrupts: Place Chart Nets

DOI10.1007/3-540-63139-9_44zbMath1510.68062WikidataQ56893008 ScholiaQ56893008MaRDI QIDQ6487382

A. V. Yakovlev, A. R. Taubin, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Jordi Cortadella

Publication date: 9 December 2022

Mathematics Subject Classification ID

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

Related Items (3)

Statechartable Petri nets ⋮ Coupling asynchrony and interrupts: Place Chart Nets ⋮ M-nets: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Statecharts: a visual formalism for complex systems
• Elementary transition systems
• The covering and boundedness problems for vector addition systems
• A multiparameter analysis of the boundedness problem for vector addition systems
• Parallel program schemata
• On the power of bounded concurrency I
• Deriving Petri nets from finite transition systems
• Polynomial algorithms for the synthesis of bounded nets
• Coupling asynchrony and interrupts: Place Chart Nets

This page was built for publication: Coupling asynchrony and interrupts: Place Chart Nets