What to do next? Analysing and optimising system behaviour in time

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

[2]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[3]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[4]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[5]  Radu Mateescu,et al.  An overview of CADP 2001 , 2001 .

[6]  Martijn Hendriks,et al.  Model checking timed automata : techniques and applications , 2006 .

[7]  Myron Hlynka,et al.  Queueing Networks and Markov Chains (Modeling and Performance Evaluation With Computer Science Applications) , 2007, Technometrics.

[8]  Y Yuechen Qian,et al.  Data synchronization and browsing for home environments , 2004 .

[9]  Anton Wijs,et al.  Distributed Extended Beam Search for Quantitative Model Checking , 2007, MoChArt.

[10]  Simona Orzan,et al.  Distributed Analysis with mu CRL: A Compendium of Case Studies , 2007, TACAS.

[11]  Lars Michael Kristensen,et al.  A Sweep-Line Method for State Space Exploration , 2001, TACAS.

[12]  N. Yustinova.  Abstractions and Static Analysis for Verifying Reactive Systems , 2004 .

[13]  Yee Wei Law,et al.  Key management and link-layer security of wireless sensor networks : Energy-efficient attack and defense , 2005 .

[14]  Hui Gao,et al.  Design and verification of lock-free parallel algorithms , 2005 .

[15]  Hartmut Peter Benz,et al.  Casual Multimedia Process Annotations -- CoMPAs , 2003 .

[16]  Stefan Edelkamp,et al.  Real-Time Model Checking on Secondary Storage , 2007, MoChArt.

[17]  Frits W. Vaandrager,et al.  Distributing Timed Model Checking - How the Search Order Matters , 2000, CAV.

[18]  I C M Ingrid Flinsenberg,et al.  Route Planning Algorithms for Car Navigation , 2009 .

[19]  B. Fade,et al.  Détermination du parallélisme maximal et optimisation temporelle dans les plans d'actions linéaires , 1991 .

[20]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[21]  A. J. Markvoort.  Towards hybrid molecular simulations , 2006 .

[22]  Arne Skou,et al.  Modelling and analysis of a collision avoidance protocol using Spin and Uppaal , 1996, The Spin Verification System.

[23]  Benjamin W. Wah,et al.  MIDA*: An IDA* Search with Dynamic Control , 1991 .

[24]  Anton Wijs,et al.  From Χt to μCRL : Combining performance and functional analysis , 2004 .

[25]  Tomas Krilavicius,et al.  Hybrid Techniques for Hybrid Systems , 2006 .

[26]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[27]  Jeroen Eggermont,et al.  Data Mining using Genetic Programming : Classification and Symbolic Regression , 2005 .

[28]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[29]  Nikola Trcka,et al.  Verifying chi Models of Industrial Systems with Spin , 2006, ICFEM.

[30]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

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

[32]  Martijn Warnier,et al.  Language based security for Java and JML , 2006 .

[33]  Jacobus E. Rooda,et al.  Syntax and semantics of timed Chi , 2005 .

[34]  Joost-Pieter Katoen,et al.  Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains , 2001, CONCUR.

[35]  Jan Friso Groote,et al.  Verification of a sliding window protocol in μCRL and PVS , 2005, Formal Aspects of Computing.

[36]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[37]  Nikolay Kavaldjiev,et al.  A run-time reconfigurable Network-on-Chip for streaming DSP applications , 2006 .

[38]  Jorge M. S. Valente,et al.  Beam search algorithms for the early/tardy scheduling problem with release dates , 2005 .

[39]  Gerard J. Holzmann,et al.  The SPIN Model Checker , 2003 .

[40]  Jjd Joep Aerts.  Random redundant storage for video on demand , 2003 .

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

[42]  Simona Orzan,et al.  On Distributed Verification and Verified Distribution , 2004 .

[43]  Hans-Dieter Ehrich,et al.  Specification of abstract data types , 1996 .

[44]  Radu Mateescu,et al.  Parallel state space construction for model-checking , 2001, SPIN '01.

[45]  R Ronald Ruimerman,et al.  Modeling and remodeling in bone tissue , 2005 .

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

