Skip to main content

Sequention

  • Chapter
  • 591 Accesses

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 101))

Abstract

The third chapter continues a theme of the first section on a higher level. Not only separate switchings are investigated but their sequences of a certain type. These sequences are named sequentions. Sequention is a more complicated mathematical form, which includes venjunctions as minisequentions. Depending on configuration, sequentions are subdivided into the following types: simple and complicated, correct and incorrect, perfect and imperfect, elementary and composite, compatible and inconsistent. For the elements of composite sequentions, binary relations are established as being derived from relationships existing in ordered sets. The rules are developed for transformation of sequentions by means of splitting and slicing actions. General principles are formulated for performing conjunction, disjunction and venjunction operations on sequentions. On the basis of decomposition of sequentions logical expressions are obtained. These expressions represent sequential functions in conjunctive or venjunctive form. For clarity, logical behavior of sequention is assigned by a graph of special form. It is suggested to estimate logical expressions of sequential type by memory depth and volume of memory. Example of the corresponding calculation is brought forward.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vasyukevich, V.: Monotone sequences of binary data sets and their identification by means of venjunctive functions. ACCS Journal 32(5), 49–56 (1998)

    Google Scholar 

  2. Vasyukevich, V.: Asynchronous sequences decoding. ACCS Journal 41(2), 93–99 (2007)

    Google Scholar 

  3. Gill, A.: Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York (1962)

    MATH  Google Scholar 

  4. Yakubaitis, E., Vasyukevich, V., et al.: Automata theory. Journal of Mathematical Sciences 7(2), 193–243 (1977)

    Article  Google Scholar 

  5. McCluskey, E.: Introduction to the Theory of Switching Circuits. McGraw-Hill Book Company, New York (1965)

    MATH  Google Scholar 

  6. Hill, F., Peterson, G.: Introduction to Switching Theory and Logical Design. John Wiley and Sons, Chichester (1968)

    Google Scholar 

  7. Muller, D., Bartky, W.: A Theory of Asynchronous Circuits. In: Proc. Int’l Symp. Theory of Switching, Part 1, pp. 204–243 (1959)

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Vasyukevich, V. (2011). Sequention. In: Asynchronous Operators of Sequential Logic: Venjunction & Sequention. Lecture Notes in Electrical Engineering, vol 101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21611-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21611-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21610-7

  • Online ISBN: 978-3-642-21611-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics