A compositional model of time petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1825, Issue , 2000, Pages 303-322

  Koutny, Maciej ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Box algebra; Net based algebraic calculi; Process algebras; Relationships between net theory and other approaches; SOS semantics; Time Petri nets

Indexed keywords

CALCULATIONS; PETRI NETS; SEMANTICS; SYSTEMS ENGINEERING;

BOX ALGEBRA; NET-BASED ALGEBRAIC CALCULI; PROCESS ALGEBRAS; RELATIONSHIPS BETWEEN NET THEORY AND OTHER APPROACHES; SOS SEMANTICS; TIME PETRI NETS;

ALGEBRA;

EID: 84947237470     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44988-4_18     Document Type: Conference Paper

References (19)

1. J. Baeten and W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press (1990).
2. B. Berthomieu and M. Diaz: Modelling and verification of Time Dependent Sys- tems Using Time Petri Nets. IEEE Trans. on Soft. Eng. 17 (1991) 259-273.
3. E. Best, R. Devillers and J. Esparza: General Refinement and Recursion Opera- tors for the Petri Box Calculus. Proc. of STACS'93, P. Enjalbert, A. Finkel and K. W.Wagner (Eds.). Springer-Verlag, Lecture Notes in Computer Science 665 (1993) 130-140.
4. E. Best, R. Devillers and J. Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. In: Advances in Petri Nets 1992, G.Rozenberg (Ed.). Springer-Verlag, Lecture Notes in Computer Science 609 (1992) 21-69.
5. E. Best, R. Devillers and M. Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. In: Advances in Petri Nets. Lectures on Petri Nets II: Applications, W.Reisig and G. Rozenberg (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1492 (1998) 1-84.
6. E. Best, R. Devillers and M. Koutny: The Box Algebra - a Model of Nets and Pro- cess Expressions. Proc. of ICATPN'99, S.Donatelli and J.Kleijn (Eds.). Springer- Verlag, Lecture Notes in Computer Science 1639 (1999) 344-363.
7. E. Best, R. Devillers and M. Koutny: Petri Net Algebra. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (to be published in 2000).
8. B. Bieber and H. Fleischhack: Model Checking of Time Petri Nets Based on Partial Order Semantics. Proc. of CONCUR'99, J. Baeten and S.Mauw (Eds.). Springer- Verlag, Lecture Notes in Computer Science 1664 (1999) 210-225.
9. H. Fleischhack: Computing a Complete Finite Prefix of a Time Petri Net. Draft paper (1999).
10. M. B. Hennessy: Algebraic Theory of Processes. The MIT Press (1988).
11. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall (1985).
12. R. Janicki and P.E. Lauer: Specification and Analysis of Concurrent Systems - the COSY Approach. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1992).
13. M. Koutny and E. Best: Fundamental Study: Operational and Denotational Se- mantics for the Box Algebra. Theoretical Computer Science 211 (1999) 1-83.
14. P. Merlin and D. Farber: Recoverability of Communication Protocols - Implication of a Theoretical Study. IEEE Trans. on Soft. Comm. 24 (1976) 1036-1043.
15. R. Milner: Communication and Concurrency. Prentice Hall (1989).
16. T. Murata: Petri Nets: Properties, Analysis and Applications. Proc. of IEEE 77 (1989) 541-580.
17. G.D. Plotkin: A Structural Approach to Operational Semantics. Teachnical Re- port FN-19, Computer Science Department, University of Aarhus (1981).
18. L. Popova: Time Petri Nets. Journal of Information Processing and Cybernetics EIK 27 (1991) 227-244.
19. W. Reigsi: Petri Nets. An Introduction. EATCS Monographs on Theoretical Com- puter Science, Springer-Verlag (1985).