CONCUR '99. Concurrency theory. 10th international conference, Eindhoven, the Netherlands, August 24--27, 2999. Proceedings (Q1301512)

The articles of mathematical interest will be reviewed individually. For the preceding conference see [Zbl 0895.00051]. Indexed articles: \textit{Esparza, Javier; Römer, Stefan}, An unfolding algorithm for synchronous products of transition systems, 2-20 [Zbl 0946.68097] \textit{Jančar, Petr; Moller, Faron}, Techniques for decidability and undecidability of bisimilarity, 30-45 [Zbl 0940.68087] \textit{de Alfaro, Luca}, Computing minimum and maximum reachability times in probabilistic systems, 66-81 [Zbl 0949.93082] \textit{Alur, Rajeev; de Alfaro, Luca; Henzinger, Thomas A.; Mang, Freddy Y. C.}, Automating modular verification, 82-97 [Zbl 0940.68088] \textit{Attie, Paul C.}, Synthesis of large concurrent programs via pairwise composition, 130-145 [Zbl 0940.68029] \textit{Baier, Christel; Katoen, Joost-Pieter; Hermanns, Holger}, Approximate symbolic model checking of continuous-time Markov chains, 146-161 [Zbl 0934.03044] \textit{Benveniste, Albert; Caillaud, Benoît; Le Guernic, Paul}, From synchrony to asynchrony, 162-177 [Zbl 0939.68079] \textit{Bérard, Béatrice; Fribourg, Laurent}, Reachability analysis of (timed) Petri nets using real arithmetic, 178-193 [Zbl 0939.68080] \textit{Best, Eike; Lavrov, Alexander}, Weak and strong composition of high-level Petri nets, 194-209 [Zbl 0940.68089] \textit{Bieber, Burkhard; Fleischhack, Hans}, Model checking of time Petri nets based on partial order semantics, 210-225 [Zbl 0940.68090] \textit{de Boer, F. S.; Zavattaro, G.}, Generic process algebras for asynchronous communication, 226-241 [Zbl 0940.68091] \textit{Comon, Hubert; Jurski, Yan}, Timed automata and the theory of real numbers, 242-257 [Zbl 0940.68092] \textit{Desharnais, Josée; Gupta, Vineet; Jagadeesan, Radha; Panangaden, Prakash}, Metrics for labeled Markov systems, 258-273 [Zbl 0939.68081] \textit{Estrin, Arkady; Kaminski, Michael}, The expressive power of temporal logic of actions, 274-287 [Zbl 0934.03026] \textit{Fu, Yuxi}, Open bisimulations on chi processes, 304-319 [Zbl 0940.68093] \textit{Henzinger, Thomas A.; Horowitz, Benjamin; Majumdar, Rupak}, Rectangular hybrid games, 320-335 [Zbl 0937.91005] \textit{König, Barbara}, Generating type systems for process graphs, 352-367 [Zbl 0940.68094] \textit{Kučera, Antonín; Mayr, Richard}, Weak bisimilarity with infinite-state systems can be decided in polynomial time, 368-382 [Zbl 0939.68082] \textit{Kupferman, Orna; Vardi, Moshe Y.}, Robust satisfaction, 383-398 [Zbl 0939.68083] \textit{Meseguer, José; Talcott, Carolyn}, A partial order event model for concurrent objects, 415-430 [Zbl 0939.68084] \textit{Minea, Marius}, Partial order reduction for model checking of timed automata, 431-446 [Zbl 0939.68085] \textit{Morin, Rémi; Rozoy, Brigitte}, On the semantics of place/transition nets, 447-462 [Zbl 0940.68095] \textit{Noll, Thomas}, On coherence properties in term rewriting models of concurrency, 478-493 [Zbl 0934.03045] \textit{Nowak, David; Talpin, Jean-Pierre; Le Guernic, Paul}, Synchronous structures, 494-509 [Zbl 0940.68016] \textit{Puhakka, Antti; Valmari, Antti}, Weakest-congruence results for livelock-preserving equivalences, 510-524 [Zbl 0939.68086] \textit{Röckl, Christine; Esparza, Javier}, Proof-checking protocols using bisimulations, 525-540 [Zbl 0940.68128] \textit{Winskel, Glynn}, Event structures as presheaves -- two representation theorems, 541-556 [Zbl 0939.68087] \textit{Yoshida, Nobuko; Hennessy, Matthew}, Subtyping and locality in distributed higher order processes, 557-572 [Zbl 0940.68024]