[47]  Joost Visser,et al.  Generic traversal over typed source code representations , 2003 .

[48]  Ling Cheung,et al.  Reconciling nondeterministic and probabilistic choices , 2006 .

[49]  Eu-Jin Goh,et al.  Searching on Encrypted Data , 2003 .

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

[51]  Sarit Kraus,et al.  KBFS: K-Best-First Search , 2003, Annals of Mathematics and Artificial Intelligence.

[52]  Jan Friso Groote,et al.  Algebraic Process Verification , 2001, Handbook of Process Algebra.

[53]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[54]  Laura Brandán Briones,et al.  Theories for Model-based Testing: Real-time and Coverage , 2007 .

[55]  Cruz Filipe,et al.  Constructive real analysis : a type-theoretical formalization and applications , 2004 .

[56]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[57]  Ka Lok Man,et al.  Formal specification and analysis of hybrid systems , 2006 .

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

[59]  Rance Cleaveland,et al.  TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems , 1998, FORTE.

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

[61]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[62]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[63]  John W. L. Ogilvie,et al.  Heuristics: Intelligent Search Strategies for Com- Puter Problem , 2001 .

[64]  Sarfraz Khurshid,et al.  Exploring very large state spaces using genetic algorithms , 2004, International Journal on Software Tools for Technology Transfer.

[65]  M. T. de Berg,et al.  Multi-functional geometric data structures , 2003 .

[66]  Jorge M. S. Valente,et al.  Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups , 2008, Comput. Oper. Res..

[67]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[68]  Jan A. Bergstra,et al.  Real time process algebra , 1991, Formal Aspects of Computing.

[69]  Atze Dijkstra.  Stepping through Haskell , 2000 .

[70]  Jos C. M. Baeten,et al.  Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination , 2003, EXPRESS.

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

[72]  R. Zann.  The Zebra Finch: A Synthesis of Field and Laboratory Studies , 1996 .

[73]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[74]  Jan Friso Groote,et al.  Verifying a Sliding Window Protocol in µCRL , 2004, AMAST.

[75]  Rob J. van Glabbeek,et al.  What is Branching time semantics and why to use it? , 1994, Bull. EATCS.

[76]  Jos C. M. Baeten,et al.  Analyzing a chi model of a turntable system using Spin, CADP and Uppaal , 2005, J. Log. Algebraic Methods Program..

[77]  C. W. Tate.  Solve it. , 2005, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[78]  Wan Fokkink,et al.  Model checking a cache coherence protocol for a Java DSM implementation , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[79]  Anton Wijs.  Achieving Discrete Relative Timing with Untimed Process Algebra , 2007, 12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007).

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

[81]  M. Kuhl,et al.  SCHEDULING CLUSTER TOOLS USING FILTERED BEAM SEARCH AND RECIPE COMPARISON , 2005 .

[82]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[83]  Stefan Edelkamp,et al.  Parallel External Directed Model Checking with Linear I/O , 2006, VMCAI.

[84]  Ana Sokolova,et al.  Coalgebraic analysis of probabilistic systems , 2005 .

[85]  Vipin Kumar.  Branch-And-Bound Search , 1985 .

[86]  Anton Wijs,et al.  From χt to µCRL: Combining Performance and Functional Analysis , 2005, 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'05).

[87]  Dino Salvo Distefano,et al.  On model checking the dynamics of object-based software : a foundational approach , 2003 .

[88]  C.-B. Breunesse.  On JML: topics in tool-assisted verification of Java programs , 2006 .

[89]  Ruby Lim.  Cannibals and missionaries , 1992, APL '92.

[90]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

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

[92]  Ansgar Fehnker,et al.  Scheduling a steel plant with timed automata , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[93]  A. Steven Klusener,et al.  The Silent Step in Time , 1992, CONCUR.

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

[95]  Federico Della Croce,et al.  A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem , 2002, J. Oper. Res. Soc..

[96]  Michael Weber,et al.  "To Store or Not To Store" Reloaded: Reclaiming Memory on Demand , 2006, FMICS/PDMC.

