Clocks, Dice and Processes

[1]  R. Lyndon.  Identities in two-valued calculi , 1951 .

[2]  G. Arfken.  Mathematical Methods for Physicists , 1967 .

[3]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[4]  Gordon D. Plotkin.  The lambda-Calculus is omega-Incomplete , 1974, J. Symb. Log..

[5]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[6]  Leon Henkin,et al.  The Logic of Equality , 1977 .

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

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

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10]  L. E. Clarke,et al.  Probability and Measure , 1980 .

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

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

[13]  Stephen D. Brookes,et al.  Possible futures, acceptances, refusals, and communicating processes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  J. Bergstra,et al.  Fixed point semantics in process algebras : (preprint) , 1982 .

[15]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[16]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[17]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

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

[19]  Mark H. A. Davis.  Piecewise‐Deterministic Markov Processes: A General Class of Non‐Diffusion Stochastic Models , 1984 .

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

[21]  S. Lenhart,et al.  Integro-differential equations associated with optimal stopping time of a piecewise-deterministic process , 1985 .

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

[23]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[24]  Jan A. Bergstra,et al.  Put and get, primitives for synchronous unreliable message passing , 1985 .

[25]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[26]  Jan Heering,et al.  Partial evaluation and w-completeness of algebraic specifications , 1985 .

[27]  Ed Brinksma,et al.  A tutorial on LOTOS , 1985, PSTV.

[28]  J Heering,et al.  Partial Evaluation and omega-Completeness of Algebraic Specifications , 1986, Theor. Comput. Sci..

[29]  A. P. Sistla,et al.  Automatic verification of finite-state concurrent systems using temporal logic specifications , 1986, TOPL.

[30]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[31]  Iain Phillips,et al.  Refusal Testing , 1986, Theoretical Computer Science.

[32]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[33]  R. McKenzie,et al.  Algebras, Lattices, Varieties , 1988 .

[34]  Rance Cleaveland,et al.  Priorities in process algebras , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

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

[36]  M. H. A. Davis,et al.  Approximations for optimal stopping of a piecewise-deterministic process , 1988, Math. Control. Signals Syst..

[37]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

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

[39]  Robin Milner,et al.  A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

[40]  Faron Moller,et al.  Axioms for concurrency , 1989 .

[41]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[42]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

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

[44]  J. Baeten.  Applications of process algebra , 1990 .

[45]  R. Gurevic.  Equational Theory of Positive Numbers with Exponentiation is Not Finitely Axiomatizable , 1990, Ann. Pure Appl. Log..

[46]  AZEDDINE LAZREK,et al.  Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness , 1990, Inf. Comput..

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

[48]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

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

[50]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

[52]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[53]  Jan Friso Groote.  A New Strategy for Proving omega-Completeness applied to Process Algebra , 1990, CONCUR.

[54]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[55]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[56]  C. Corduneanu,et al.  Integral equations and applications , 1991 .

[57]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, JACM.

[58]  Rajeev Alur,et al.  Verifying Automata Specifications of Probabilistic Real-time Systems , 1991, REX Workshop.

[59]  Rajeev Alur,et al.  Model-Checking for Probabilistic Real-Time Systems (Extended Abstract) , 1991, ICALP.

[60]  Sjouke Mauw,et al.  PSF : a process specification formalism , 1991 .

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

[62]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[63]  Walter Vogler,et al.  Modular Construction and Partial Order Semantics of Petri Nets , 1992, Lecture Notes in Computer Science.

[64]  Grzegorz Rozenberg,et al.  Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings , 1992 .

[65]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[66]  Mihalis Yannakakis,et al.  Minimum and maximum delay problems in real-time systems , 1991, Formal Methods Syst. Des..

[67]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[68]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

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

[70]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[71]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

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

[73]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[74]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

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

[76]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[77]  Rance Cleaveland,et al.  Priority and abstraction in process algebra , 1994, Inf. Comput..

[78]  Kim G. Larsen,et al.  From Timed Automata to Logic - and Back , 1995, MFCS.

