Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Axel Wabenhorst
@article{DBLP:journals/acta/Wabenhorst03, author = {Axel Wabenhorst}, title = {Stepwise development of fair distributed systems}, journal = {Acta Informatica}, volume = {39}, number = {4}, pages = {233--271}, year = {2003}, url = {https://doi.org/10.1007/s00236-002-0103-6}, doi = {10.1007/S00236-002-0103-6}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/Wabenhorst03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Wabenhorst03, author = {Axel Wabenhorst}, title = {Induction in the Timed Interval Calculus}, journal = {Theor. Comput. Sci.}, volume = {300}, number = {1-3}, pages = {181--207}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(01)00378-4}, doi = {10.1016/S0304-3975(01)00378-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Wabenhorst03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mpc/FidgeHMW98, author = {Colin J. Fidge and Ian J. Hayes and Andrew P. Martin and Axel Wabenhorst}, editor = {Johan Jeuring}, title = {A Set-Theoretic Model for Real-Time Specification and Reasoning}, booktitle = {Mathematics of Program Construction, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1422}, pages = {188--206}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0054291}, doi = {10.1007/BFB0054291}, timestamp = {Tue, 14 May 2019 10:00:46 +0200}, biburl = {https://dblp.org/rec/conf/mpc/FidgeHMW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/procomet/Wabenhorst98, author = {Axel Wabenhorst}, editor = {David Gries and Willem P. de Roever}, title = {A model of real-time distributed systems}, booktitle = {Programming Concepts and Methods, {IFIP} TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods {(PROCOMET} '98) 8-12 June 1998, Shelter Island, New York, {USA}}, series = {{IFIP} Conference Proceedings}, volume = {125}, pages = {462--482}, publisher = {Chapman {\&} Hall}, year = {1998}, timestamp = {Thu, 21 Nov 2002 11:12:21 +0100}, biburl = {https://dblp.org/rec/conf/procomet/Wabenhorst98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tools/WabenhorstP97, author = {Axel Wabenhorst and John Potter}, title = {Modelling Multi-Threading in Java}, booktitle = {{TOOLS} 1997: 25th International Conference on Technology of Object-Oriented Languages and Systems, 24-28 November 1997, Melbourne, Australia}, pages = {153--164}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/TOOLS.1997.681868}, doi = {10.1109/TOOLS.1997.681868}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tools/WabenhorstP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Wabenhorst96, author = {Axel Wabenhorst}, editor = {Wojciech Penczek and Andrzej Szalas}, title = {On Fairness in Terminating and Reactive Programs}, booktitle = {Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1113}, pages = {554--565}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61550-4\_178}, doi = {10.1007/3-540-61550-4\_178}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Wabenhorst96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.