CALIBAN - Esprit Basic Research WG 6067

1. Various authors: Technical Annex of the Esprit Basic Research Working Group No.6067 CALIBAN (1992).

   Google Scholar 

2. R. Assous, V. Bouchitte, C. Charretton, B. Rozoy: Finite Labelling Problem in Event Structures. Theoretical Computer Science 123: 9–19 (1994).

   Article  MATH  MathSciNet  Google Scholar 

3. E. Battiston, O. Botti, E. Crivelli, F. De Cindio: An incremental specification of a Hydroelectric Power Plant Control System using a class of modular algebraic nets. Proc. of Petri Nets’95, Torino, (eds. G.De Michelis, M.Diaz), LNCS, Springer-Verlag (1995).

   Google Scholar 

4. E. Battiston, A. Chizzoni, F. De Cindio: Inheritance and Concurrency in CLOWN. To appear in Proc. of the Workshop on Object-Oriented Programming and Models of Concurrency, Torino (1995).

   Google Scholar 

5. E. Battiston, F. De Cindio, G. Mauri: Specifying concurrent systems with OBJSA Nets. CNR, Progetto Finalizzato Sistemi Informatici e Calcolo Paral-lelo, Technical Report i/4/72 (1992).

   Google Scholar 

6. E. Battiston, V. Crespi, F. De Cindio, G. Mauri: Semantics frameworks for a class of modular algebraic nets. Proc. of AMAST’93, (eds. M. Nivat, C.Rattay, T.Rus, G.Scollo), Workshops in Computing, Springer-Verlag (1993).

   Google Scholar 

7. S. Bauget, P. Gastin: On congruences and partial orders. To appear in MFCS’95, LNCS, Springer-Ver lag (1995).

   Google Scholar 

8. L. Bernardinello: Synthesis of Net Systems. Proc. of Petri Net’93, Chicago, LNCS 691:89-105, Springer-Verlag (1993).

   Google Scholar 

9. L. Bernardinello, G. De Michelis, K. Petruni, S. Vigna: On the Synchronic Structure of Transition Systems. In this volume.

   Google Scholar 

10. L. Bernardinello, G. De Michelis, K. Petruni, S. Vigna: On Synchronic and Enlogic Structure of Transition Systems, DSI Internal Report, University of Milan (1994).

    Google Scholar 

11. E. Best, R. Devillers, J. Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Proc. of STACS’93, LNCS 665:130–140, Springer- Verlag (1993).

    Google Scholar 

12. E. Best, R. Devillers, J. Hall: The Box Calculus: a New Causal Algebra with Multi-label Communication. In Advances in Petri Nets 1992, LNCS 609:21–69, Springer-Verlag (1992).

    Google Scholar 

13. E. Best, J. Esparza: Model checking of persistent Petri nets. Proc. of the Vth Workshop Computer Science Logic-91, LNCS 626:35–52, Springer-Verlag (1992).

    Google Scholar 

14. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, E. Pelz: A Class of Composable High Level Petri Nets. Proc. of Petri Nets’95, Torino, (eds. G.De Michelis, M. Diaz ), LNCS, Springer-Verlag (1995).

    Google Scholar 

15. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, E. Pelz: An M-net Semantics of B(PN)². In this volume.

    Google Scholar 

16. Proc. of PARLE-93, (eds. A. Bode, M. Reeve, G. Wolf), LNCS 694:379–390, Springer-Verlag (1993).

    Google Scholar 

17. E. Best, M. Koutny: A Refined View of the Box Calculus. Proc. of Petri Nets’95, Torino, (eds. G.De Michelis, M.Diaz), LNCS, Springer-Verlag (1995).

    Google Scholar 

18. E. Best, M. Koutny: Solving Recursive Net Equations. Proc. of ICALP’95, Szeged, (ed. F.Gecseg ), LNCS, Springer-Ver lag (1995).

    Google Scholar 

19. E. Best, H.G. Linde-Göers: Compositional Process Semantics of Box Expressions. Presented at the IXth MFPS (Mathematical Foundations of Programming Semantics), New Orleans (1993), LNCS 802:250–270, Springer-Verlag (1994). Extended version: Hildesheimer Informatikbericht 19/93.

    Google Scholar 

