default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Rutten
Jan J. M. M. Rutten
Person information
- affiliation: Centrum Wiskunde & Informatica, Amsterdam, Netherlands
- affiliation: Radboud University Nijmegen, Netherlands
- affiliation: National Research Institute for Mathematics and Computer Science, Amsterdam, Netherlands
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j51]Henning Basold
, Helle Hvid Hansen, Jean-Éric Pin, Jan Rutten:
Newton series, coinductively: a comparative study of composition. Math. Struct. Comput. Sci. 29(1): 38-66 (2019)- 2018
- [e7]Frank S. de Boer, Marcello M. Bonsangue, Jan Rutten:
It's All About Coordination - Essays to Celebrate the Lifelong Scientific Achievements of Farhad Arbab. Lecture Notes in Computer Science 10865, Springer 2018, ISBN 978-3-319-90088-9 [contents] - 2017
- [j50]Helle Hvid Hansen, Clemens Kupke, Jan Rutten:
Stream Differential Equations: Specification Formats and Solution Methods. Log. Methods Comput. Sci. 13(1) (2017) - [j49]Jurriaan Rot, Filippo Bonchi, Marcello M. Bonsangue, Damien Pous, Jan Rutten, Alexandra Silva:
Enhanced coalgebraic bisimulation. Math. Struct. Comput. Sci. 27(7): 1236-1264 (2017) - [i3]Shin-ya Katsumata, Damien Pous, Jan Rutten:
Enhanced coinduction (NII Shonan Meeting 2017-17). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j48]Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramon Esteban-Romero, Jan J. M. M. Rutten:
Errata to "Formations of Monoids, Congruences, and Formal Languages". Sci. Ann. Comput. Sci. 26(1): 123-124 (2016) - [j47]Jurriaan Rot, Marcello M. Bonsangue, Jan Rutten:
Proving language inclusion and equivalence by coinduction. Inf. Comput. 246: 62-76 (2016) - [j46]Filippo Bonchi, Marcello M. Bonsangue, Georgiana Caltais, Jan Rutten, Alexandra Silva:
A coalgebraic view on decorated traces. Math. Struct. Comput. Sci. 26(7): 1234-1268 (2016) - 2015
- [j45]Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramon Esteban-Romero, Jan J. M. M. Rutten:
Formations of Monoids, Congruences, and Formal Languages. Sci. Ann. Comput. Sci. 25(2): 171-209 (2015) - [j44]Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Jan J. M. M. Rutten:
The dual equivalence of equations and coequations for automata. Inf. Comput. 244: 49-75 (2015) - [j43]Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Context-free coalgebras. J. Comput. Syst. Sci. 81(5): 911-939 (2015) - [c62]Henning Basold, Helle Hvid Hansen, Jean-Éric Pin, Jan Rutten:
Newton Series, Coinductively. ICTAC 2015: 91-109 - [c61]Julian Salamanca, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Equations and Coequations for Weighted Automata. MFCS (1) 2015: 444-456 - [c60]Julian Salamanca, Adolfo Ballester-Bolinches, Marcello M. Bonsangue, Enric Cosme-Llópez, Jan J. M. M. Rutten:
Regular Varieties of Automata and Coequations. MPC 2015: 224-237 - 2014
- [j42]Filippo Bonchi, Marcello M. Bonsangue, Helle Hvid Hansen, Prakash Panangaden, Jan J. M. M. Rutten, Alexandra Silva:
Algebra-coalgebra duality in Brzozowski's minimization algorithm. ACM Trans. Comput. Log. 15(1): 3:1-3:29 (2014) - [c59]Henning Basold, Marcello M. Bonsangue, Helle Hvid Hansen, Jan Rutten:
(Co)Algebraic Characterizations of Signal Flow Graphs. Horizons of the Mind 2014: 124-145 - [c58]Helle Hvid Hansen, Clemens Kupke, Jan Rutten, Joost Winter:
A Final Coalgebra for k-regular Sequences. Horizons of the Mind 2014: 363-383 - [c57]Marcello M. Bonsangue, Jurriaan Rot, Davide Ancona, Frank S. de Boer, Jan J. M. M. Rutten:
A Coalgebraic Foundation for Coinductive Union Types. ICALP (2) 2014: 62-73 - [c56]Marie Fortin, Marcello M. Bonsangue, Jan Rutten:
Coalgebraic Semantics of Heavy-Weighted Automata. WADT 2014: 48-68 - [e6]Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten:
Horizons of the Mind. A Tribute to Prakash Panangaden - Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 8464, Springer 2014, ISBN 978-3-319-06879-4 [contents] - 2013
- [j41]Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci. 9(1) (2013) - [j40]Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Coalgebraic Characterizations of Context-Free Languages. Log. Methods Comput. Sci. 9(3) (2013) - [j39]Jan A. Bergstra, Jan Willem Klop, Jan Rutten:
Obituary for Jaco de Bakker, 1939-2012. Bull. EATCS 109: 14-16 (2013) - [j38]Marcello M. Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac, Dorel Lucanu, Jan J. M. M. Rutten, Alexandra Silva:
Automatic equivalence proofs for non-deterministic coalgebras. Sci. Comput. Program. 78(9): 1324-1345 (2013) - [j37]Milad Niqui, Jan J. M. M. Rutten:
Stream processing coalgebraically. Sci. Comput. Program. 78(11): 2192-2215 (2013) - [c55]Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Coinductive Proof Techniques for Language Equivalence. LATA 2013: 480-492 - [c54]Jurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Coalgebraic Bisimulation-Up-To. SOFSEM 2013: 369-381 - [c53]Jan Rutten, Adolfo Ballester-Bolinches, Enric Cosme-Llópez:
Varieties and Covarieties of Languages (Extended Abstract). MFPS 2013: 7-28 - [i2]Marcello M. Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac, Dorel Lucanu, Jan J. M. M. Rutten, Alexandra Silva:
Automatic Equivalence Proofs for Non-deterministic Coalgebras. CoRR abs/1303.1994 (2013) - 2012
- [j36]Filippo Bonchi, Marcello M. Bonsangue, Michele Boreale, Jan J. M. M. Rutten, Alexandra Silva:
A coalgebraic perspective on linear weighted automata. Inf. Comput. 211: 77-105 (2012) - [j35]Sun Meng, Farhad Arbab, Bernhard K. Aichernig, Lacramioara Astefanoaei, Frank S. de Boer, Jan J. M. M. Rutten:
Connectors as designs: Modeling, refinement and test case generation. Sci. Comput. Program. 77(7-8): 799-822 (2012) - [c52]Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
Brzozowski's Algorithm (Co)Algebraically. Logic and Program Semantics 2012: 12-23 - [c51]Clemens Kupke, Jan J. M. M. Rutten:
On the Final Coalgebra of Automatic Sequences. Logic and Program Semantics 2012: 149-164 - [c50]Marcello M. Bonsangue, Jan J. M. M. Rutten, Joost Winter:
Defining Context-Free Power Series Coalgebraically. CMCS 2012: 20-39 - [c49]Filippo Bonchi, Marcello M. Bonsangue, Georgiana Caltais, Jan J. M. M. Rutten, Alexandra Silva:
Final Semantics for Decorated Traces. MFPS 2012: 73-86 - [p1]Bart Jacobs, Jan Rutten:
An introduction to (co)algebra and (co)induction. Advanced Topics in Bisimulation and Coinduction 2012: 38-99 - [e5]Davide Sangiorgi, Jan J. M. M. Rutten:
Advanced Topics in Bisimulation and Coinduction. Cambridge tracts in theoretical computer science 52, Cambridge University Press 2012, ISBN 978-1-10-700497-9 [contents] - 2011
- [j34]Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Quantitative Kleene coalgebras. Inf. Comput. 209(5): 822-849 (2011) - [j33]Milad Niqui, Jan J. M. M. Rutten:
A proof of Moessner's theorem by coinduction. High. Order Symb. Comput. 24(3): 191-206 (2011) - [j32]Bart Jacobs, Milad Niqui, Jan J. M. M. Rutten, Alexandra Silva:
Preface. Theor. Comput. Sci. 412(38): 4967-4968 (2011) - [c48]Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Context-Free Languages, Coalgebraically. CALCO 2011: 359-376 - [c47]David Costa, Milad Niqui, Jan J. M. M. Rutten:
Intentional Automata: A Context-Dependent Model for Component Connectors - (Extended Abstract). FSEN 2011: 335-342 - 2010
- [j31]Alexandra Silva, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Non-Deterministic Kleene Coalgebras. Log. Methods Comput. Sci. 6(3) (2010) - [j30]Helle Hvid Hansen, Jan J. M. M. Rutten:
Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions. Sci. Ann. Comput. Sci. 20: 97-130 (2010) - [j29]Alexandra Silva, Jan J. M. M. Rutten:
A coinductive calculus of binary trees. Inf. Comput. 208(5): 578-593 (2010) - [j28]Clemens Kupke, Jan J. M. M. Rutten:
Complete sets of cooperations. Inf. Comput. 208(12): 1398-1420 (2010) - [c46]Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Generalizing the powerset construction, coalgebraically. FSTTCS 2010: 272-283 - [c45]Milad Niqui, Jan J. M. M. Rutten:
Sampling, Splitting and Merging in Coinductive Stream Calculus. MPC 2010: 310-330 - [c44]Marcello M. Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac, Dorel Lucanu, Jan J. M. M. Rutten, Alexandra Silva:
A Decision Procedure for Bisimilarity of Generalized Regular Expressions. SBMF 2010: 226-241 - [c43]Bart Jacobs, Milad Niqui, Jan J. M. M. Rutten, Alexandra Silva:
Preface. CMCS@ETAPS 2010: 1-2 - [e4]Bart Jacobs, Milad Niqui, Jan J. M. M. Rutten, Alexandra Silva:
Proceedings of the Tenth Workshop on Coalgebraic Methods in Computer Science, CMCS@ETAPS 2010, Paphos, Cyprus, March 26-28, 2010. Electronic Notes in Theoretical Computer Science 264(2), Elsevier 2010 [contents]
2000 – 2009
- 2009
- [c42]Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
Deriving Syntax and Axioms for Quantitative Regular Behaviours. CONCUR 2009: 146-162 - [c41]Milad Niqui, Jan Rutten:
Coinductive Predicates as Final Coalgebras. FICS 2009: 79-85 - [c40]Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
A Kleene Theorem for Polynomial Coalgebras. FoSSaCS 2009: 122-136 - [c39]Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
An Algebra for Kripke Polynomial Coalgebras. LICS 2009: 49-58 - [c38]Bernhard K. Aichernig, Farhad Arbab, Lacramioara Astefanoaei, Frank S. de Boer, Sun Meng, Jan J. M. M. Rutten:
Fault-Based Test Case Generation for Component Connectors. TASE 2009: 147-154 - 2008
- [j27]Jan J. M. M. Rutten:
Rational Streams Coalgebraically. Log. Methods Comput. Sci. 4(3) (2008) - [c37]Jan J. M. M. Rutten:
A Roman Senator. Concurrency, Graphs and Models 2008: 802-803 - [c36]Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
Coalgebraic Logic and Synthesis of Mealy Machines. FoSSaCS 2008: 231-245 - [c35]Clemens Kupke, Jan J. M. M. Rutten:
Observational Coalgebras and Complete Sets of Co-operations. CMCS 2008: 153-174 - [i1]Jan J. M. M. Rutten:
Rational streams coalgebraically. CoRR abs/0807.4073 (2008) - 2007
- [j26]Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten:
Models and temporal logical specifications for timed component connectors. Softw. Syst. Model. 6(1): 59-82 (2007) - [c34]Jan J. M. M. Rutten:
Coalgebraic Foundations of Linear Systems. CALCO 2007: 425-446 - [c33]Alexandra Silva, Jan J. M. M. Rutten:
Behavioural Differential Equations and Coinduction for Binary Trees. WoLLIC 2007: 322-336 - 2006
- [j25]Christel Baier, Marjan Sirjani, Farhad Arbab, Jan J. M. M. Rutten:
Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2): 75-113 (2006) - [j24]José Luiz Fiadeiro, Jan J. M. M. Rutten:
Preface. Theor. Comput. Sci. 366(1-2): 1-2 (2006) - [c32]Helle Hvid Hansen, David Costa, Jan J. M. M. Rutten:
Synthesis of Mealy Machines Using Derivatives. CMCS 2006: 27-45 - 2005
- [j23]Jan J. M. M. Rutten:
A coinductive calculus of streams. Math. Struct. Comput. Sci. 15(1): 93-147 (2005) - [j22]Jan J. M. M. Rutten:
A tutorial on coinductive stream calculus and signal flow graphs. Theor. Comput. Sci. 343(3): 443-481 (2005) - [c31]Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten, Marjan Sirjani:
Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications. COORDINATION 2005: 236-251 - [c30]Jan J. M. M. Rutten:
Algebraic Specification and Coalgebraic Synthesis of Mealy Automata. FACS 2005: 305-319 - [e3]José Luiz Fiadeiro, Neil Harman, Markus Roggenbach, Jan J. M. M. Rutten:
Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings. Lecture Notes in Computer Science 3629, Springer 2005, ISBN 3-540-28620-9 [contents] - 2004
- [b1]Jan J. M. M. Rutten, Marta Z. Kwiatkowska, Gethin Norman, David Parker, Prakash Panangaden:
Mathematical techniques for analyzing concurrent and probabilistic systems. CRM monograph series 23, American Mathematical Society 2004, ISBN 978-0-8218-3571-5, pp. I-VIII, 1-215 - [c29]Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten:
Models and Temporal Logics for Timed Component Connectors. SEFM 2004: 198-207 - 2003
- [j21]Jan J. M. M. Rutten:
Coinductive Counting with Weighted Automata. J. Autom. Lang. Comb. 8(2): 319-352 (2003) - [j20]Jan J. M. M. Rutten:
Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theor. Comput. Sci. 308(1-3): 1-53 (2003) - [c28]Jan J. M. M. Rutten:
An Application of Stream Calculus to Signal Flow Graphs. FMCO 2003: 276-291 - [c27]Farhad Arbab, Christel Baier, Jan J. M. M. Rutten, Marjan Sirjani:
Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract). FOCLASA 2003: 25-46 - 2002
- [j19]Bart Jacobs, Jan J. M. M. Rutten:
Coalgebraic Methods in Computer Science - Foreword. Theor. Comput. Sci. 280(1-2): 1 (2002) - [c26]Farhad Arbab, Jan J. M. M. Rutten:
A Coinductive Calculus of Component Connectors. WADT 2002: 34-55 - [c25]Jan J. M. M. Rutten:
Coinductive Counting: Bisimulation in Enumerative Combinatorics. CMCS 2002: 286-304 - 2001
- [j18]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten:
Foreword : Coalgebraic Methods in Computer Science 1998. Theor. Comput. Sci. 260(1-2): 1 (2001) - [c24]Jan J. M. M. Rutten:
Elements of Stream Calculus (An Extensive Exercise in Coinduction). MFPS 2001: 358-423 - 2000
- [j17]Marcello M. Bonsangue, Farhad Arbab, J. W. de Bakker, Jan J. M. M. Rutten, A. Secutella, Gianluigi Zavattaro:
A transition system semantics for the control-driven coordination language MANIFOLD. Theor. Comput. Sci. 240(1): 3-47 (2000) - [j16]Jan J. M. M. Rutten:
Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1): 3-80 (2000) - [c23]Jan J. M. M. Rutten:
Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series. MPC 2000: 100-101
1990 – 1999
- 1999
- [j15]Jan J. M. M. Rutten:
A note on coinduction and weak bisimilarity for while programs. RAIRO Theor. Informatics Appl. 33(4/5): 393-400 (1999) - [j14]Erik P. de Vink, Jan J. M. M. Rutten:
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. Theor. Comput. Sci. 221(1-2): 271-293 (1999) - [c22]Jan J. M. M. Rutten:
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously. ICALP 1999: 645-654 - [c21]Bart Jacobs, Jan J. M. M. Rutten:
Preface. CMCS 1999: 1 - [e2]Bart Jacobs, Jan J. M. M. Rutten:
Coalgebraic Methods in Computer Science, CMCS 1999, Amsterdam, The Netherlands, March 20-21, 1999. Electronic Notes in Theoretical Computer Science 19, Elsevier 1999 [contents] - 1998
- [j13]Daniele Turi, Jan J. M. M. Rutten:
On the Foundations of Final Coalgebra Semantics. Math. Struct. Comput. Sci. 8(5): 481-540 (1998) - [j12]Marcello M. Bonsangue, Franck van Breugel, Jan J. M. M. Rutten:
Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. Theor. Comput. Sci. 193(1-2): 1-51 (1998) - [c20]Jan J. M. M. Rutten:
Automata and Coinduction (An Exercise in Coalgebra). CONCUR 1998: 194-218 - [c19]Jan J. M. M. Rutten:
Relators and Metric Bisimulations. CMCS 1998: 252-258 - [c18]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten:
Preface. CMCS 1998: 259 - [e1]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten:
First Workshop on Coalgebraic Methods in Computer Science, CMCS 1998, Lisbon, Portugal, March 28-29, 1998. Electronic Notes in Theoretical Computer Science 11, Elsevier 1998 [contents] - 1997
- [c17]Erik P. de Vink, Jan J. M. M. Rutten:
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. ICALP 1997: 460-470 - 1996
- [j11]Jan J. M. M. Rutten:
Elements of Generalized Ultrametric Domain Theory. Theor. Comput. Sci. 170(1-2): 349-381 (1996) - 1995
- [c16]Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten:
Solutions of functorial and non-functorial metric domain equations. MFPS 1995: 1-12 - 1994
- [j10]Eiichi Horita, J. W. de Bakker, Jan J. M. M. Rutten:
Fully Abstract Denotational Models for Nonuniform Concurrent Languages. Inf. Comput. 115(1): 125-178 (1994) - 1993
- [c15]Jan J. M. M. Rutten:
A Strucutral Co-Induction Theorem. MFPS 1993: 83-102 - [c14]Jan J. M. M. Rutten, Daniele Turi:
Initial Algebra and Final Coalgebra Semantics for Concurrency. REX School/Symposium 1993: 530-582 - [c13]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
Non-monotonic Concurrent Constraint Programming. ILPS 1993: 315-334 - 1992
- [j9]Pierre America, Jan J. M. M. Rutten:
A Layered Semantics for a Parallel Object-Oriented Language. Formal Aspects Comput. 4(4): 376-408 (1992) - [j8]Jan J. M. M. Rutten, Jeffery I. Zucker:
A semantic approach to fairness. Fundam. Informaticae 16(1): 1-38 (1992) - [j7]Jan J. M. M. Rutten:
Processes as Terms: Non-Well-Founded Models for Bisimulation. Math. Struct. Comput. Sci. 2(3): 257-275 (1992) - [j6]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic. Theor. Comput. Sci. 101(2): 239-263 (1992) - [c12]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
On Blocks: Locality and Asynchronous Communication (Extended Abstract). REX Workshop 1992: 73-90 - [c11]Jan J. M. M. Rutten, Daniele Turi:
On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. REX Workshop 1992: 477-530 - 1991
- [j5]Frank S. de Boer, Jan J. M. M. Rutten, Joost N. Kok, Catuscia Palamidessi:
Semantic Models for Concurrent Logic Languages. Theor. Comput. Sci. 86(1): 3-33 (1991) - [c10]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
The Failure of Failures in a Paradigm for Asynchronous Communication. CONCUR 1991: 111-126 - [c9]Jan J. M. M. Rutten:
Nonwellfounded Sets and Programming Language Semantics. MFPS 1991: 193-206 - 1990
- [j4]Jan J. M. M. Rutten:
Semantic Correctness for a Parallel Object-Oriented Language. SIAM J. Comput. 19(2): 341-383 (1990) - [j3]Joost N. Kok, Jan J. M. M. Rutten:
Contractions in Comparing Concurrency Semantics. Theor. Comput. Sci. 76(2-3): 179-222 (1990) - [c8]Jan J. M. M. Rutten:
Deriving Denotational Models for Bisimulation from Structured Operational Semantics. Programming Concepts and Methods 1990: 155-178 - [c7]Pierre America, Jan J. M. M. Rutten:
A Layered Semantics for a Parallel Object-Oriented Language. REX Workshop 1990: 91-123
1980 – 1989
- 1989
- [j2]Pierre America, Jaco de Bakker, Joost N. Kok, Jan J. M. M. Rutten:
Denotational Semantics of a Parallel Object-Oriented Language. Inf. Comput. 83(2): 152-205 (1989) - [j1]Pierre America, Jan J. M. M. Rutten:
Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. J. Comput. Syst. Sci. 39(3): 343-375 (1989) - [c6]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
Semantic Models for a Version of PARLOG. ICLP 1989: 621-636 - [c5]Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten:
Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses. MFCS 1989: 165-176 - 1988
- [c4]Joost N. Kok, Jan J. M. M. Rutten:
Contractions in Comparing Concurrent Semantics. ICALP 1988: 317-332 - [c3]Jan J. M. M. Rutten:
Correctness and full abstraction of metric semantics for concurrency. REX Workshop 1988: 628-659 - 1987
- [c2]Pierre America, Jan J. M. M. Rutten:
Solving Reflexive Domain Equations in a Category of Complete Metric Spaces. MFPS 1987: 254-288 - 1986
- [c1]Pierre America, Jaco de Bakker, Joost N. Kok, Jan J. M. M. Rutten:
Operational Semantics of a Parallel Object-Oriented Language. POPL 1986: 194-208
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 01:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
