Linearization in muCRL

• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

[1]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[2]  Tac Tim Willemse.  Semantics and verification in process algebras with data and timing , 2003 .

[3]  M. B. van der Zwaag,et al.  Models and logics for process algebra , 2002 .

[4]  Jan A. Bergstra,et al.  Discrete Time Process Algebra and the Semantics of SDL , 1998, Handbook of Process Algebra.

[5]  V Victor Bos,et al.  Formal specification and analysis of industrial systems , 2002 .

[6]  Jun Pang,et al.  Analysis of a Security Protocol in µCRL , 2002, ICFEM.

[7]  Sjouke Mauw,et al.  A process specification formalism , 1990 .

[8]  V. A. Kostenko,et al.  Towards a unified toolset for embedded systems development , 2000 .

[9]  G Georgina Fabian,et al.  A language and simulator for hybrid systems , 1999 .

[10]  Jozef Hooman,et al.  Formal verification of replication on a distributed data space architecture , 2002, SAC '02.

[11]  Faron Moller,et al.  Decidability Results in Automata and Process Theory , 1996, Banff Higher Order Workshop.

[12]  Daniel R. Tauritz,et al.  Adaptive Information Filtering: Concepts and Algorithms , 2002 .

[13]  Jan Friso Groote,et al.  The Syntax and Semantics of μCRL , 1995 .

[14]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[15]  Yong Sun.  An Algebraic Generalization of Frege Structures-Binding Algebras , 1999, Theor. Comput. Sci..

[16]  Bengt Jonsson,et al.  Probabilistic Process Algebra , 2001 .

[17]  Yaroslav Usenko.  Linearization of ?CRL specifications , 2002 .

[18]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

[19]  Jan A. Bergstra,et al.  Process Algebra with Iteration and Nesting , 1994, Comput. J..

[20]  J. F. Groote,et al.  Undecidability and completeness results for process algebras with alternative quantification over data , 1998 .

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

[22]  Areski Nait Abdallah,et al.  The Logic of Partial Information , 1995, Monographs in Theoretical Computer Science An EATCS Series.

[23]  Wan Fokkink,et al.  Refinement and Verification Applied to an In-Flight Data Acquisition Unit , 2002, CONCUR.

[24]  Vianey Villamizar.  An Introduction to the Calculus , 1926, Nature.

[25]  Peter Achten,et al.  Interactive functional programs: models, methods, and implementation , 1996 .

[26]  J. Wessels,et al.  Faculty of Mathematics and Computing Science , 1988 .

[27]  Academisch Proefschrift,et al.  Persistence in Algebraic Specifications , 2001 .

[28]  S. P. Luttik.  Choice quantification in process algebra , 2002 .

[29]  J. Verriet.  Scheduling with communication for multiprocessor computation , 1998 .

[30]  Hubert Garavel,et al.  Compilation et vérification de programmes LOTOS , 1989 .

[31]  Søren Christensen.  Decidability and decomposition in process algebras , 1993 .

[32]  J. C. Pol.  A Prover for the muCRL toolset with applications -- version 0.1 , 2001 .

[33]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[34]  Colin Stirling,et al.  Modal and Temporal Properties of Processes , 2001, Texts in Computer Science.

[35]  D. Bosnacki.  Enhancing state space reduction techniques for model checking , 2001 .

[36]  Stephan Merz,et al.  Model Checking , 2000 .

[37]  Alban Ponse,et al.  Translating a process algebra with symbolic data values to linear format , 1995 .

[38]  Jan Friso Groote,et al.  Computer assisted manipulation of algebraic process specifications , 2002, SIGP.

[39]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[40]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[41]  Jan Friso Groote,et al.  Analysis of a distributed system for lifting trucks , 2003, J. Log. Algebraic Methods Program..

[42]  Jan Friso Groote,et al.  Verification of Temporal Properties of Processes in a Setting with Data , 1998, AMAST.

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

[44]  Cj Roel Bloo,et al.  Preservation of termination for explicit substitution , 1997 .

[45]  Marieke Huisman,et al.  Reasoning about Java programs in higher order logic using PVS and Isabelle , 2001 .

[46]  Hans Mulder,et al.  Regularity of BPA-Systems is Decidable , 1994, CONCUR.

[47]  J. F. Groote.  The Syntax and Semantics of timed μ CRL , 1997 .

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

[49]  M.H.G. Kesseler,et al.  The implementation of functional languages on parallel machines with distributed memory , 1996 .

[50]  Mihaela Sighireanu,et al.  Efficient on-the-fly model-checking for regular alternation-free mu-calculus , 2003, Sci. Comput. Program..

[51]  Judi Maria Tirza Romijn,et al.  Analysing Industrial Protocols with Formal Methods , 1999 .

[52]  D Dmitri Chkliaev,et al.  Mechanical verification of concurrency control and recovery protocols , 2001 .