[97]  G. Rozenberg,et al.  Effective models for the structure of ð-calculus processes with replication , 2001 .

[98]  Juan Visente Guillen Scholten,et al.  Mobile Channels for Exogenous Coordination of Distributed Systems: Semantics, Implementation and Composition , 2007 .

[99]  Roberto Gorrieri,et al.  A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time , 1998, Theor. Comput. Sci..

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

[101]  V Victor Bos,et al.  Automatic verification of a manufacturing system , 2001 .

[102]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[103]  Sebastian Maneth,et al.  Models of tree translation , 2004 .

[104]  Stephen F. Smith,et al.  Viewing scheduling as an opportunistic problem-solving process , 1988 .

[105]  P. P. Chakrabarti,et al.  Heuristic Search in Restricted Memory , 1989, Artif. Intell..

[106]  Michel A. Reniers,et al.  Action abstraction in timed process algebra: the case for an untimed silent step , 2007, FSEN'07.

[107]  Theo C. Ruys,et al.  Experience with Literate Programming in the Modelling and Validation of Systems , 1998, TACAS.

[108]  Ivan Kurtev Ivanov,et al.  Adaptability of model transformations , 2005 .

[109]  S. Kupferschmid,et al.  Adapting an AI Planning Heuristic for Directed Model Checking , 2006, SPIN.

[110]  Jos C. M. Baeten,et al.  A new equivalence for processes with timing. With an application to protocol verification , 2000 .

[111]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[112]  Thomas Wolle,et al.  Computational aspects of treewidth : Lower bounds and network reliability , 2005 .

[113]  EO Esko Dijk.  Indoor ultrasonic position estimation using a single base station , 2004 .

[114]  T. D. Vu,et al.  Semantics and applications of process and program algebra , 2007 .

[115]  G Giovanni Russello,et al.  Separation and adaptation of concerns in a shared data space , 2006 .

[116]  RJ Roy Willemen,et al.  School timetable construction : algorithms and complexity , 2002 .

[117]  Ansgar Fehnker,et al.  Citius, Vilius, Melius : guiding and cost-optimality in model checking of timed and hybrid systems , 2002 .

[118]  Stefan Edelkamp,et al.  Taming Numbers and Durations in the Model Checking Integrated Planning System , 2003, PuK.

[119]  Michael Huth,et al.  Quantitative analysis and model checking , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[120]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[121]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[122]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

[123]  M. Niqui,et al.  Formalising Exact Arithmetic. Representations, Algorithms and Proofs , 2004 .

[124]  Ricardo Corin,et al.  Analysis Models for Security Protocols , 2006 .

[125]  Alex Groce,et al.  Heuristics for model checking Java programs , 2004, International Journal on Software Tools for Technology Transfer.

[126]  Hector Geffner,et al.  Branching Matters: Alternative Branching in Graphplan , 2003, ICAPS.

[127]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

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

[129]  Jan Friso Groote,et al.  Syntax and semantics of CRL , 1995 .

[130]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[131]  Ansgar Fehnker,et al.  Verification and optimization of a PLC control schedule , 2000, International Journal on Software Tools for Technology Transfer.

[132]  N.J.M. van den Nieuwelaar,et al.  Supervisory machine control by predictive-reactive scheduling , 2004 .

[133]  Jurgen Vinju,et al.  Analysis and transformation of source code by parsing and rewriting , 2005 .

[134]  Reinder J. Bril,et al.  Real-time scheduling for media processing using conditionally guaranteed budgets , 2004 .

[135]  Andres Löh,et al.  Exploring generic Haskell , 2004 .

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

[137]  Matthew L. Ginsberg,et al.  Iterative Broadening , 1990, Artif. Intell..

[138]  Jan Friso Groote,et al.  µCRL: A Toolset for Analysing Algebraic Specifications , 2001, CAV.

[139]  Eric A. Hansen,et al.  Beam-Stack Search: Integrating Backtracking with Beam Search , 2005, ICAPS.

[140]  Wan Fokkink,et al.  Rooted Branching Bisimulation as a Congruence , 2000, J. Comput. Syst. Sci..

