Concatenable weighted pomsets and their applications to modelling processes of Petri nets

Fundamenta Informaticae

Volumn 28, Issue 3-4, 1996, Pages 403-421

  Winkowski, Józef ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

Actual timed process; Algebra; Concatenable weighted pomset; Interchange; Parallel composition; Potential timed process; Process; Sequential composition; Symmetry; Table; Time Petri net; Timed Petri net

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; MATHEMATICAL MODELS; PETRI NETS; SET THEORY;

CONCATENABLE WEIGHTED POMSETS; PARALLEL COMPOSITION; SEQUENTIAL COMPOSITION;

DATA STRUCTURES;

EID: 0030383467     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-283413     Document Type: Article

References (20)

1. Berthomieu, B., Diaz, M., Modeling and Verification of Time Dependent Systems Using Time Petri Nets, IEEE Trans. on Software Engineering, vol.17, no.3, March 1991, pp.259-273
2. Brown, C., Gurr, D., Timing Petri Nets Categorically, Springer LNCS 623, Proc. of ICALP'92, 1992, pp.571-582
3. Degano, P., Meseguer, J., Montanari, U., Axiomatizing Net Computations and Processes, in the Proceedings of 4th LICS Symposium, IEEE, 1989, pp.175-185
4. Ferrari, G.-L., Montanari, U., Mowbray, M., Tracing Causality in Distributed Systems (Extended Abstract), in Proc. 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991, Hildesheimer Informatik - Bericht 6/91, Universität Hildesheim, pp.99-108
5. Godefroid, P., Kabanza, F., An Efficient Reactive Planner for Synthesizing Reactive Plans, Proc. of AAAI 91 Conf., 1991, pp.640-645
6. Goltz, U., Reisig, W., The Non-sequential Behaviour of Petri Nets, Information and Control, vol.57, no.2-3, May-June 1983, pp.125-147
7. van Glabbeek, R., Vaandrager, F., Petri Net Models for Algebraic Theories of Concurrency, Proc. of PARLE Conference, Eindhoven, 1987, (J. W. de Bakker and A. J. Nijman, Eds.), Springer LNCS 259, pp.224-242
8. Godefroid, P., Wolper, P., Using Partial Orders for Efficient Verification of Deadlock Freedom and Safety Properties, Technical Report., Université de Liège, January 1991
9. Mazurkiewicz, A., Concurrent Program Schemes and Their Interpretation, Technical Report, DAIMI PB-78, Aarhus University, 1977
10. Merlin, P., Faber, D.J., Recoverability of communication protocols, IEEE Trans. Commun., vol. COM-24, no.9, Sept. 1976
11. Petri, C. A., Non-Sequential Processes, GMD, Report ISF-77-05, 1977
12. Penczek, W., Temporal Logics on Trace Systems: On automated verification, Int. Journal of Foundations of Comp. Sc.,vol.4, no.1, 1993, pp.31-67
13. Peled, D., Penczek, W., Using Asynchronous Buchi Automata for Efficient Automatic Verification of Concurrent Systems, Proc. of PSTV'95 Conf. on Protocol Specification, Testing, and Verification, Warsaw, June 1995, pp.305-321
14. Pratt, V., Modelling Concurrency with Partial Orders, International Journal of Parallel Programming, Vol.15, No.1, 1986, pp.33-71
15. Ramchandani, C., Analysis of asynchronous concurrent systems by timed Petri nets, MIT., Project MAC, Tech. Rep. 120, February 1974
16. Winkowski, J., Behaviours of Concurrent Systems, Theoretical Computer Science 12, 1980, pp.39-60
17. Winkowski, J., An Algebraic Description of System Behaviours, Theoretical Computer Science, 21, 1982, pp.315-340
18. Winkowski, J., An Algebra of Time-Consuming Computations, Institute of Computer Science of the Polish Academy of Sciences, Technical Report 722, December 1992, also in Proceedings of the Concurrency Specification and Programming 93 Workshop, Nieborów near Warsaw, Poland, October 1993, pp.258-273
19. Winkowski, J., An Algebraic Description of Processes of Timed Petri Nets, Proc. of 11th International Conference on Analysis and Optimization of Systems, Sophia-Antipolis, June 1994, G. Cohen and J.-P. Quadrat (Eds.), Springer Lecture Notes in Control and Information Sciences 199, 1994, pp.213-219
20. Winkowski, J., Algebras of Processes of Timed Petri Nets, Proc. of CONCUR 94: Concurrency Theory, 5th International Conference, Uppsala, August 1994, B. Jonsson and J. Parrow (Eds.), Springer LNCS 936, 1994, pp.194-209