Bisimulation and action refinement

Abramsky, 1989, Causal semantics in process algebra Aceto, 1990, Full abstractions for series-parallel pomsets Aceto, 1989, Towards action-refinement in process algebras, 138 Aceto, 1991, Adding action refinement to a finite process algebra, Vol. 510, 506 Best, 1991, Concurrent bisimulations in Petri nets, Acta Inform., 28, 231, 10.1007/BF01178506 Best, 1988, Nonsequential Processes. A Petri Net View, Vol. 13 Boudol, 1987, On the semantics of concurrency: partial orders and transition systems, Vol. 249, 123 Castellano, 1987, Concurrency vs. interleaving: an instructive example, Bull. EATCS, 31, 12 Darondeau, 1989, Causal trees, Vol. 372, 234 Degano, 1989, Partial orderings descriptions and observations of nondeterministic concurrent processes, Vol. 354, 438 Devillers, 1992, Maximality preserving bisimulation, Theoret. Comput. Sci., 102, 165, 10.1016/0304-3975(92)90298-T Devillers, 1992, Maximality preservation and the ST-idea for action refinement, Vol. 609, 108 Glabbeek, 1990, Comparative concurrency semantics and refinement of actions Glabbeek, 1990, The refinement theorem for ST-bisimulation semantics Glabbeek, 1989, Equivalence notions for concurrent systems and refinement of actions, Vol. 379, 237 Glabbeek, 1990, Refinement of actions in causality based models, Vol. 430, 267 Glabbeek, 1987, Petri net models for algebraic theories of concurrency, Vol. 259, 224 Glabbek, 1991, The difference in splitting into n and n+1 Gorrieri, 1991, The limit of splitn-bisimulations for CCS agents, Vol. 520, 170 Grabowski, 1981, On partial languages, Fund. Inform., IV. 2, 428 Hennessy, 1985, Algebraic laws for nondeterminism and concurrency, J. ACM, 32, 137, 10.1145/2455.2460 Jategaonkar, 1991, Testing equivalence for Petri nets with action refinement Lamport, 1986, On interprocess communication I, Distributed Comp., 1, 77, 10.1007/BF01786227 Milner, 1981, A modal characterization of observable machine-behaviour, Vol. 112, 267 Milner, 1983, Calculi for synchrony and asynchrony, Theoret. Comput. Sci., 25, 267, 10.1016/0304-3975(83)90114-7 Nielsen, 1989, Partial order semantics for concurrency, Vol. 354, 523 Nielsen, 1981, Petri nets, event structures and domains I, Theoret. Comput. Sci., 13, 85, 10.1016/0304-3975(81)90112-2 Park, 1981, Concurrency and automata on infinite sequences, Vol. 104, 167 Pratt, 1986, Modelling concurrency with partial orders, Int. J. Parallel Prog., 15, 33, 10.1007/BF01379149 Rabinovich, 1988, Behaviour structures and nets, Fund. Inform., 11, 357 Vogler, 1991, Failures semantics based on interval semiwords is a congruence for refinement, Distributed Comp., 4, 139, 10.1007/BF01798961 Vogler, 1991, Is partial order semantics necessary for action refinement? Vogler, 1991, Bisimulation and action refinement, Vol. 480, 309