[141]  Kim G. Larsen,et al.  Optimal scheduling using priced timed automata , 2005, PERV.

[142]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[143]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[144]  H.M.A. van Beek,et al.  Specification and analysis of Internet applications , 2005 .

[145]  Twan Basten,et al.  Branching Bisimilarity is an Equivalence Indeed! , 1996, Inf. Process. Lett..

[146]  Jos C. M. Baeten,et al.  Embedding untimed into timed process algebra: the case for explicit termination , 2003, Mathematical Structures in Computer Science.

[147]  Stefan Leue,et al.  Protocol verification with heuristic search , 2001 .

[148]  Wan Fokkink,et al.  Is Timed Branching Bisimilarity an Equivalence Indeed? , 2005, FORMATS.

[149]  M. Veloso,et al.  Nonlinear Planning with Parallel Resource Allocation , 1990 .

[150]  F. Bartels,et al.  On Generalised Coinduction and Probabilistic Specification Formats , 2004 .

[151]  Peter Verbaan,et al.  The Computational Complexity of Evolving Systems , 2006 .

[152]  F. Alkemade,et al.  Evolutionary agent-based economics , 2004 .

[153]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[154]  Radu Mateescu.  Modélisation et analyse de systèmes asynchrones avec CADP , 2006 .

[155]  Anton Wijs,et al.  Silent steps in transition systems and Markov chains , 2007 .

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

[157]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[158]  Simona Orzan,et al.  Distributed state space minimization , 2004, International Journal on Software Tools for Technology Transfer.

[159]  Ivan Kurtev,et al.  Adaptability of model transformations , 2005 .

[160]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[161]  Wan Fokkink,et al.  Model checking a cache coherence protocol of a Java DSM implementation , 2007, J. Log. Algebraic Methods Program..

[162]  Natalia Sidorova,et al.  Timed Verification with µCRL , 2003, Ershov Memorial Conference.

[163]  AJ Arjan Mooij,et al.  Constructive formal methods and protocol standardization , 2006 .

[164]  Weixiong Zhang.  State-space search - algorithms, complexity, extensions, and applications , 1999 .

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

[166]  Goran Frehse,et al.  Compositional verification of hybrid systems using simulation relations , 2005 .

[167]  Iris Loeb.  Natural Deduction, Sharing By Presentation , 2007 .

[168]  Flavio Lerda,et al.  Distributed-Memory Model Checking with SPIN , 1999, SPIN.

[169]  Cjf Cas Cremers.  Scyther : semantics and verification of security protocols , 2006 .

[170]  Stefan Edelkamp,et al.  Directed explicit-state model checking in the validation of communication protocols , 2004, International Journal on Software Tools for Technology Transfer.

[171]  Maurice H. ter Beek,et al.  Team Automata: A Formal Approach to the Modeling of Collaboration Between System Components , 2003 .

[172]  Kim G. Larsen,et al.  Optimal Conditional Reachability for Multi-priced Timed Automata , 2005, FoSSaCS.

[173]  Mohammad Reza Mousavi,et al.  Structuring structural operational semantics , 2005 .

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

[175]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[176]  Dirk A. van Beek,et al.  Modelling and control of process industry batch production systems , 2002 .

[177]  T. Kuipers,et al.  Techniques for understanding legacy software systems , 2002 .

[178]  A. S. Klusener,et al.  Models and axioms for a fragment of real time process algebra , 1993 .

[179]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[180]  Jeroen Doumen,et al.  Searching in encrypted data , 2004 .

[181]  Holger Hermanns,et al.  On Combining Functional Verification and Performance Evaluation Using CADP , 2002, FME.

[182]  Muhammad Torabi Dashti,et al.  Pruning State Spaces with Extended Beam Search , 2006, ATVA.

[183]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[184]  David M. Nicol,et al.  Distributed State Space Generation of Discrete-State Stochastic Models , 1995, INFORMS J. Comput..

[185]  Maria Eva Magdalena Lijding,et al.  Real-Time Scheduling of Tertiary Storage , 2003 .

[186]  M. A. Valero Espada,et al.  Modal Abstraction and Replication of Processes with Data , 2005 .

