Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Luca Aceto
2010 – today
- 2013
[j74]Luca Aceto, Monika Henzinger, Jiri Sgall: 38th International Colloquium on Automata, Languages and Programming. Inf. Comput. 222: 1 (2013)
[j73]Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino: On the specification of modal systems: A comparison of three frameworks. Sci. Comput. Program. 78(12): 2468-2487 (2013)
[c53]Luca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: Exploiting Algebraic Laws to Improve Mechanized Axiomatizations. CALCO 2013: 36-50
[c52]Luca Aceto, Anna Ingólfsdóttir, Cristian Prisacariu, Joshua Sack: Compositional Reasoning for Multi-modal Logics. LFCS 2013: 1-15
[c51]Luca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir: SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators. SOFSEM 2013: 108-120
[i3]Luca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir: Meta SOS - A Maude Based SOS Meta-Theory Framework. CoRR abs/1307.7446 (2013)- 2012
[j72]Luca Aceto, Anna Ingólfsdóttir, Paul Blain Levy, Joshua Sack: Characteristic formulae for fixed-point semantics: a general framework. Mathematical Structures in Computer Science 22(2): 125-173 (2012)
[j71]Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir: Proving the validity of equations in GSOS languages using rule-matching bisimilarity. Mathematical Structures in Computer Science 22(2): 291-331 (2012)
[j70]Luca Aceto, Arnar Birgisson, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: Rule formats for determinism and idempotence. Sci. Comput. Program. 77(7-8): 889-907 (2012)
[j69]Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: Rule formats for distributivity. Theor. Comput. Sci. 458: 1-28 (2012)
[c50]Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir: Algebraic Synchronization Trees and Processes. ICALP (2) 2012: 30-41
[c49]Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir: The Equational Theory of Weak Complete Simulation Semantics over BCCSP. SOFSEM 2012: 141-152
[c48]Luca Aceto, Anna Ingólfsdóttir: Characteristic Formulae for Relations with Nested Fixed Points. FICS 2012: 15-22- 2011
[j68]
[j67]Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir: Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet. Inf. Process. Lett. 111(9): 408-413 (2011)
[j66]Luca Aceto, Taolue Chen, Anna Ingólfsdóttir, Bas Luttik, Jaco van de Pol: On the axiomatizability of priority II. Theor. Comput. Sci. 412(28): 3035-3044 (2011)
[j65]Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: SOS rule formats for zero and unit elements. Theor. Comput. Sci. 412(28): 3045-3071 (2011)
[c47]Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac, Anna Ingólfsdóttir: PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates. CALCO 2011: 378-385
[c46]Luca Aceto, Arnar Birgisson, Anna Ingólfsdóttir, Mohammad Reza Mousavi: Decompositional Reasoning about the History of Parallel Processes. FSEN 2011: 32-47
[c45]Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino: Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations. FSEN 2011: 268-283
[c44]Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir: Axiomatizing Weak Ready Simulation Semantics over BCCSP. ICTAC 2011: 7-24
[c43]Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: Rule Formats for Distributivity. LATA 2011: 80-91
[c42]Luca Aceto, Wiebe van der Hoek, Anna Ingólfsdóttir, Joshua Sack: Sigma algebras in probabilistic epistemic dynamics. TARK 2011: 191-199
[c41]Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Arni Hermann Reynisson, Steinar Hugi Sigurdarson, Marjan Sirjani: Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca. FOCLASA 2011: 1-19
[c40]Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac, Anna Ingólfsdóttir: Axiomatizing GSOS with Predicates. SOS 2011: 1-15
[c39]Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino: Graphical representation of covariant-contravariant modal formulae. EXPRESS 2011: 1-15
[e7]Luca Aceto, Monika Henzinger, Jiri Sgall (Eds.): Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I. Lecture Notes in Computer Science 6755, Springer 2011, ISBN 978-3-642-22005-0
[e6]Luca Aceto, Monika Henzinger, Jiri Sgall (Eds.): Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II. Lecture Notes in Computer Science 6756, Springer 2011, ISBN 978-3-642-22011-1
[e5]Luca Aceto, Mohammad Reza Mousavi (Eds.): Proceedings First International Workshop on Process Algebra and Coordination. EPTCS 60, 2011- 2010
[j64]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi: Lifting non-finite axiomatizability results to extensions of process algebras. Acta Inf. 47(3): 147-177 (2010)
[j63]Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: On Rule Formats for Zero and Unit Elements. Electr. Notes Theor. Comput. Sci. 265: 145-160 (2010)
[j62]Luca Aceto, Anna Ingólfsdóttir, Joshua Sack: Resource bisimilarity and graded bisimilarity coincide. Inf. Process. Lett. 111(2): 68-76 (2010)
[c38]Luca Aceto, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: A Rule Format for Unit Elements. SOFSEM 2010: 141-152
[e4]Luca Aceto, Pawel Sobocinski (Eds.): Proceedings Seventh Workshop on Structural Operational Semantics. EPTCS 32, 2010
2000 – 2009
- 2009
[j61]Luca Aceto, Anna Ingólfsdóttir: Algebraic Properties for Free! Bulletin of the EATCS 99: 82-103 (2009)
[j60]Luca Aceto, Cecilia Magherini: On the relations between B2V Ms and Runge-Kutta collocation methods. J. Computational Applied Mathematics 231(1): 11-23 (2009)
[j59]Luca Aceto, Jos C. M. Baeten, Wan Fokkink, Anna Ingólfsdóttir, Uwe Nestmann: Preface. J. Log. Algebr. Program. 78(4) (2009)
[j58]Luca Aceto, Anna Ingólfsdóttir: Foreword: special issue in memory of Nadia Busi. Mathematical Structures in Computer Science 19(6): 1061-1063 (2009)
[j57]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: A finite equational base for CCS with left merge and communication merge. ACM Trans. Comput. Log. 10(1) (2009)
[c37]Luca Aceto, Arnar Birgisson, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers: Rule Formats for Determinism and Idempotence. FSEN 2009: 146-161
[c36]Luca Aceto, Anna Ingólfsdóttir, Kim Guldstrand Larsen, Jirí Srba: Teaching Concurrency: Theory in Practice. TFM 2009: 158-175
[c35]Luca Aceto, Anna Ingólfsdóttir, Joshua Sack: Characteristic Formulae for Fixed-Point Semantics: A General Framework. EXPRESS 2009: 1-15
[c34]Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir: A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages. SOS 2009: 1-16- 2008
[j56]Luca Aceto, Jos C. M. Baeten, Wan Fokkink, Anna Ingólfsdóttir, Uwe Nestmann: Applying Concurrency Research in Industry Report on a Strategic Workshop. Bulletin of the EATCS 94: 113-129 (2008)
[j55]Luca Aceto, Silvio Capobianco: On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt. Bulletin of the EATCS 95: 220-240 (2008)
[j54]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: A Cancellation Theorem for BCCSP. Fundam. Inform. 88(1-2): 1-21 (2008)
[j53]Luca Aceto, Silvio Capobianco, Anna Ingólfsdóttir, Bas Luttik: The equational theory of prebisimilarity over basic CCS with divergence. Inf. Process. Lett. 108(5): 284-289 (2008)
[j52]Luca Aceto, Anna Ingólfsdóttir: On the expressibility of priority. Inf. Process. Lett. 109(1): 83-85 (2008)
[j51]Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon: Guest Editors' Foreword. J. Log. Algebr. Program. 75(1): 1-2 (2008)
[j50]
[j49]Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir: On the axiomatisability of priority. Mathematical Structures in Computer Science 18(1): 5-28 (2008)
[c33]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi: Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. IFIP TCS 2008: 301-316
[c32]Luca Aceto, Anna Ingólfsdóttir, Bas Luttik, Paul van Tilburg: Finite Equational Bases for Fragments of CCS with Restriction and Relabelling. IFIP TCS 2008: 317-332
[e3]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz (Eds.): Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Lecture Notes in Computer Science 5125, Springer 2008, ISBN 978-3-540-70574-1
[e2]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz (Eds.): Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations. Lecture Notes in Computer Science 5126, Springer 2008, ISBN 978-3-540-70582-6- 2007
[j48]Luca Aceto, Anna Ingólfsdóttir: Characteristic Formulae: From Automata to Logic. Bulletin of the EATCS 91: 58-75 (2007)
[j47]Luca Aceto: Impossibility Results in the Equational Logic of Processes. Electr. Notes Theor. Comput. Sci. 169: 3-6 (2007)
[j46]Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon: Guest Editors' Foreword. J. Log. Algebr. Program. 70(2): 119-120 (2007)
[j45]Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon: Guest Editors' Foreword. J. Log. Algebr. Program. 72(1): 1-2 (2007)
[j44]
[c31]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: Ready to Preorder: Get Your BCCSP Axiomatization for Free! CALCO 2007: 65-79
[c30]Luca Aceto, Anna Ingólfsdóttir, Mohammad Reza Mousavi: Impossibility Results for the Equational Theory of Timed CCS. CALCO 2007: 80-95
[c29]Luca Aceto, Anna Ingólfsdóttir: The Saga of the Axiomatization of Parallel Composition. CONCUR 2007: 2-16- 2006
[j43]
[j42]Luca Aceto, Wan Fokkink: The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems. Electr. Notes Theor. Comput. Sci. 162: 43-48 (2006)
[j41]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain: Bisimilarity is not finitely based over BPA with interrupt. Theor. Comput. Sci. 366(1-2): 60-81 (2006)
[c28]Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir: On the Axiomatizability of Priority. ICALP (2) 2006: 480-491
[c27]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: A Finite Equational Base for CCS with Left Merge and Communication Merge. ICALP (2) 2006: 492-503
[e1]Luca Aceto, Anna Ingólfsdóttir (Eds.): Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings. Lecture Notes in Computer Science 3921, Springer 2006, ISBN 3-540-33045-3
[i2]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: A Finite Equational Base for CCS with Left Merge and Communication Merge. CoRR abs/cs/0608001 (2006)- 2005
[j40]Luca Aceto, Wan Fokkink, Irek Ulidowski: Preface. Electr. Notes Theor. Comput. Sci. 128(1): 1- (2005)
[j39]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge. Logical Methods in Computer Science 1(1) (2005)
[j38]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: CCS with Hennessy's merge has no finite-equational axiomatization. Theor. Comput. Sci. 330(3): 377-405 (2005)
[j37]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Zoltán Ésik: Guest editors' foreword: Process Algebra. Theor. Comput. Sci. 335(2-3): 127-129 (2005)
[c26]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: Finite Equational Bases in Process Algebra: Results and Open Questions. Processes, Terms and Cycles 2005: 338-367
[c25]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain: Bisimilarity Is Not Finitely Based over BPA with Interrupt. CALCO 2005: 52-66
[i1]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge. CoRR abs/cs/0501040 (2005)- 2004
[j36]Luca Aceto: Nested Semantics over Finite Trees are Equationally Hard: Invited Talk. Electr. Notes Theor. Comput. Sci. 96: 5-6 (2004)
[j35]Luca Aceto, Wan Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir: Nested semantics over finite trees are equationally hard. Inf. Comput. 191(2): 203-232 (2004)
[j34]Luca Aceto, Jens A. Hansen, Anna Ingólfsdóttir, Jacob Johnsen, John Knudsen: The Complexity of Checking Consistency of Pedigree Information and Related Problems. J. Comput. Sci. Technol. 19(1): 42-59 (2004)
[j33]Luca Aceto, Wan Fokkink: Guesteditors'introduction: Special issue on Structural Operational Semantics. J. Log. Algebr. Program. 60-61: 1-2 (2004)- 2003
[j32]Luca Aceto: Some of My Favourite Results in Classic Process Algebra. Bulletin of the EATCS 81: 90-108 (2003)
[j31]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: A note on an expressiveness hierarchy for multi-exit iteration. Inf. Process. Lett. 87(1): 17-23 (2003)
[j30]Luca Aceto, Giuseppe Longo, Björn Victor: Foreword To Special Issue: The Difference Between Concurrent And Sequential Computation. Mathematical Structures in Computer Science 13(4): 481-484 (2003)
[j29]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: Equational theories of tropical semirings. Theor. Comput. Sci. 3(298): 417-469 (2003)
[j28]Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen: The power of reachability testing for timed automata. Theor. Comput. Sci. 300(1-3): 411-475 (2003)
[c24]Luca Aceto, Jens A. Hansen, Anna Ingólfsdóttir, Jacob Johnsen, John Knudsen: The Complexity of Checking Consistency of Pedigree Information and Related Problems. ICTCS 2003: 174-187- 2002
[j27]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: A Fully Equational Proof of Parikh's Theorem. ITA 36(2): 129-153 (2002)
[j26]Luca Aceto, François Laroussinie: Is your model checker on time? On the complexity of model checking for timed modal logics. J. Log. Algebr. Program. 52-53: 7-51 (2002)
[j25]
[c23]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: Equational Axioms for Probabilistic Bisimilarity. AMAST 2002: 239-253
[c22]- 2001
[j24]
[j23]Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir: Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218. Inf. Comput. 165(2): 119-122 (2001)
[j22]
[c21]
[c20]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: 2-Nested Simulation Is Not Finitely Equationally Axiomatizable. STACS 2001: 39-50
[p1]Luca Aceto, Wan Fokkink, Chris Verhoef: Conservative Extension in Structural Operational Semantics. Current Trends in Theoretical Computer Science 2001: 504-524- 2000
[j21]Luca Aceto, Anna Ingólfsdóttir, Mikkel Lykke Pedersen, Jan Poulsen: Characteristic formulae for timed automata. ITA 34(6): 565-584 (2000)
[c19]Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. STACS 2000: 267-278
1990 – 1999
- 1999
[j20]Luca Aceto, Wan Fokkink, Chris Verhoef: Conservative Extension in Structural Operational Semantics. Bulletin of the EATCS 69: 110-132 (1999)
[j19]Luca Aceto, Jan Friso Groote: A Complete Equational Axiomatization for MPA with String Iteration. Theor. Comput. Sci. 211(1-2): 339-374 (1999)
[c18]
[c17]Luca Aceto, François Laroussinie: Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. MFCS 1999: 125-136- 1998
[j18]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces. Mathematical Structures in Computer Science 8(3): 193-230 (1998)
[j17]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based. Theor. Comput. Sci. 209(1-2): 163-178 (1998)
[c16]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: A Cook's Tour of Equational Axiomatizations for Prefix Iteration. FoSSaCS 1998: 20-34
[c15]Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen: The Power of Reachability Testing for Timed Automata. FSTTCS 1998: 245-256
[c14]Luca Aceto, Augusto Burgueño, Kim Guldstrand Larsen: Model Checking via Reachability Testing for Timed Automata. TACAS 1998: 263-280- 1997
[j16]Luca Aceto, Hans Hüttel, Anna Ingólfsdóttir, Josva Kleist: Relating semantic models for the object calculus. Electr. Notes Theor. Comput. Sci. 7: 3-18 (1997)
[j15]Luca Aceto, Wan Fokkink: An Equational Axiomatization for Multi-Exit Iteration. Inf. Comput. 137(2): 121-158 (1997)
[j14]Luca Aceto, Anna Ingólfsdóttir: A Characterization of Finitary Bisimulation. Inf. Process. Lett. 64(3): 127-134 (1997)- 1996
[j13]
[j12]Luca Aceto, Rob J. van Glabbeek, Wan Fokkink, Anna Ingólfsdóttir: Axiomatizing Prefix Iteration with Silent Steps. Inf. Comput. 127(1): 26-40 (1996)
[j11]Luca Aceto, Anna Ingólfsdóttir: CPO Models for Compact GSOS Languages. Inf. Comput. 129(2): 107-141 (1996)
[c13]Luca Aceto, Anna Ingólfsdóttir: An Equational Axiomatization of Observation Congruence for Prefix Iteration. AMAST 1996: 195-209- 1995
[j10]Luca Aceto, Alan Jeffrey: A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours. Theor. Comput. Sci. 152(2): 251-268 (1995)
[c12]- 1994
[j9]
[j8]Luca Aceto, Bard Bloom, Frits W. Vaandrager: Turning SOS Rules into Equations. Inf. Comput. 111(1): 1-52 (1994)
[j7]Luca Aceto, Matthew Hennessy: Adding Action Refinement to a Finite Process Algebra. Inf. Comput. 115(2): 179-247 (1994)
[j6]
[j5]
[c11]Luca Aceto: Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours. CONCUR 1994: 449-464- 1993
[j4]Luca Aceto, Matthew Hennessy: Towards Action-Refinement in Process Algebras. Inf. Comput. 103(2): 204-269 (1993)
[c10]- 1992
[j3]Luca Aceto: History preserving, causal and mixed-ordering equivalence over stable event structures. Fundam. Inform. 17(4): 319-331 (1992)
[j2]Luca Aceto: Relating distributed, temporal and causal observations of simple processes. Fundam. Inform. 17(4): 369-397 (1992)
[j1]
[c9]- 1991
[c8]
[c7]Luca Aceto, Uffe Engberg: Failures Semantics for a Simple Process Language with Refinement. FSTTCS 1991: 89-108
[c6]Luca Aceto, Matthew Hennessy: Adding Action Refinement to a Finite Process Algebra. ICALP 1991: 506-519
[c5]
[c4]
1980 – 1989
- 1989
[c3]
[c2]Luca Aceto, Matthew Hennessy: Termination, Deadlock and Divergence. Mathematical Foundations of Programming Semantics 1989: 301-318- 1986
[c1]Luca Aceto, Rocco De Nicola, Alessandro Fantechi: Testing Equivalences for Event Structures. Mathematical Models for the Semantics of Parallelism 1986: 1-20
Coauthor Index
[j73] [c53] [c52] [c51] [i3] [j72] [j71] [j70] [j69] [c50] [c49] [c48] [j67] [j66] [j65] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [j64] [j63] [j62] [c38] [j61] [j59] [j58] [j57] [c37] [c36] [c35] [c34] [j56] [j54] [j53] [j52] [j50] [j49] [c33] [c32] [e3] [e2] [j48] [j44] [c31] [c30] [c29] [j41] [c28] [c27] [e1] [i2] [j39] [j38] [j37] [c26] [c25] [i1] [j35] [j34] [j31] [j29] [c24] [j27] [c23] [j23] [c21] [c20] [j21] [c19] [c18] [j18] [j17] [c16] [j16] [j14] [j12] [j11] [c13] [c12] [c8]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:09 CEST by the dblp team