20. I. Biermann, B. Rozoy: Context Traces and Transition Systems. ISCIS, Antalya (1994).

    Google Scholar 

21. I. Biermann, B. Rozoy: Graphs for Generalized Traces. In this volume.

    Google Scholar 

22. D. Buchs, O. Biberstein: An Object Oriented Specification Language based on Hierarchical Petri Nets. IVth International IS-CORE WORKSHOP, Amsterdam (1994).

    Google Scholar 

23. D. Buchs, O. Biberstein, N. Guelfi: COOPN2: an object oriented specification language for distributed system development. Submitted article.

    Google Scholar 

24. D. Buchs, N. Guelfi: Formal development of Actor programs using structured algebraic Petri nets. Proc. of PARLE’93, (eds. A. Bode, M. Reeve, G. Wolf), LNCS 694:379–390, Springer-Verlag (1993).

    Google Scholar 

25. A. Cheng, J. Esparza, J. Palsberg: Complexity Results for 1-safe Petri Nets. To appear in Theoretical Computer Science.

    Google Scholar 

26. A. Chizzoni: CLOWN: CLass Orientation With Nets. Master Degree Thesis, Dept. of Comp. Sei., Univ. of Milan (1994).

    Google Scholar 

27. J.M. Colom, M. Silva: Improving the linearly based characterization of P/T nets. In Advances in Petri Nets 1990, LNCS 483:113–145, Springer-Verlag (1991).

    Google Scholar 

28. J. Desel: A proof of the Rank Theorem for extended free choice nets. Proc. of Petri Nets’92, Sheffield, (ed. K.Jensen), LNCS 616:134–153, Springer-Verlag (1992).

    Google Scholar 

29. J. Desel: Regular Marked Petri Nets. Proc. of Graph-Theoretic Concepts in Computer Science (WG’93), Utrecht, (ed. Jan van Leeuwen), LNCS 790:276- 287, Springer-Verlag (1994).

    Google Scholar 

30. J. Desel, J. Esparza: Shortest paths in reachability graphs. Proc. of Petri Nets’93, Chicago, (ed. M. Ajmone Marsan), LNCS 691:224–241, Springer-Verlag ( 1993 ). To appear in: Journal of Computer and System Science (1995).

    Google Scholar 

31. J. Desel, J. Esparza: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science 40, Cambridge University Press (1995).

    Google Scholar 

32. J. Desel, M.D. Radola: Proving non-reachability by modulo-place-invariants. Proc. of the XlVth Conference on the Foundations of Software Technology and Theoretical Computer Science, Madras, (ed. P. S.Thiagarajan), LNCS 880:366–377, Springer-Verlag (1994). Also to appear in Theoretical Computer Science (1995).

    Google Scholar 

33. J. Desel, W. Reisig: The Synthesis Problem of Petri Nets. Proc. of STACS’93, (eds. P.Enjalbert, A.Finkel, K.W.Wagne), LNCS 665:120-129, Springer-Verlag (1993).

    Google Scholar 

34. R. Devillers: Tree Interfaces in the Petri Box Calculus. TR-LIT-265, Université Libre de Bruxelles (1992).

    Google Scholar 

35. R. Devillers: Construction of S-invariants and S-components for Refined Petri Boxes. Proc. of Petri Nets’93, Chicago, LNCS 691, Springer-Verlag (1993).

    Google Scholar 

36. R. Devillers: S-invariant Analysis of Petri Boxes. TR-LIT-273, Université Libre de Bruxelles (1993).

    Google Scholar 

37. R. Devillers: Towards a General Relabelling Operator for the Petri Box Calculus. TR-LIT-274, Université Libre de Bruxelles (1993).

    Google Scholar 

38. R. Devillers: On a more Liberal Synchronisation Operator for the Petri Box Calculus. TR-LIT-281, Université Libre de Bruxelles (1993).

    Google Scholar 

39. R. Devillers: Modelling Petri Boxes are not too infinite. Submitted article (1993).

    Google Scholar 

40. R. Devillers: Analysis of General Refined Petri Boxes. Proc. of the Xlllth International Conference of the Chilean Society of Computer Science (La Serena, Chile), 419–434 (1993). Also in Computer Science 2: Research and Applications (Plenum Publishing), 411–428 (1994).

    Google Scholar 