[187]  Irek Ulidowski,et al.  Extending Process Languages with Time , 1997, AMAST.

[188]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

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

[190]  Radu Mateescu,et al.  DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation , 2006, TACAS.

[191]  Gerd Behrmann,et al.  Efficient Guiding Towards Cost-Optimality in UPPAAL , 2001, TACAS.

[192]  Gabriele Lenzini,et al.  Integration of Analysis Techniques in Security and Fault-Tolerance , 2005 .

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

[194]  Gerard J. Holzmann,et al.  An Analysis of Bitstate Hashing , 1995, Formal Methods Syst. Des..

[195]  Randy Goebel,et al.  Computational intelligence - a logical approach , 1998 .

[196]  Wan Fokkink,et al.  Formal Verification of Timed Systems Using Cones and Foci , 2005, Electron. Notes Theor. Comput. Sci..

[197]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[198]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[199]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[200]  Yee Wei Law.  Key management and link-layer security of wireless sensor networks: Energy-efficient attack and defense , 2005 .

[201]  J. Ketema,et al.  Bohm-Like Trees for Rewriting , 2006 .

[202]  Vipin Kumar,et al.  General Branch and Bound, and its Relation to A and AO , 1984, Artif. Intell..

[203]  Bahareh Badban,et al.  Verification Techniques for Extensions of Equality Logic , 2006 .

[204]  Olga Tveretina,et al.  A Decision Procedure for Equality Logic with Uninterpreted Functions , 2004, AISC.

[205]  Steven Michael Rubin,et al.  The argos image understanding system. , 1978 .

[206]  Stefan Edelkamp,et al.  Directed explicit model checking with HSF-SPIN , 2001, SPIN '01.

[207]  Arjen van Weelden,et al.  Putting Types To Good Use , 2007 .

[208]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[209]  Somesh Jha,et al.  Partial Order Reductions for Security Protocol Verification , 2000, TACAS.

[210]  Jos C. M. Baeten,et al.  Termination in timed process algebra , 2000 .

[211]  Cheun Ngen Chong.  Experiments in rights control : expression and enforcement , 2005 .

[212]  Erika Ábrahám,et al.  An Assertional Proof System for Multithreaded Java - Theory and Tool Support , 2005 .

[213]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[214]  R. Boumen,et al.  Integration and test plans for complex manufacturing systems , 2007 .

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

[216]  Martijn van Veelen,et al.  Considerations on modeling for early detection of abnormalities in locally autonomous distributed systems , 2007 .

[217]  Jan Friso Groote,et al.  Checking Verifications of Protocols and Distributed Systems by Computer , 1998, CONCUR.

[218]  van de Jaco Pol,et al.  Detecting strongly connected components in large distributed state spaces , 2005 .

[219]  Eelco Dolstra,et al.  The purely functional software deployment model , 2006 .

[220]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

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

[222]  Hojjat Adeli,et al.  Spiking Neural Networks , 2009, Int. J. Neural Syst..

[223]  Jorge M. S. Valente,et al.  Improved heuristics for the early/tardy scheduling problem with no idle time , 2005, Comput. Oper. Res..

[224]  A. Steven Klusener,et al.  Abstraction in Real Time Process Algebra , 1991, REX Workshop.

[225]  Anton Wijs,et al.  Solving scheduling problems by untimed model checking: the clinical chemical analyser case study , 2005, FMICS.

[226]  Bastiaan Heeren,et al.  Top quality type error Messages , 2005 .

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

[228]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[229]  Ka Lok Man,et al.  Syntax and consistent equation semantics of hybrid Chi , 2006, J. Log. Algebraic Methods Program..

[230]  Michel A. Reniers,et al.  Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..

[231]  Marcel Kyas,et al.  Verifying OCL specifications of UML models: tool support and compositionakity , 2006 .

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

[233]  Wpaj Wil Michiels.  Performance ratios for the differencing method , 2004 .

[234]  Theo C. Ruys,et al.  Optimal Scheduling Using Branch and Bound with SPIN 4.0 , 2003, SPIN.