[79]  Bard Bloom,et al.  On the Expressive Power of CCS , 1995, FSTTCS.

[80]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[81]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[82]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[83]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[84]  Huimin Lin.  PAM: A process algebra manipulator , 1995, Formal Methods Syst. Des..

[85]  Kim Guldstrand Larsen,et al.  From Timed Automata to Logic - and Back , 1995 .

[86]  Mark H. Davis.  Markov Models and Optimization , 1995 .

[87]  Glynn Winskel,et al.  CCS with Priority Choice , 1995, Inf. Comput..

[88]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

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

[90]  Sergio Yovine,et al.  Model Checking Timed Automata , 1996, European Educational Forum: School on Embedded Systems.

[91]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

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

[93]  Ahmed Bouajjani,et al.  Model-Checking for Extended Timed Temporal Logics , 1996, FTRTFT.

[94]  G. Arfken,et al.  Mathematical methods for physicists 6th ed. , 1996 .

[95]  Rance Cleaveland,et al.  Priorities for Modeling and Verifying Distributed Systems , 1996, TACAS.

[96]  Rob J. van Glabbeek.  Notes on the Methodology of CCS and CSP , 1997, Theor. Comput. Sci..

[97]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[98]  Wang Yi,et al.  Time-abstracted Bisimulation: Implicit Specifications and Decidability , 1997, Inf. Comput..

[99]  Thomas A. Henzinger,et al.  Real-time system = discrete system + clock variables , 1994, International Journal on Software Tools for Technology Transfer.

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

[101]  Abbas Edalat,et al.  Bisimulation for labelled Markov processes , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[102]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[103]  Thomas A. Henzinger,et al.  It's About Time: Real-Time Logics Reviewed , 1998, CONCUR.

[104]  Paul Gastin,et al.  Characterization of the Expressive Power of Silent Transitions in Timed Automata , 1998, Fundam. Informaticae.

[105]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

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

[107]  R. Ash,et al.  Probability and measure theory , 1999 .

[108]  R. Segala,et al.  Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.

[109]  Rajeev Alur,et al.  Timed Automata , 1999, CAV.

[110]  S. P. Luttik,et al.  An ω-Complete Equational Specification of Interleaving ? Extended Abstract , 2000 .

[111]  Bas Luttik,et al.  An omega-Complete Equational Specification of Interleaving , 2000, ICALP.

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

[113]  Marta Z. Kwiatkowska,et al.  Verifying Quantitative Properties of Continuous Probabilistic Timed Automata , 2000, CONCUR.

[114]  Christel Baier,et al.  Deciding Bisimilarity and Similarity for Probabilistic Processes , 2000, J. Comput. Syst. Sci..

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

[116]  J. Bergstra,et al.  Mode transfer in process algebra , 2000 .

[117]  Boudewijn R. Haverkort,et al.  Markovian Models for Performance and Dependability Evaluation , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[118]  Davide Sangiorgi,et al.  Controlling interference in ambients , 2000, POPL '00.

[119]  A. L. de Groot,et al.  Practical Automaton proofs in PVS , 2000 .

[120]  Robert K. Brayton,et al.  Model-checking continuous-time Markov chains , 2000, TOCL.

[121]  Structural Operational Semantics , 2001, Handbook of Process Algebra.

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

[123]  Algebraic Process Verification , 2001, Handbook of Process Algebra.

[124]  Prakash Panangaden,et al.  Measure and probability for concurrency theorists , 2001, Theor. Comput. Sci..

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

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

[127]  Marc Voorhoeve,et al.  Impossible futures and determinism , 2001, Inf. Process. Lett..

[128]  B J Linney,et al.  What to do next? , 2001, BMJ : British Medical Journal.

[129]  Stavros Tripakis,et al.  Analysis of Timed Systems Using Time-Abstracting Bisimulations , 2001, Formal Methods Syst. Des..

[130]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[131]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

[132]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

[133]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[134]  V. Voevodsky.  Cancellation theorem , 2002, math/0202012.