41. R. Devillers: The Synchronisation Operator Revisited for the Petri Box Calculus TR-LIT-290, Université Libre de Bruxelles (1994).

    Google Scholar 

42. R. Devillers: S-invariant Analysis of General Refined Petri Boxes. TR-LIT-293, Université Libre de Bruxelles (1994).

    Google Scholar 

43. R. Devillers: S-invariant Analysis of General Recursive Petri Boxes. TR-LIT-294, Université Libre de Bruxelles (1994). To appear in Acta Informatica (1994 or 1995 ).

    Google Scholar 

44. R. Devillers and H. Klaudel: Refinement and Recursion in a High Level Petri Box Calculus. In this volume.

    Google Scholar 

45. V. Diekert, P. Gastin, A. Petit: Rational and Recognizable complex trace languages. To appear in Information and Computation.

    Google Scholar 

46. V. Diekert, G. Rozenberg (eds.): Book on Traces, World Academic Publishing, Singapore 1995.

    Google Scholar 

47. A. Ehrenfeucht, T. Harju, G. Rozenberg: Invariants of dynamic labelled 2-structures. Submitted article.

    Google Scholar 

48. A. Ehrenfeucht, G. Rozenberg: An introduction to dynamic labelled 2-structures. Proc. of MFCS’93, LNCS 711:156–173, Springer-Verlag (1993).

    Google Scholar 

49. A. Ehrenfeucht, G. Rozenberg: Dynamic labeled 2-structures. Mathematical Structures of Computer Science 4: 433–455 (1995).

    Article  MathSciNet  Google Scholar 

50. A. Ehrenfeucht, G. Rozenberg: Dynamic labeled 2-structures with variable domains. LNCS 812:97–123, Springer-Verlag (1993).

    Google Scholar 

51. A. Ehrenfeucht, G. Rozenberg: Partial (Set) 2-Structures - Part 1: Basic Notions and the Representation Problem. Acta Informatica 26: 315–342 (1990).

    Google Scholar 

52. A. Ehrenfeucht, G. Rozenberg: Partial (Set) 2-Structures - Part 2: State Spaces of Concurrent Systems. Acta Informatica 26: 343–368 (1990).

    Google Scholar 

53. J. Engelfriet: A multiset semantics for the π-calculus with replication. Proc. of CONCUR’93, LNCS 715:7–21, Springer-Verlag (1993).

    Google Scholar 

54. J. Engelfriet: A multisets semantics for the π-calculus with replication. RUL Report 194–26.

    Google Scholar 

55. J. Engelfriet, Tj. Gelsema: Multisets and structural congruence of the π-calculus with replication. RUL Report 195–02.

    Google Scholar 

56. J. Esparza: Model Checking based on Branching Processes. Habilitation, Hildesheim (1993). Published as: J. Esparza: Model Checking Using Net Unfoldings. Proc. of TAPSOFT’93 (1993), (eds. M.C. Gaudel, J.P. Jouannaud), LNCS 668:613–628, Springer-Verlag (1993). Also in Science of Computer Programming 23:151–195 (1994).

    Google Scholar 

57. J. Esparza, G. Bruns: Trapping Mutual Exclusion in the Box Calculus. To appear in Theoretical Computer Science (1995).

    Google Scholar 

58. J. Ezpeleta, J.M. Colom, J. Martinez: A Petri Net Based Deadlock Prevention Policy for Flexible Manufacturing Systems. IEEE Trans. Robotics and Automation 11, 2: 173–184 (1995).

    Article  Google Scholar 

59. W. Frçczak: Synchronization Algebra and Multi-actions. LRI-TR 896, Université Paris Sud, Orsay (1994).

    Google Scholar 

60. W. Fraczak, H. Klaudel: General Synchronization Operator in the Petri-Box Calculus. LRI-TR 821, Université Paris Sud, Orsay (1993).

    Google Scholar 

61. W. Fraczak, H. Klaudel: A Multi-Action Synchronization Schema and its Application to the PBC. ESDA’94, ASME, Methodologies, techniques, and tools for design development, London (1994).

    Google Scholar 

