Skip to main content
  • 703 Accesses

Abstract

In this chapter we present the formal semantics of DFCharts. Section 4.1 discusses the automata semantics, introduced first in [88], where the behaviour of a complete specification is expressed as an FSM. This section is divided into seven sub-sections Section 4.1.1 introduces multiclock FSMs that are used as inputs to DFCharts operators. Sections 4.1.2–4.1.5 define the semantics of four DFCharts operators: synchronous parallel, asynchronous parallel, localization\hiding and refinement. DFCharts operators are defined in a similar style as Argos [24] operators. However, because of the use of multiclock FSMs, their operation is quite different. Section 4.1.6 defines with a simple language how the operators may be applied on multiclock FSMs. As seen in Chap. 3, an SDFG and an FSM are connected with the asynchronous parallel operator. According to the semantics of the asynchronous parallel operator in Sect. 4.1.3, it operates only on FSMs like all other operators. For this reason, an SDFG is represented as an FSM so that it can be combined with “real FSMs”. This is the topic of Sect. 4.1.7. Since an SDFG proceeds at its own speeds, an FSM that represents an SDFG (“SDF FSM”) is triggered by a clock that is different from the clock of real FSMs. Thus, when a “real FSM” and “SDF FSM” are combined, a multiclock FSM results. In the definitions of operators, which comprise DFCharts automata semantics, rendezvous is treated simply as an event that triggers a transition. What exactly happens on the channel is irrelevant. This is the topic of Sect. 4.2. It examines in detail the ordering of events on a channel within the Tagged Signal Model (TSM) framework. The analysis leads to understanding of how an array variable produces multiple SDF tokens and vice versa. Data transfer from SDF to FSM is the topic of Sect. 4.2.1, while Sect. 4.2.2. deals with data transfer from FSM to SDF. The TSM semantics of DFCharts was previously described in [89]. Finally, Sect. 4.3 examines the effect of clock speeds on DFCharts behaviour.

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

Access this chapter

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.00
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

Institutional subscriptions

References

  1. C.A.R. Hoare, Communicating sequential processes. Commun. ACM 21(8), 666–677 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. R. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, 1989)

    MATH  Google Scholar 

  3. www.esterel-tecnologies.com

  4. F. Maraninchi, Y. Remond, Argos: an automaton-based synchronous language. Comput. Lang. 27(1–3), 61–92 (2001)

    Article  MATH  Google Scholar 

  5. E.A. Lee, A. Sangiovanni-Vincentelli, A framework for comparing models of computation. IEEE Trans. Comput. Aided Des. Circ. Syst. 17(12), 1217–1229 (1998)

    Article  Google Scholar 

  6. S. Stuijk, M. Geilen, T. Basten, Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs, in Proceedings of Design Automation Conference (DAC ’06), San Francisco, July 2006

    Google Scholar 

  7. Esterel v7 reference manual, available from www.esterel-technologies.com

  8. I. Radojevic, Z. Salcic, P. Roop, Design of heterogeneous embedded systems using DFCharts model of computation, in Proceedings of VLSI Design, Hyderabad, 3–7 Jan 2006

    Google Scholar 

  9. I. Radojevic, Z. Salcic, P. Roop, Modeling heterogeneous embedded systems in DFCharts, in Proceedings of Forum on Design and Specification Languages (FDL), Lausanne, 27–30 Sept 2005

    Google Scholar 

  10. M. Hennessy, H. Lin, Symbolic bisimulations. Theor. Comput. Sci. 138(2), 353–389 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. R. Alur, D. Dill, A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. S. Ramesh, Communicating reactive state machines: design, model and implementation, in IFAC Workshop on Distributed Computer Control Systems (Pergamon Press, Oxford, 1998)

    Google Scholar 

  13. S. Ramesh, Implementation of communicating reactive processes. Parallel Comput. 25(6), 703–727 (1999)

    Article  MATH  Google Scholar 

  14. G. Berry, E. Sentovich, Multiclock Esterel, in Proceedings of Correct Hardware Design and Verification Methods (CHARME), LNCS 2144, Sept 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ivan Radojevic .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Radojevic, I., Salcic, Z. (2011). Semantics of DFCharts. In: Embedded Systems Design Based on Formal Models of Computation. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1594-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-1594-3_4

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-1593-6

  • Online ISBN: 978-94-007-1594-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics