Advertisement

Deterministic asynchronous automata

  • M. W. Shields
Part II Logic And Automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)

Abstract

We present a model of a deterministic asynchronous input/output device based on functions between sets of labelled posets. For a restricted class of these, it is possible to reformulate the model in terms of partial functions between monoids from which we obtain an extension of the conventional sequential automaton. We conclude with some remarks on extensions to this work and its relationship to other theories of parallel systems.

Keywords

Behaviour System Partial Function Independence Relation Path Expression Valid Input 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Arnold A.: Synchronized Behaviour of Processes and Rational Relations. Acta Informatica, 17 pp.21–29, 1982Google Scholar
  2. [2]
    Brauer (ed), Advanced Course on General Net Theory of Systems and Processes, Hamburg, 1979. LNCS 90Google Scholar
  3. [3]
    Lauer, P.E., Torrigiani, P., Shields, M.W.: COSY: A Specification Language based on Path Expressions. Acta Informatica, 12 pp. 109–158, 1979.Google Scholar
  4. [4]
    Mazurkiewicz, A: Concurrent program schema and their interpretations. Proc. Aarhus Workshop on Verification of Parallel Programs, 1977Google Scholar
  5. [5]
    Milner, A.R.J.G.: A Calculus of Communicating Systems, LNCS92, Springer 1980.Google Scholar
  6. [6]
    Neilsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains. Proc. Symposium on Semantics of Concurrent Computation, Evian-les-Bains, 1979. LNCS 70.Google Scholar
  7. [7]
    Nivat, M.: On the Synchronization of Processes, Tech. Rep. 79-34, Laboratoire Informatique Theoretique et Programmation, Univeriste P. et M. Curie, 2 Place Jussieu, Paris, 1979Google Scholar
  8. [8]
    Nivat, M., Arnold, A.: Comportements de Processus, Tech. Rep. 82-12, Laboratoire Informatique Theoretique et Programmation, Univeriste P. et M. Curie, 2 Place Jussieu, Paris, 1982Google Scholar
  9. [9]
    Shields, M.W.: Adequate Path Expressions, Procedings, Symposium on the Semantics of Concurrent Computation, Evian-les-Bains, 1979, in LNCS70.Google Scholar
  10. [10]
    Shields, M.W.: Non-sequential behaviours 1, Tech Report CRS-119-82, University of Edinburgh, Department of Computer Science, June, 1982.Google Scholar
  11. [11]
    Shields, M.W.: Concurrency, Correctness, Proof and Undecidability in SDL-like Systems, Tech Report CRS-119-82, University of Edinburgh, Department of Computer Science, June, 1982.Google Scholar
  12. [12]
    Shields, M.W.: Concurrency, Correctness, Proof and Undecidability in SDL-like Systems, Procedings, IEE Conference on Software Engineering for Telecommunications Switching Systems, Lundt, Sweden, 1983. ( Digest of [11] ).Google Scholar
  13. [13]
    Shields, M.W.: Non-sequential behaviours 2, Tech Report CRS-144-83, University of Edinburgh, Department of Computer Science, October 1983Google Scholar
  14. [14]
    Winskel, G.: Events in Computation (Ph. D. thesis). Department of Computer Science, University of Edinburgh, 1980.Google Scholar
  15. [15]
    Winskel, G.: Event Structure Semantics for CCS and Related Languages. Tech. Rep. DAIMIPB-159, Computer Science Department, University of Aarhus, April, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • M. W. Shields
    • 1
  1. 1.Electronics LaboratoriesThe University of Kent at CanterburyUSA

Personalised recommendations