62. P. Gastin, A. Petit, W. Zielonka: An extension of Kleene’s and Ochmanski’s theorems to infinite traces. Theoretical Computer Science 125: 167–204 (1994).

    Article  MATH  MathSciNet  Google Scholar 

63. P. Gastin, B. Rozoy: The PoSet of Infinite Traces. Theoretical Computer Science 120: 101–121 (1993).

    Article  MATH  MathSciNet  Google Scholar 

64. U. Goltz, R. Gorrieri, A. Rensink: On syntactic and semantic action refinement. In Theoretical Aspects of Computer Software, (eds. M. Hagiya, J. C. Mitchell), LNCS 789:385–404. Springer-Verlag (1994). Full report version: Hildesheimer Informatik-Berichte 17/92, Institut für Informatik, Universität Hildesheim.

    Google Scholar 

65. U. Gorni: Sviluppo ed integrazione di strumenti di supporto alla verifica di proprietà’ su reti modulari di alto livello. Master Degree Thesis. Dept. of Comp. Sci., Univ. of Milan (1994).

    Google Scholar 

66. B. Graves: Implementation of a Model Checking Algorithm Based on Partial Order Semantics. In Algorithmen und Werkzeuge für Petrinetze, (eds. J. Desel, A. Oberwies, W. Reisig), Workshop der Gl-Fachgruppe 0.01 “Petrinetze und verwandte Systemmodelle”, Bericht 309 Universität Karlsruhe, Berlin (1994).

    Google Scholar 

67. N. Guelfi: Les réseaux Algébriques Hiérarchiques: un formalisme de spécifications structurées pour le développement de systèmes concurrents. Ph.D. Thesis, Laboratoire de recherche en Informatique (LRI), Université Paris Sud, Orsay (1994).

    Google Scholar 

68. P.W. Hoogers: Behavioural aspects of Petri nets. Ph.D. Thesis, Leiden University (1994).

    Google Scholar 

69. P.W. Hoogers, H.C.M. Kleijn, P.S. Thiagarajan: Local event structures and Petri nets. Proc. of CONCUR’93, LNCS 715:462–476, Springer-Verlag (1993).

    Google Scholar 

70. P.W. Hoogers, H.C.M. Kleijn, P.S. Thiagarajan: An event structure semantics for general Petri nets. RUL Report 193–13 (revised version of 192–22) (1993). Accepted by Theoretical Computer Science.

    Google Scholar 

71. R.P. Hopkins: Recursion and Refinement for a Generalisation of the Petri Box Calculus. Technical Report TR–440, Dept. of Comp. Sci., University of Newcastle upon Tyne (1993).

    Google Scholar 

72. R.P. Hopkins: Formalising Refinement and Composition of Concurrent Soft-ware. Draft paper.

    Google Scholar 

73. M. Huhn, H. Wehrheim: On Refining Logical Specifications. Hildesheimer Informatik-Bericht, University of Hildesheim 1995. In preparation.

    Google Scholar 

74. R. Janicki, M. Koutny: Representations of Discrete Interval Orders and Semi-Orders. TR-9302, Department of Comp. Sci. and Systems, McMaster University (1993).

    Google Scholar 

75. Also: TR–425, Dept. of Comp. Sci., University of Newcastle upon Tyne (1993).

    Google Scholar 

76. R. Janicki, M. Koutny: Deriving Histories of Nets with Priority Relation. Proc. of PARLE’94, LNCS, Springer-Verlag (1994).

    Google Scholar 

77. R. Janicki. M. Koutny: Semantics of Inhibitor Nets. TR-9401, Dept. of Comp. Sci. and Systems, McMaster University (1994).

    Google Scholar 

78. R. Janicki, M. Koutny: Fundamentals of Modelling Concurrency Using Discrete Relational Structures. TR-9402, Dept. of Comp. Sci. and Systems, McMaster University (1994).

    Google Scholar 

79. H. Klaudel: Traitement de Donnés dans l’Algèbre des Petri-Boxes. Rapport de stage de DEA, LRI, Université Paris Sud, Orsay (1992).

    Google Scholar 

80. H. Klaudel, E. Pelz: Communication as Unification in the Petri Box Calculus, To appear in FCT’95, Dresden, August 1995, LNCS, Springer-Verlag. Full version in LRI-TR 967, Université Paris Sud, Orsay (1995).

    Google Scholar 

