Abstract
Trace nets are a variant of one-safe Petri nets, where input and output places may be filled as well as emptied by transitions. Those extended nets are introduced for modelling concurrency in a simple format of structural operational specifications, based on permutation of proved transitions. Trace nets are connected by an adjunction to a particular class of trace automata in the sense of Stark, namely the separated trace automata. The adjunction is based on a calculus of ‘regions’ that differ significantly from the ones devised by Ehrenfeucht and Rozenberg for elementary nets, although the axioms of separation are the same.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[AN82] Arnold, A., Nivat, M.: Comportements de processus. Colloque AFCET Les Mathématiques de l'Informatique 35–68 1982.
[Bed88] Bednarczyk, M.A.: Categories of asynchronous systems. PhD thesis, University of Sussex, report no. 1/88, 1988.
[BDP93] Bernardinello, L., De Michelis, G., Petruni, K.: Synchronic distances as Generalized Regions. Rapporto Interno no. 107-93, Dipartimento di Scienze dell'Informazione, Universitá degli Studi di Milano, 1993.
[BC88] Boudol, G., Castellani, I.: A non-interleaving semantics for CCS based on proved transitions. Fundamenta InformaticaeXI 433–452 (1988).
[BC90] Boudol, G., Castellani, I.: Three equivalent semantics for CCS. In: Semantics of Systems of Concurrent Processes, I. Guessarian (ed.) LNCS 469, 96–141 (1990)
[deS84] De Simone, R.: Calculabilité et expressivité dans l'algébre de processus MEIJE. Thèse de 3eme Cycle, Université de Paris VII, 1984.
[DS93] Droste, M., Shortt, R.M.: Petri nets and automata with concurrency relations—an adjunction. In: Semantics of Programming Languages and Model Theory, M. Droste and Y. Gurevich (eds) pp. 69–87 (1993).
[ER90] Ehrenfeucht, A., Rozenberg, G.: Partial 2-structures; Part I: Basic Notions and the Representation Problem, and Part II: State Spaces of Concurrent Systems, Acta Informatica, 27 (1990).
[LX90] Larsen, K., Xinxin, L.: Compositionality through an operational semantics of contexts, Proc. 17th ICALP (Warwick), LNCS 443 526–539 (1990).
[Ler71] Leroux, P.: Structure et sémantique abstraites: extension à des catégories de morphismes d'une paire de foncteurs adjoints. Report of the Midwest Category Seminar V. Springer-Verlag Lecture Notes in Mathematics 195, 154–198 (1971)
[Mac71] Mac Lane, S.: Categories for the Working Mathematician. Springer-Verlag (1971).
[Mil80] Milner, R.: A Calculus of Communicating Systems. Springer-Verlag LNCS 92 (1980).
[Muk93] Mukund, M.: Petri Nets and Step Transition Systems. Int. J. Foundation Comput. Sci.3, 443–478 (1993).
[NRT90] Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems. TCS96, 3–33 (1992).
[NRT91] Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Transition systems, event structures and unfoldings. DAIMI PB-353 Aarhus (1991).
[Niv79] Nivat, M.: Sur la synchronisation des processus. Revue technique Thomson-CSF, 11, 899–919 (1979).
[Plo81] Plotkin, G.: A structural approach to operational semantics. DAIMI-FN-19 Aarhus (1981).
[Sta89] Stark, E.W.: Connections between a Concrete and an Abstract Model of Concurrent Systems. 5th Mathematical Foundations of Programming Semantics 53–79, (1989).
[Win94] Winskel, G, Nielsen, M.: Models for Concurrency. BRICS Report RS.94.12, Aarhus (1994)
Author information
Authors and Affiliations
Additional information
This work was partly supported by the project MASK of the E.C. Program Science.
Rights and permissions
About this article
Cite this article
Badouel, E., Darondeau, P. Trace nets and process automata. Acta Informatica 32, 647–679 (1995). https://doi.org/10.1007/BF01186645
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01186645