Some of My Favourite Results in Classic Process

2003, Luca Aceto.BRICS, Department of Computer ScienceUniversity of Aarhus. All rights reserved.Reproduction of all or part of this workis permitted for educational or research useon condition that this copyright notice isincluded in any copy.See back inner page for a list of recent BRICS Notes Series publications.Copies may be obtained by contacting:BRICSDepartment of Computer ScienceUniversity of AarhusNy Munkegade, building 540DK–8000 Aarhus CDenmarkTelephone:+45 8942 3360Telefax: +45 8942 3255Internet: BRICS@brics.dkBRICS publications are in general accessible through the World WideWeb and anonymous FTP through these URLs:http://www.brics.dkftp://ftp.brics.dkThis document in subdirectory NS/03/2/

[1]  Luca Aceto,et al.  Termination, deadlock, and divergence , 1992, JACM.

[2]  Colin Stirling,et al.  Decidability of DPDA equivalence , 2001, Theor. Comput. Sci..

[3]  Rob J. van Glabbeek,et al.  A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours , 1993, MFCS.

[4]  Géraud Sénizergues,et al.  L(A) = L(B)? Decidability Results from Complete Formal Systems , 2002, ICALP.

[5]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[6]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[7]  Alexander Moshe Rabinovich.  A Complete Axiomatisation for Trace Congruence of Finite State Behaviors , 1993, MFPS.

[8]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[9]  Joachim Parrow.  The expressive power of parallelism , 1990, Future Gener. Comput. Syst..

[10]  Rob van Glabbeeky.  On the Expressiveness of Acp , 1994 .

[11]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[12]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[13]  Rocco De Nicola,et al.  A finite axiomatization of nondeterministic regular expressions , 1999, RAIRO Theor. Informatics Appl..

[14]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[15]  Richard Mayr,et al.  Process rewrite systems , 1999, EXPRESS.

[16]  Hans Zantema,et al.  Basic Process Algebra with Iteration: Completeness of its Equational Axioms , 1993, Comput. J..

[17]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[18]  D. J. Walker,et al.  Bisimulation and Divergence , 1990, Inf. Comput..

[19]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[20]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[21]  Tiziana Margaria,et al.  Distinguishing formulas for free , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[22]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[23]  Mark Jerrum,et al.  Bisimulation Equivanlence Is Decidable for Normed Process Algebra , 1999 .

[24]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[25]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[26]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[27]  Z. Ésik,et al.  Iteration Theories: The Equational Logic of Iterative Processes , 1993 .

[28]  Steven T. Tschantz.  Languages under Concatenation and Shuffling , 1994, Math. Struct. Comput. Sci..

[29]  Frits W. Vaandrager,et al.  Expressive Results for Process Algebras , 1992, REX Workshop.

[30]  Colin Stirling,et al.  Deciding DPDA Equivalence Is Primitive Recursive , 2002, ICALP.

[31]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

[32]  Faron Moller,et al.  The nonexistence of finite axiomatisations for CCS congruences , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[33]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[34]  Jirí Srba,et al.  Roadmap of Infinite Results , 2002, Bull. EATCS.

[35]  Luca Aceto,et al.  An Equational Axiomatization for Multi-Exit Iteration , 1996 .

[36]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[37]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[38]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[39]  Jan A. Bergstra,et al.  The Algebra of Recursively Defined Processes and the Algebra of Regular Processes , 1984, ICALP.

[40]  Faron Moller,et al.  Infinite Results , 1996, CONCUR.

[41]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[42]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[43]  Nancy A. Lynch,et al.  Action transducers and timed automata , 1992, Formal Aspects of Computing.

[44]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[45]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

[46]  Paul Auster.  The New York Trilogy , 1985 .

[47]  Luca Aceto,et al.  A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces , 1998, Mathematical Structures in Computer Science.

[48]  Christos H. Papadimitriou.  Database metatheory: asking the big queries , 1995, PODS '95.

[49]  W. Vogler,et al.  Preliminary Proceedings of the 3rd International Workshop on Models for Time-Critical Systems , 2002 .

[50]  Faron Moller,et al.  A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, Theor. Comput. Sci..

[51]  Luca Aceto,et al.  A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours , 1995, Theor. Comput. Sci..

[52]  Peter Sewell,et al.  Nonaxiomatisability of Equivalences over Finite State Processes , 1997, Ann. Pure Appl. Log..

[53]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[54]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[55]  Rocco De Nicola,et al.  Nondeterministic regular expressions as solutions of equational systems , 2003, Theor. Comput. Sci..

[56]  Wan Fokkink,et al.  On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces , 2003, ICALP.

[57]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[58]  D.J.B. Bosscher,et al.  Grammars modulo bisimulation , 1997 .

[59]  J. Conway.  Regular algebra and finite machines , 1971 .

[60]  Luca Aceto,et al.  Nested Semantics over Finite Trees are Equationally Hard: Invited Talk , 2003, EXPRESS.

[61]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

[62]  Colin Stirling,et al.  Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..

[63]  Ralph McKenzie,et al.  Tarski's Finite Basis Problem is Undecidable , 1996, Int. J. Algebra Comput..

[64]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[65]  P. Cousot,et al.  Preliminary Proceedings of the Workshop on Geometry and Topology in Concurrency Theory GETCO ’ 01 Aalborg , Denmark , August 25 , 2001 , 2001 .

[66]  Jan A. Bergstra,et al.  A complete inference system for rgular processes with silent moves , 1984 .

[67]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[68]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[69]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[70]  Luca Aceto.  On "Axiomatising Finite Concurrent Processes" , 1994, SIAM J. Comput..

[71]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

[72]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

[73]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[74]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[75]  Henri Korver,et al.  Computing Distinguishing Formulas for Branching Bisimulation , 1991, CAV.

[76]  Jan A. Bergstra,et al.  Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..

[77]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[78]  Luca Aceto,et al.  The max-plus algebra of the natural numbers has no finite equational basis , 1999, Theor. Comput. Sci..

[79]  Faron Moller.  The Importance of the Left Merge Operator in Process Algebras , 1990, ICALP.

[80]  F. S.,et al.  A Mathematician's Apology , 1941, Nature.

[81]  Ilaria Castellani,et al.  Concurrency and Atomicity , 1988, Theor. Comput. Sci..

[82]  Rocco De Nicola,et al.  An Equational Axiomatization of Bisimulation over Regular Expressions , 2002, J. Log. Comput..

[83]  Wan Fokkink,et al.  On the Completeness of the Euations for the Kleene Star in Bisimulation , 1995, AMAST.

[84]  Luca Aceto,et al.  On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers , 1999, STACS.