81. M. Koutny: Syntactic Derivation of Petri Boxes. Memo, Newcastle upon Tyne (1994).

    Google Scholar 

82. M. Koutny: Partial Order Semantics of Box Expressions. Proc. of Petri Nets’94, Zaragoza, LNCS, Springer-Verlag (1994).

    Google Scholar 

83. M. Koutny, J. Esparza, E. Best: Operational Semantics for the Petri Box Calculus. Proc. of CONCUR’94, LNCS, Springer-Verlag (1994). Long version: Hildesheimer Informatik-Berichte 13 /93 (1993).

    Google Scholar 

84. M. Koutny, M. Pietkiewicz-Koutny: On the Sleep Sets Method for Partial Order Verification of Concurrent Systems. Technical Report, Dept. of Comp. Sci., Newcastle upon Tyne (1994).

    Google Scholar 

85. J. Lilius: On the Structure of High-level Nets. Doctoral Dissertation, Helsinki University of Technology, Dept. of Comp. Sei. (1995). Also as Technical Re-port A30, Helsinki University of Technology, Digital Systems Laboratory, Espoo (1995).

    Google Scholar 

86. H.G. Linde-Göers: Process and Branching Process Semantics of Box Expres-sions. Ph.D. Thesis (1993).

    Google Scholar 

87. K. Lodaya, R. Ramanujam, P. S. Thiagarajan: Temporal logics for communi-cating sequential agents: I. International Journal of Foundations of Computer Science 3 (2): 117–159 (1992).

    Article  MATH  MathSciNet  Google Scholar 

88. A. Mazurkiewicz: Basic notions of trace theory. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (eds. J. W. de Bakker, W.-P. de Roever, G. Rozenberg), LNCS 354:285–363, Springer-Verlag (1989).

    Google Scholar 

89. R. Milner, J. Parrow, D. Walker: A calculus of mobile processes, I. Information and Computation 100: 1–40 (1992).

    Article  MATH  MathSciNet  Google Scholar 

90. M. Mukund: Petri Nets and Step Transition Systems. Int. Journal of Foundations of Computer Science 3. 4 (1992).

    MathSciNet  Google Scholar 

91. P. Niebert: A μ-calculus with local views for systems of sequential agents. To be presented at MFCS’95, LNCS, Springer-Verlag (1995).

    Google Scholar 

92. P. Niebert, W. Penczek: On the Connection of Partial Order Logics and Partial Order Reduction Methods. Technical University Eindhoven. Technical Report (1994).

    Google Scholar 

93. M. Nielsen, G.D. Plotkin, G. Winskel: Petri nets, event structures and domains, part 1. Theoretical Computer Science 13: 85–108 (1981).

    Article  MATH  MathSciNet  Google Scholar 

94. M. Nielsen, G. Rozenberg, P. S. Thiagarajan: Elementary Transition Systems. Theoretical Computer Science 96 /1 (1992).

    Google Scholar 

95. D. Peled: All from one and one from all: on model checking using representatives. Proc. of the International Workshop on Computer Aided Verification CAV, LNCS 409–423, Springer-Verlag (1993).

    Google Scholar 

96. P. Racloz: Analyse des Reseaux Algebriques a l’aide de la logique temporelle. Ph.D. Thesis, CUI, Geneve, Suisse, 1994. Also in P. Racloz, D.Buchs, Symbolic Proof of CTL Formulae over Petri Nets, Proc. of the VHIth ISCIS (eds. Gun Levent, Onvural Raif, Gelembe Erol) 189–196 (1993).

    Google Scholar 

97. L. Recalde, E. Teruel, M. Silva: On Well-formedness Analysis: The Case of Deterministic Systems of Sequential Process. In this volume.

    Google Scholar 

98. W. Reisig: Deterministic buffer synchronization of sequential processes. Acta Informatica 18: 117–134 (1982).

    Article  MATH  MathSciNet  Google Scholar 

99. W. Reisig: Petri Nets and Algebraic Specifications. Theoretical Computer Science 80: 1–34 (1991).

    Article  MATH  MathSciNet  Google Scholar 