[135]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[136]  Klaus Denecke,et al.  Universal Algebra and Applications in Theoretical Computer Science , 2018 .

[137]  Luca Aceto,et al.  Some of My Favourite Results in Classic Process , 2003 .

[138]  Marta Z. Kwiatkowska,et al.  Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol , 2003, Formal Aspects of Computing.

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

[140]  Christel Baier,et al.  Model-Checking Algorithms for , 2003 .

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

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

[143]  Martin Bravenboer,et al.  Exercises in Free Syntax. Syntax Definition, Parsing, and Assimilation of Language Conglomerates , 2003 .

[144]  William H. Sanders,et al.  Optimal state-space lumping in Markov chains , 2003, Inf. Process. Lett..

[145]  Andrea Maggiolo-Schettini,et al.  Weak bisimulation for probabilistic timed automata and applications to security , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..

[146]  Danièle Beauquier.  On probabilistic timed automata , 2003, Theor. Comput. Sci..

[147]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[148]  T. van der Storm.  Component-based configuration, integration and delivery , 2003 .

[149]  T. van der Storm.  Component-based configuration, integration and delivery , 2003 .

[150]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[151]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

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

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

[154]  Jan Friso Groote,et al.  Process Algebra Needs Proof Methodology (Columns: Concurrency) , 2004, Bull. EATCS.

[155]  Christel Baier,et al.  Validation of Stochastic Systems , 2004, Lecture Notes in Computer Science.

[156]  Rajeev Alur,et al.  Decision Problems for Timed Automata: A Survey , 2004, SFM.

[157]  Wan Fokkink,et al.  On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds , 2004, FoSSaCS.

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

[159]  Gordon D. Plotkin,et al.  The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[160]  M. T. de Berg,et al.  Algorithms for Fat Objects: Decompositions and Applications , 2004 .

[161]  Jeremy Sproston,et al.  Model Checking for Probabilistic Timed Systems , 2004, Validation of Stochastic Systems.

[162]  A Adam Koprowski,et al.  Termination of rewriting and its certification , 2004 .

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

[164]  Patricia Bouyer,et al.  Forward Analysis of Updatable Timed Automata , 2004, Formal Methods Syst. Des..

[165]  Christel Baier,et al.  Validation of Stochastic Systems: A Guide to Current Research (Lecture Notes in Computer Science) , 2004 .

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

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

[168]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

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

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

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

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

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

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

[175]  Magiel Bruntink,et al.  Renovation of idiomatic crosscutting concerns in embedded systems , 2005 .

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

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

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

[179]  Patricia Bouyer,et al.  On Conciseness of Extensions of Timed Automata , 2005, J. Autom. Lang. Comb..

[180]  Wan Fokkink,et al.  A Finite Basis for Failure Semantics , 2005, ICALP.

[181]  P. Zoeteweij,et al.  Composing constraint solvers , 2005 .

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

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

[184]  Bas Luttik,et al.  CCS with Hennessy's merge has no finite-equational axiomatization , 2005, Theor. Comput. Sci..

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

[186]  Jos C. M. Baeten,et al.  A brief history of process algebra , 2005, Theor. Comput. Sci..

[187]  N. Yamada,et al.  Perron ’ s Method for Viscosity Solutions Associated with Piecewise-Deterministic Processes , 2005 .

[188]  Joost-Pieter Katoen,et al.  A Markov reward model checker , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[189]  Marta Z. Kwiatkowska,et al.  Stochastic Transition Systems for Continuous State Spaces and Non-determinism , 2005, FoSSaCS.

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

[191]  Gao.  Design and verification of lock-free parallel algorithms , 2005 .

[192]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

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

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

[195]  Wan Fokkink,et al.  On Finite Alphabets and Infinite Bases III: Simulation , 2006, CONCUR.

[196]  Expressivity of Timed Automata Models , 2006 .

[197]  Siegfried Nijssen.  Mining Structured Data , 2006 .

[198]  Peter Bro Miltersen,et al.  2 The Task of a Numerical Analyst , 2022 .

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

