REGULAR STATE MACHINES

DOI10.1080/01495730008945375MaRDI QIDQ4526933zbMATH OpenOpenAlexFDO

Authors Lothar Thiele, Jürgen Teich, Karsten Strehl

Publication date 31 January 2001

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01495730008945375

zbMATH Keywords

Petri netsregular state machines

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1796135
• On Communicating Finite-State Machines
• CONCUR 2004 - Concurrency Theory
• scientific article; zbMATH DE number 1670791
• An automaton model for scheduling constraints in synchronous machines

Cites work

• A decidability theorem for a class of vector-addition systems
• An automaton model for scheduling constraints in synchronous machines
• Free Choice Petri Nets
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 526071 (Why is no real title available?)
• Marked directed graphs
• Parallel program schemata
• Properties of Conflict-Free and Persistent Petri Nets
• Statecharts: a visual formalism for complex systems
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
• The Organization of Computations for Uniform Recurrence Equations

Cited in

(1)

• An automaton model for scheduling constraints in synchronous machines

This page was built for publication: REGULAR STATE MACHINES

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