100. A. Rensink: Methodological aspects of action refinement. In Programming Concepts, Methods and Calculi, IFIP, North-Holland Publishing Company (1994).

     Google Scholar 

101. A. Rensink: An event-based SOS for a language with refinement. In this volume.

     Google Scholar 

102. St. Römer: Implementierung der Branching-Box-Algebra. Master Degree Thesis, Hildesheim (1993).

     Google Scholar 

103. B. Rozoy: The Distributed monoid, a Model for Parallelism, Elsevier. Book to appear.

     Google Scholar 

104. B. Rozoy: On the Star Problem in trace monoids, Automata and Models for Concurrency. Dagstuhl (1993).

     Google Scholar 

105. M. Silva: Interleaving Functional and Performance Structural Analysis of Net Models. Proc. of Petri Nets’93, Chicago, LNCS 691:17–23, Springer-Verlag (1993).

     Google Scholar 

106. M. Silva, E. Teruel: Analysis of Autonomous Petri Nets with Bulk Services and Arrivals. In Procs. of the Xlth Int. Conf. on Analysis and Optimization of Systems. Discrete Event Systems, Lecture Notes in Control and Information Sciences 199:131–143, Springer-Verlag (1994).

     Google Scholar 

107. Y. Souissi, N. Beldiceanu: Deterministic systems of sequential processes: Theory and tools. In Concurrency 88, LNCS 335:380–400, Springer-Verlag (1988).

     Google Scholar 

108. E. Teruel: Structure Theory of Weighted Place/Transition Net Systems: The Equal Conflict Hiatus. Dissertation, DIEI. Univ. Zaragoza (1994).

     Google Scholar 

109. E. Teruel, P. Chrzastowski-Wachtel, J.M. Colom, M. Silva: On weighted T-systems. Proc. of Petri Nets’92, Sheffield, LNCS 616:348–367, Springer-Verlag (1992).

     Google Scholar 

110. E. Teruel, J.M. Colom, M. Silva: Linear Analysis of Deadlock-Freeness of Petri Net Models. Proc. of the Ilth European Control Conference 93, Groningen, 2:513–518, North Holland (1993).

     Google Scholar 

111. E. Teruel, J.M. Colom, M. Silva: Modelling and Analysis of Deterministic Concurrent Systems with Bulk Services and Arrivals. In Decentralized and Distributed Systems, IFIP Transactions A-39:213–224, Elsevier (1994).

     Google Scholar 

112. E. Teruel, M. Silva: Liveness and Home States in Equal Conflict Systems. Proc. of Petri Nets’93, Chicago, LNCS 691:415–432, Springer-Verlag (1993).

     Google Scholar 

113. E. Teruel, M. Silva: Well-formedness of Equal Conflict Systems. Proc. of Petri Nets’94, Zaragoza, LNCS 815:491–510, Springer-Verlag (1994).

     Google Scholar 

114. E. Teruel, M. Silva: Structure Theory of Equal Conflict Systems. To appear in Theoretical Computer Science (1995).

     Google Scholar 

115. E. Teruel, M. Silva, J.M. Colom, J. Campos: Functional and Performance Analysis of Cooperating Sequential Processes. Procs. of the Xlth Int. Conf. on Analysis and Optimization of Systems. Discrete Event Systems. Lecture Notes in Control and Information Sciences 199:169–175, Springer-Verlag (1994).

     Google Scholar 

116. P.S. Thiagarajan: A trace based extension of Linear Time Temporal Logic. Proc. of the IXth annual IEEE symposium on Logic in Computer Science (LICS) (1994).

     Google Scholar 

117. Th. Thielke: Modelchecking als Komponente der petrinetzbasierten Entwicklungs- und Programmierumgebung PEP. In Algorithmen und Werkzeuge für Petrinetze, (eds. J. Desel, A. Oberweis, W. Reisig), Workshop der GI-Fachgruppe 0.01 “Petrinetze und verwandte Systemmodelle”, Bericht 309 Universität Karlsruhe, Berlin (1994).

     Google Scholar 

118. J. Vautherin: Parallel systems specification with colored Petri nets and algebraic specification. LNCS 266, Springer-Verlag (1987).

     Google Scholar 

Download references