Finitely recursive process models for discrete event systems
DOI10.1109/9.1271zbMATH Open0666.93071OpenAlexW1996362167MaRDI QIDQ3818924FDOQ3818924
Authors: Kemal İnan, Pravin Varaiya 
Publication date: 1988
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.1271
Recommendations
finite state machinescontinuous-timesupervisory controlcommunicating sequential processesdata networkfinitely recursive processesdifference equation systemdiscrete event modelscomputer-based controllers
Deterministic scheduling theory in operations research (90B35) Synthesis problems (93B50) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Discrete-time control/observation systems (93C55) Theory of operating systems (68N25)
Cited In (13)
- Discrete events and general systems theory
- Concurrent regular expressions and their relationship to Petri nets
- A resource allocation problem on timed marked graphs: a decomposition approach
- Boundedness analysis of finitely recursive processes. II. Sequential and hybrid processes
- Title not available (Why is that?)
- An algebraic approach to supervisory control
- Aggregation and multi-level control in discrete event dynamic systems
- Title not available (Why is that?)
- A nondeterministic extension over finitely recursive process model
- Asymptotic behaviour of output feedback for a class of non-deterministic discrete event systems
- Solvable systems are usually measurable
- Logical models of discrete even systems: a comparative exposition
- A coordination theory for intelligent machines
This page was built for publication: Finitely recursive process models for discrete event systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818924)