[53]  Bruno Courcelle,et al.  Recursive Applicative Program Schemes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[54]  G Goce Naumoski,et al.  A discrete-event simulator for systems engineering , 1998 .

[55]  F.A.M. van den Beuken,et al.  A functional approach to syntax and typing , 1997 .

[56]  R. V. Glabbeek.  The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[57]  Mariëlle Stoelinga,et al.  Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .

[58]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[59]  J. F. Groote,et al.  Specification and implementation of components of a μCRL toolbox , 1995 .

[60]  Stefan Blom,et al.  Term Graph Rewriting. Syntax and semantics , 2001 .

[61]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[62]  Yaroslav S. Usenko.  State space generation for the HAVi leader election protocol , 2002, Sci. Comput. Program..

[63]  Leon Moonen,et al.  Exploring software systems , 2003, International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings..

[64]  Jan Friso Groote,et al.  Proof Theory for µCRL: A Language for Processes with Data , 1993, Semantics of Specification Languages.

[65]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

[66]  Jaco van de Pol,et al.  State Space Reduction by Proving Confluence , 2002, CAV.

[67]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

[69]  Jan Friso Groote,et al.  Completeness of Timed μCRL , 2002 .

[70]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[71]  David B. Benson,et al.  Algebraic Solutions to Recursion Schemes , 1987, J. Comput. Syst. Sci..

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

[73]  Jan Friso Groote,et al.  Linearization in parallel pCRL , 2000, J. Log. Algebraic Methods Program..

[74]  Izak van Langevelde,et al.  On the Verification of Coordination , 2000, COORDINATION.

[75]  J. J. van Wamel,et al.  Verification Techniques for Elementary Data Types and Retransmission Protocols , 1995 .

[76]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[77]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[78]  Jan Friso Groote,et al.  Focus points and convergent process operators: a proof strategy for protocol verification , 2001, J. Log. Algebraic Methods Program..

[79]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[80]  Kees Middelburg,et al.  Variable binding operators in transition system specifications , 2000, J. Log. Algebraic Methods Program..

[81]  Jan Friso Groote,et al.  Analysis of three hybrid systems in timed µCRL , 2001, Sci. Comput. Program..

[82]  Jan Friso Groote,et al.  Invariants in Process Algebra with Data , 1993, CONCUR.

[83]  Pedro R. D'Argenio,et al.  Algebras and Automata for Timed and Stochastic Systems , 1999 .

[84]  Jan Friso Groote,et al.  Confluence for Process Verification , 1995, Theor. Comput. Sci..

[85]  Jaco van de Pol.  JITty: A Rewriter with Strategy Annotations , 2002, RTA.

[86]  Alban Ponse,et al.  Equivalence of recursive specifications in process algebra , 2001, Inf. Process. Lett..

[87]  A. G. Engels,et al.  Languages for analysis and testing of event sequences , 2001 .

[88]  Anna Ingólfsdóttir,et al.  A Symbolic Approach to Value-Passing Processes , 2001, Handbook of Process Algebra.

[89]  Jan Friso Groote,et al.  The parallel composition of uniform processes with data , 2001, Theor. Comput. Sci..

[90]  Rance Cleaveland,et al.  Priority in Process Algebra , 2001, Handbook of Process Algebra.

[91]  R. S. Venema,et al.  Aspects of an integrated neural prediction system , 1999 .

[92]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[93]  Sheila A. Greibach,et al.  A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[94]  James J. Horning,et al.  The algebraic specification of abstract data types , 1978, Acta Informatica.

[95]  Arno Wouters.  Manual for the $ mu CRL $ tool set (version 2.8.2) , 2001 .

[96]  J.J.H. Fey,et al.  Design of a fruit juice blending and packaging plant , 2000 .

[97]  Isabelle Reymen,et al.  Improving Design Processes through Structured Reflection: Feedback , 2001 .

[98]  Joseph Sifakis,et al.  Compilation and verification of LOTOS specifications , 1990, PSTV.

[99]  Ulrich Ultes-Nitsche,et al.  Linearization of -CRL specifications. Extended abstract , 2002 .

[100]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[101]  Eelco Visser,et al.  Stratego: A Language for Program Transformation Based on Rewriting Strategies , 2001, RTA.

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

[103]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[104]  Thomas Arts,et al.  Correct performance of transaction capabilities , 2001, Proceedings Second International Conference on Application of Concurrency to System Design.

[105]  Michael W. Shields.  Hybrid Transition Systems , 1997 .

[106]  Nwa Norbert Arends,et al.  A systems engineering specification formalism , 1996 .

[107]  M. Oostdijk.  Generation and presentation of formal mathematical documents , 2001 .

[108]  Mark van der Zwaag,et al.  The cones and foci proof technique for timed transition systems , 2001, Inf. Process. Lett..

[109]  Jacob Brunekreef.  Process Specification in a UNITY Format , 1995 .