Paper Info
Title
Regular state machines
Abstract
In this paper, we introduce a model called regular state machines (RSMs) that characterizes a class of state transition systems with regular transition behavior. It turns out that many process graph models such as synchronous dataflow graphs and Petri nets have a state transition system that may be described and analyzed in the RSM model. In particular, the proposed approach unifies methods known for the above-mentioned subclasses and yields new results concerning bound- edness, deadlocks, scheduling, and formal verification.
Year
DOI
Venue
2000
10.1080/01495730008945375
Parallel Algorithms Appl.
Keywords
DocType
Volume
scheduling,petri net,infinite state,model of computation,formal verification,state transition system,state machine
Journal
15
Issue
Citations 
PageRank 
3-4
5
0.54
References 
Authors
23
3
Name
Order
Citations
PageRank
Lothar Thiele114025957.82
Jürgen Teich22886273.54
Karsten Strehl313410.86