[200]  Marc Voorhoeve,et al.  Liveness, Fairness and Impossible Futures , 2006, CONCUR.

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

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

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

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

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

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

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

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

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

[210]  B. Gebremichael-Tesfagiorgis,et al.  Expressivity of Timed Automata Models , 2006 .

[211]  Bas Luttik,et al.  What is algebraic in process theory? , 2006, APC 25.

[212]  Luca Aceto,et al.  Bisimilarity is not finitely based over BPA with interrupt , 2006, Theor. Comput. Sci..

[213]  M. Kyas.  Verifying OCL Specifications of UML models , 2006 .

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

[215]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

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

[217]  Joost-Pieter Katoen,et al.  Probably on Time and within BudgetOn Reachability in Priced Probabilistic Timed Automata , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[218]  van Lcm Louis Gool.  Formalising interface specifications , 2006 .

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

[220]  Luca Aceto,et al.  On the Axiomatizability of Priority , 2006, ICALP.

[221]  Wan Fokkink,et al.  On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation , 2006, FoSSaCS.

[222]  Rajeev Alur,et al.  Bounded Model Checking for GSMP Models of Stochastic Real-Time Systems , 2006, HSCC.

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

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

[225]  Marta Z. Kwiatkowska,et al.  Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..

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

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

[228]  Dmitri Jarnikov,et al.  QoS framework for video streaming in home networks , 2007 .

[229]  Rajeev Alur,et al.  Symbolic Analysis for GSMP Models with One Stateful Clock , 2007, HSCC.

[230]  de Hayco Jong.  Flexible heterogeneous software systems , 2007 .

[231]  Christel Baier,et al.  Probabilistic and Topological Semantics for Timed Automata , 2007, FSTTCS.

[232]  Jeremy Sproston,et al.  State explosion in almost-sure probabilistic reachability , 2007, Inf. Process. Lett..

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

[234]  Marcin Jurdzinski,et al.  Model Checking Probabilistic Timed Automata with One or Two Clocks , 2007, Log. Methods Comput. Sci..

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

[236]  David de Frutos-Escrig,et al.  Simulations Up-to and Canonical Preorders: (Extended Abstract) , 2007, SOS@LICS/ICALP.

[237]  Luca Aceto,et al.  Reactive Systems: Modelling, Specification and Verification , 2007 .

[238]  Cfj Christian Lange,et al.  Assessing and improving the quality of modeling : a series of empirical studies about the UML , 2007 .

[239]  Jaco van de Pol,et al.  Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems , 2007, CONCUR.

[240]  Wan Fokkink.  Modelling Distributed Systems (Texts in Theoretical Computer Science. An EATCS Series) , 2007 .

[241]  Christel Baier,et al.  Model Checking Markov Chains with Actions and State Labels , 2007, IEEE Transactions on Software Engineering.

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

[243]  Joost Noppen,et al.  Imperfect Information in Software Design Processes , 2007 .

[244]  Fair testing , 2007, Inf. Comput..

