Volume 18, 1998
Brno, Czech Republic, 27-29 August 1998
- Faron Moller: A Taxonomy of Infinite State Processes. 3-22
- Olaf Burkart: Queues as Processes. 23
- Gabriel Ciobanu, Mihai Rotaru: Faithful pi-nets - A graphical representation of the asynchronous pi-calculus . 24-45
- Stefan Haar: Branching Processes of general S/T-Systems and their properties. 65-74
- Daniel Hirschkoff: Automatically Proving Up-to Bisimulation. 75-89
- Gabriel Juhás: The essence of Petri nets and transition systems through Abelian groups. 90-111
- Johan Lilius: Efficient State Space Search for Time Petri Nets. 113-133
- Richard Mayr: Strict Lower Bounds for Model Checking BPA. 147-158
- Markus Müller-Olm: Derivation of Characteristic Formulae. 159-170
- Pawel Paczkowski: Towards characterizing bisimilarity of value-passing processes with context-free control. 171-178
- Jitka Stríbrná: Hardness results for weak bisimilarity of simple process algebras. 179-190
- Igor V. Tarasyuk: Place bisimulation equivalences for design of concurrent and sequential systems. 191-206
- Irina Virbitskaite: On Semantics of Concurrency and Nondeterminism: Bisimulations and Temporal Logics. 207-222
- Ulrich Ultes-Nitsche: Towards the Construction of an Abstract State-Space from a Partial-Order Representation of the Concrete One. 223-239
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team