Skip to main content
SpringerLink
Log in

Structural operational specifications and trace automata

  • Conference paper
  • First Online:
CONCUR '92 (CONCUR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 630))

Included in the following conference series:

Abstract

Structural Operational Specifications (SOS) are supplied with concurrent models based on permutations of proved transitions. Those models take the form of trace automata which are deterministic automata equipped with an explicit relation of independence on actions. In order to characterize the finite trace automata which may be realized in SOS-algebras, we introduce a new kind of nets which encode exactly the concurrent behaviour of systems specified in SOS and we establish a correspondence between nets and the so-called ‘separated’ trace automata which may be realized in SOS.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, A., and Nivat, M., Comportements de processus. Colloque AFCET « Les Mathématiques de l'Informatique », (1982) 35–68.

    Google Scholar 

  2. Badouel, E., and Darondeau, Ph., Structural Operational Specifications and Trace Automata, INRIA research report no 1631 (1992).

    Google Scholar 

  3. Bednarczyk, M.A., Categories of asynchronous systems. PhD thesis, University of Sussex, report no.1/88 (1988).

    Google Scholar 

  4. Boudol, G., and Castellani, I., A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae XI (1988) 433–452.

    MathSciNet  Google Scholar 

  5. Boudol, G., and Castellani, I., Three Equivalent Semantics for CCS. Semantics of Systems of Concurrent Processes, I. Guessarian (Ed.) LNCS 469 (1990) 96–141.

    Google Scholar 

  6. De Simone, R., Calculabilité et expressivité dans l'algèbre de processus MEIJE. Thèse de 3ème Cycle, Université de Paris VII (1984).

    Google Scholar 

  7. Larsen, K., and Xinxin, L., Compositionality through an operational semantics of contexts. Proc. 17th ICALP (Warwick), LNCS 443 (1990) 526–539.

    MATH  Google Scholar 

  8. Milner, R., A calculus of communicating systems. Springer-Verlag LNCS 92 (1980).

    Google Scholar 

  9. Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., Elementary Transition Systems. DAIMI PB-310 Aarhus (1990).

    Google Scholar 

  10. Nivat, M., Sur la synchronisation des processus. Revue technique Thomson-CSF, 11, (1979) 899–919.

    Google Scholar 

  11. Plotkin, G., A structural approach to operational semantics. DAIMI-FN-19 Aarhus (1981).

    Google Scholar 

  12. Stark, E.W., Concurrent transition systems. Theoretical Computer Science 64 (1989) 221–269.

    Article  MATH  MathSciNet  Google Scholar 

  13. Stark, E.W., Connections between a concrete and an abstract model of concurrent systems. 5th Mathematical Foundations of programming semantics (1989) 53–79.

    Google Scholar 

  14. Stark, E.W., Compositional Relational Semantics for Indeterminate Dataflow Networks. Summer Conference on Category Theory and Computer Science, LNCS 389 (1989) 52–74.

    MathSciNet  Google Scholar 

  15. Winskel, G., Categories of Models for Concurrency. Advanced School on the Algebraic, Logical, and Categorical Foundations of Concurrency, Gargnano del Garda (1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Irisa, Campus de Beaulieu, F-35042, Rennes Cedex, France

    Eric Badouel & Philippe Darondeau

Authors
  1. Eric Badouel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W.R. Cleaveland

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Badouel, E., Darondeau, P. (1992). Structural operational specifications and trace automata. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084799

Download citation

  • DOI: https://doi.org/10.1007/BFb0084799

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55822-4

  • Online ISBN: 978-3-540-47293-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation