Coupling asynchrony and interrupts: Place Chart Nets
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5269308
- From concurrent multi-clock programs to deterministic asynchronous implementations
- CONCUR 2005 – Concurrency Theory
- Interprocedural analysis of asynchronous programs
- Asynchronous programming facilities for multiprocessor systems
- Asynchronous traces and open Petri nets
- Lectures on Concurrency and Petri Nets
- Nets, sequential components and concurrency relations
Cites work
- A multiparameter analysis of the boundedness problem for vector addition systems
- Coupling asynchrony and interrupts: Place Chart Nets
- Deriving Petri nets from finite transition systems
- Elementary transition systems
- scientific article; zbMATH DE number 4024805 (Why is no real title available?)
- scientific article; zbMATH DE number 4082959 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 512821 (Why is no real title available?)
- scientific article; zbMATH DE number 557977 (Why is no real title available?)
- scientific article; zbMATH DE number 711039 (Why is no real title available?)
- On the power of bounded concurrency I
- Parallel program schemata
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Polynomial algorithms for the synthesis of bounded nets
- Statecharts: a visual formalism for complex systems
- The covering and boundedness problems for vector addition systems
Cited in
(3)
This page was built for publication: Coupling asynchrony and interrupts: Place Chart Nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487382)
