Series and parallel operations on pomsets

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

Volumn 1738, Issue , 1999, Pages 316-328

  Ésik, Zoltán ^a   Okawa, Satoshi ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITY OF AIZU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; POLYNOMIAL APPROXIMATION; SOFTWARE ENGINEERING;

EQUATIONAL THEORY; FREE ALGEBRA; GRAPH-THEORETIC; ISOMORPHISM CLASS; PARALLEL OPERATIONS; PARTIAL ORDER; POLYNOMIAL-TIME; SERIES-PARALLEL;

ALGEBRA;

EID: 0012785290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46691-6_25     Document Type: Conference Paper

References (22)

1. L. Aceto. Full abstraction for series-parallel pomsets. In: TAPSOFT 91, LNCS 493, 1-25, Springer-Verlag, 1991.
2. Ch. Baier and M. E. Majster-Cederbaum. Denotational semantics in the cpo and metric approach. Theoret. Comput. Sci., 135:171-220, 1994.
3. S. L. Bloom and Z. Esik. Free shuffle algebras in language varieties. Theoret. Comput. Sci., 163:55-98, 1996.
4. S. L. Bloom and Z. Ésik. Shuffle binoids. Theoret. Inform. Appl., 32:175-198, 1998.
5. G. Boudol and I. Castellani. Concurrency and atomicity. Theoret. Comput. Sci., 59:1988, 25-84.
6. B. Bloom and M. Kwiatkowska. Trade-offs in true concurrency: Pomsets and Mazurkiewicz traces. In: MFPS 91, LNCS 598, 350-375, Springer-Verlag, 1992.
7. J. W. de Bakker and J. H. A. Warmerdam. Metric pomset semantics for a concurrent language with recursion. In: Semantics of Systems of Concurrent Processes, LNCS 469, 21-49, Springer-Verlag, 1990.
8. J. L. Gischer. The equational theory of pomsets. Theoret. Comput. Sci., 61:199-224, 1988.
9. J. Grabowski. On partial languages. Fundi. Inform., 4:427-498, 1981.
10. L. Kucera. Combinatorial Algorithms. Adam Hilger, Bristol and Philadelphia, 1990.
11. K. Lodaya and P. Weil. Series-parallel posets: algebra, automata and languages. In: STACS 98, LNCS 1373, 555-565, Springer-Verlag, 1998.
12. A. Mazurkiewicz. Concurrency, modularity and synchronization. In: MFCS 89, LNCS 379, 577-598, Springer-Verlag, 1989.
13. J.-J. Ch. Meyer and E. P. de Vink. Pomset semantics for true concurrency with synchronization and recursion. In: MFCS 89, LNCS 379, 360-369, 1989.
14. V. Pratt. Modeling concurrency with partial orders. Internat. J. Parallel Processing, 15:33-71, 1986.
15. A. Rensink. Algebra and theory of order-deterministic pomsets. Notre Dam J. Formal Logic, 37:283-320, 1996.
16. S. T. Tschantz. Languages under concatenation and shuffling. Math. Structures Comput. Sci., 4:505-511, 1994.
17. J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM Journal of Computing, 11(2):298-313, 1982.
18. Th. Wilke. An Eilenberg theorem for ∞-languages. In: ICALP 91, LNCS 510, 588-599, 1991.
19. H. Wimmel and L. Priese. Algebraic characterization of Petri net pomset semantics. In: CONCUR 97, LNCS 1243, 406-420, Springer-Verlag, 1997.
20. J. Winkowski. Behaviours of concurrent systems. Theoret. Comput. Sci., 12:39-60, 1980.
21. I. Winkowski. Concatenable weighted pomsets and their applications to modelling processes of Petri nets. Fund. Inform., 28:403-421, 1996.
22. G. Winskel. Event structures. In: Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, LNCS 255, 325-392, Springer-Verlag, 1987.