Abstract
Specification formalisms in which causality and independence of actions can be explicitly expressed are beneficial from a design point of view. The explicit presence (or absence) of a causal dependency between actions can be used effectively during the design. We consider a specification formalism in which causal relations between actions play a central role and provide a semantics in terms of (an extension of) labelled place/transition nets. The behaviour of nets is defined by labelled partially ordered sets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Baeten and W. Weijland. Process Algebra. Cambridge University Press, 1990.
E. Best and R. Devillers. Sequential and concurrent behaviour in Petri net theory. Th. Comp. Sci., 55:87–136, 1987.
E. Best, R. Devillers, and J. Hall. The Box calculus: a new causal algebra with multi-label communication. In G. Rozenberg (ed), Advances in Petri Nets, LNCS 609:21–69. 1992.
T. Bolognesi and G. Ciaccio. Cumulating constraints on the ‘when’ and the ‘what'. In R. Tenney et al (eds), Formal Description Techniques VI, pp. 433–448. 1994.
M. Broy. Formalization of distributed, concurrent, reactive systems. In E. Neuhold and M. Paul (eds), Formal Description of Programming Concepts, pp. 319–361. 1991.
G. Chiola, M. Ajmone Marsan, G. Balbo, and G. Conte. Generalized stochastic Petri nets: A definition at the net level and its implications. IEEE Trans. on Software Eng., 19(2):89–106, 1993.
R. Coelho da Costa and J.-P. Courtiat. Using Petri Nets as a model for Petri Nets. Proc. IEEE Workshop on Future Trends of Distr. Comp. Syst., pp. 41–47. 1992.
L. Ferreira Pires. Architectural Notes: a Framework for Distributed Systems Development. PhD thesis, Univ. of Twente, 1994.
H. Garavel and J. Sifakis. Compilation and verification of LOTOS specifications. In L. Logrippo et al (eds), PSTV X, pp. 359–376. 1990.
U. Goltz and W. Reisig. CSP-programs as nets with individual tokens. In G. Rozenberg et al (eds), Advances in Petri Nets, LNCS 188:169–196. 1984.
J. Gunawardena. Causal automata I: Confluence ≡ {AND, OR}-causality. In M. Kwiatkowska et al (eds), Semantics for Concurrency, pp. 137–156. 1990.
J. Gunawardena. Geometric logic, causality and event structures. In J. Baeten and J. Groote (eds), Concur'91, LNCS 527:266–280. 1991.
J. Gunawardena. Causal automata. Th. Comp. Sci., 101:265–288, 1992.
C. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
P. Hoogers, H. Kleijn, and P. Thiagarajan. Local event structures and Petri nets. In E. Best (ed), Concur'93, LNCS 715:462–476. 1993.
R. Janicki. A formal semantics for concurrent systems with a priority relation. Acta Informatica, 24:33–55, 1987.
K. Jensen. Coloured Petri nets and the invariant-method. Th. Comp. Sci., 14:317–336, 1981.
J.-P. Katoen Causal behaviours and nets. Tech. rep. 94-70, Univ. of Twente. 1994.
C. Koomen. Algebraic specification and verification of communication protocols. Science of Computer Programming, 5(1):1–37, 1985.
L. Lamport. Time, clocks and the ordering of events. CACM, 21(7):558–565, 1978.
R. Langerak. Transformation and Semantics for LOTOS. PhD thesis, Univ. Twente, 1992.
P. Merlin and D. Farber. Recoverability of communication protocols — implications of a theoretical study. IEEE Trans. on Communications, 24:1036–1043, 1976.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
J. Peterson. Petri net theory and modeling of systems. Prentice-Hall, 1981.
G. Pinna and A. Poigné. On the nature of events. In I. Havel and V. Koubek (eds), Mathematical Foundations of Computer Science'92, LNCS 629:430–441. 1992.
G. Pinna and A. Poigné. On the specification of elementary reactive behaviour. In S. Brookes et al (eds), Mathematical Foundations of Programming Semantics'93, LNCS 802:271–292. 1994.
W. Reisig. Petri Nets — An Introduction. Springer-Verlag, 1985.
A. Rensink. Posets for configurations! In W. Cleaveland (ed), Concur'92, LNCS 630:269–285. 1992.
G. Rozenberg and P. Thiagarajan. Petri nets: Basic notions, structure, behaviour. In J. de Bakker et al (eds), Current Trends in Concurrency, LNCS 224:585–668. 1986.
R. Schwarz and F. Mattern. Detecting causal relationships in distributed computations: in search of the holy grail. Distributed Computing, 7:149–174, 1994.
R. van Glabbeek and F. Vaandrager. Petri net models of algebraic theories of concurrency. In J. de Bakker et al (eds), PARLE'87, LNCS 259:224–242. 1987.
M. van Sinderen, L. Ferreira Pires, C. Vissers, and J.-P. Katoen. A design model for open distributed processing systems. Comp. Netw. & ISDN Syst., 1995.
C. Vissers, M. van Sinderen, and L. Ferreira Pires. What makes industries believe in formal methods. In A. Danthine et al (eds), PSTV XIII, pp. 3–26. 1993.
G. Winskel. An introduction to event structures. In J. de Bakker et al (eds), Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354:364–397. 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katoen, JP. (1995). Causal behaviours and nets. In: De Michelis, G., Diaz, M. (eds) Application and Theory of Petri Nets 1995. ICATPN 1995. Lecture Notes in Computer Science, vol 935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60029-9_44
Download citation
DOI: https://doi.org/10.1007/3-540-60029-9_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60029-9
Online ISBN: 978-3-540-49408-9
eBook Packages: Springer Book Archive