[245]  Bastiaan Stephan Graaf,et al.  Model-Driven Evolution of Software Architectures , 2007, 11th European Conference on Software Maintenance and Reengineering (CSMR'07).

[246]  Wan Fokkink,et al.  Modelling Distributed Systems , 2010, Texts in Theoretical Computer Science. An EATCS Series.

[247]  Luca Aceto,et al.  Ready to Preorder: Get Your BCCSP Axiomatization for Free! , 2007, CALCO.

[248]  Alberto Bemporad,et al.  Hybrid Systems: Computation and Control, 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007, Proceedings , 2007, HSCC.

[249]  W. Fokkink,et al.  Ready To Preorder: Get Your BCCSP Axiomatization for Free! , 2007 .

[250]  Anton Wijs,et al.  What to do next? Analysing and optimising system behaviour in time , 2007 .

[251]  Luca Aceto,et al.  The Saga of the Axiomatization of Parallel Composition , 2007, CONCUR.

[252]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[253]  Nancy A. Lynch,et al.  Trace-Based Semantics for Probabilistic Timed I/O Automata , 2007, HSCC.

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

[255]  Mohammad Ali Abam.  New data structures and algorithms for mobile data , 2007 .

[256]  Jasen Markovski,et al.  Real and stochastic time in process algebras for performance evaluation , 2008 .

[257]  Bas Luttik,et al.  On finite alphabets and infinite bases , 2008, Inf. Comput..

[258]  David de Frutos-Escrig,et al.  Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences , 2008, Electron. Notes Theor. Comput. Sci..

[259]  Ileana Buhan,et al.  Cryptographic keys from noisy data, theory and applications , 2008 .

[260]  Wan Fokkink,et al.  On the Axiomatizability of Impossible Futures: Preorder versus Equivalence , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[261]  Stephan Merz,et al.  Modeling and verification of real-time systems : formalisms and software tools , 2008 .

[262]  Christel Baier,et al.  Principles of model checking , 2008 .

[263]  Luca Aceto,et al.  On the expressibility of priority , 2008, Inf. Process. Lett..

[264]  Gürcan Gülesir,et al.  Evolvable Behavior Specifications Using Context-Sensitive Wildcards , 2008 .

[265]  Yanjing Wang,et al.  PDL over Accelerated Labeled Transition Systems , 2008, 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering.

[266]  Joël Ouaknine,et al.  Some Recent Results in Metric Temporal Logic , 2008, FORMATS.

[267]  Wolter Pieters,et al.  La volonté machinale: understanding the electronic voting controversy , 2008 .

[268]  Flavio D. Garcia.  Formal and Computational Cryptography: Protocols, Hashes and Commitments , 2008 .

[269]  Joost-Pieter Katoen.  Quantitative Evaluation in Embedded System Design: Trends in Modeling and Analysis Techniques , 2008, 2008 Design, Automation and Test in Europe.

[270]  Model Checking Probabilistic Timed Automata with One or Two Clocks , 2008, 0809.0060.

[271]  Joost-Pieter Katoen,et al.  Perspectives in Probabilistic Verification , 2008, 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering.

[272]  E Elena Mumford,et al.  Drawing graphs for cartographic applications , 2008 .

[273]  Joost-Pieter Katoen,et al.  Time-Abstracting Bisimulation for Probabilistic Timed Automata , 2008, 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering.

[274]  M. G. van der Horst,et al.  Scalable block processing algorithms , 2008 .

[275]  Luca Aceto,et al.  A Cancellation Theorem for BCCSP , 2007, Fundam. Informaticae.

[276]  de Ism Ivo Jong.  Integration and test strategies for complex manufacturing machines , 2008 .

[277]  Aad Mathssen,et al.  Logical Calculi for Reasoning with Binding , 2008 .

[278]  Robert Brijder,et al.  Models of natural computation : gene assembly and membrane systems , 2008 .

[279]  U Uzma Khadim,et al.  Process algebras for hybrid systems : comparison and development , 2008 .

[280]  Stephan Merz,et al.  Modeling and Verification of Real-time Systems , 2008 .

[281]  Ncwm Niels Braspenning.  Model-based integration and testing of high-tech multi-disciplinary systems , 2008 .

[282]  Luca Aceto,et al.  On the axiomatisability of priority , 2008, Mathematical Structures in Computer Science.

[283]  Helmut Veith,et al.  25 Years of Model Checking - History, Achievements, Perspectives , 2008, 25 Years of Model Checking.

[284]  Pascal Durr,et al.  Resource-based Verification for Robust Composition of Aspects , 2008 .

[285]  D. Graaf,et al.  Mining semi-structured data, theoretical and experimental aspects of pattern evaluation , 2008 .

[286]  Wan Fokkink,et al.  Ready to preorder: The case of weak process semantics , 2008, Inf. Process. Lett..

[287]  Harmen Kastenberg.  Graph-based software specification and verification , 2008 .

[288]  RH Rudolf Mak,et al.  Design and performance analysis of data-independent stream processing systems , 2008 .

[289]  Nathalie Bertrand,et al.  Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[290]  Iain Phillips,et al.  CCS with priority guards , 2001, J. Log. Algebraic Methods Program..

[291]  Marius Adrian Marin,et al.  An Integrated System to Manage Crosscutting Concerns in Source Code , 2008 .

[292]  M. Torabi Dashti,et al.  Keeping Fairness Alive : Design and formal verification of optimistic fair exchange protocols , 2008 .

[293]  Christel Baier,et al.  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[294]  EM Elena Bortnik,et al.  Formal methods in support of SMC design , 2008 .

[295]  Jens R. Calamé,et al.  Testing reactive systems with data: enumerative methods and constraint solving , 2008 .

[296]  Hasan Sözer,et al.  Architecting Fault-Tolerant Software Systems , 2009 .

[297]  Hugo Jonker,et al.  Security matters : privacy in voting and fairness in digital exchange , 2009 .

[298]  M. J. de Mol,et al.  Reasoning about functional programs : Sparkle, a proof assistant for Clean , 2009 .

[299]  van Mj Muck Weerdenburg,et al.  Efficient rewriting techniques , 2009 .

[300]  Damiano Bolzoni,et al.  Revisiting Anomaly-based Network Intrusion Detection Systems , 2009 .

[301]  van Mpwj Michiel Osch.  Automated model-based testing of hybrid systems , 2009 .

[302]  Patricia Bouyer,et al.  Model-checking Timed Temporal Logics , 2009, M4M.

[303]  A. Rodriguez Yakushev,et al.  Towards Getting Generic Programming Ready for Prime Time , 2009 .

[304]  Mohammed G. Khatib.  MEMS-Based Storage Devices : Integration in Energy-Constrained Mobile Systems , 2009 .

[305]  Ali Mesbah,et al.  Analysis and Testing of Ajax-based Single-page Web Applications , 2009 .

[306]  Ali Mesbah,et al.  Analysis and Testing of Ajax-based Single-page Web Applications , 2009 .

[307]  Jasper Berendsen,et al.  Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata , 2009, TAMC.

[308]  Sebastiaan Gijsbert Marinus Cornelissen,et al.  Evaluating Dynamic Analysis Techniques for Program Comprehension , 2009 .

[309]  Bas Luttik,et al.  A finite equational base for CCS with left merge and communication merge , 2009, TOCL.

[310]  Karina R. Olmos Joffré.  Strategies for Context Sensitive Program Transformation , 2009 .

[311]  Joost-Pieter Katoen,et al.  LTL Model Checking of Time-Inhomogeneous Markov Chains , 2009, ATVA.

[312]  H. Hansen.  Coalgebraic Modelling : Applications in Automata theory and Modal logic , 2009 .

[313]  Serge Haddad,et al.  Model Checking Timed and Stochastic Properties with CSL^{TA} , 2009, IEEE Transactions on Software Engineering.

[314]  David de Frutos-Escrig,et al.  Ready to preorder: an algebraic and general proof , 2009, J. Log. Algebraic Methods Program..

[315]  Marcel Verhoef,et al.  Modeling and validating distributed embedded real-time control systems , 2009 .

[316]  Joost-Pieter Katoen,et al.  Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[317]  J. van den Berg,et al.  Reasoning about Java programs in PVS using JML , 2009 .

[318]  Wan Fokkink,et al.  On Finite Bases for Weak Semantics: Failures Versus Impossible Futures , 2009, SOFSEM.

[319]  David de Frutos-Escrig,et al.  (Bi)simulations up-to characterise process semantics , 2009, Inf. Comput..

[320]  Marcin Czenko,et al.  TuLiP : reshaping trust management , 2009 .

[321]  Patricia Bouyer,et al.  Model Checking Timed Automata , 2010 .

[322]  Luca Aceto,et al.  Lifting non-finite axiomatizability results to extensions of process algebras , 2010, Acta Informatica.

[323]  Marta Kwiatkowska,et al.  Verification of Real‐Time Probabilistic Systems , 2010 .