Zobrazeno 1 - 10
of 325
pro vyhledávání: '"Groote, J.F."'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
van Beusekom, R., Groote, J.F., Hoogendijk, P., Howe, R., Wesselink, W., Wieringa, R., Willemse, T.A.C., Petrucci, L., Seceleanu, C., Cavalcanti, A.
Publikováno v:
Critical Systems: Formal Methods and Automated Verification: Joint 22nd International Workshop on Formal Methods for Industrial Critical Systems and 17th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2017, Turin, Italy, September 18–20, 2017, Proceedings, 217-233
STARTPAGE=217;ENDPAGE=233;TITLE=Critical Systems: Formal Methods and Automated Verification
Lecture Notes in Computer Science ISBN: 9783319671123
FMICS-AVoCS
STARTPAGE=217;ENDPAGE=233;TITLE=Critical Systems: Formal Methods and Automated Verification
Lecture Notes in Computer Science ISBN: 9783319671123
FMICS-AVoCS
Dezyne is an industrial language with an associated set of tools, allowing users to model interface behaviours and implementations of reactive components and generate executable code from these. The tool and language succeed the successful ASD:Suite
Publikováno v:
Analytical and Stochastic Modelling Techniques and Applications ISBN: 9783319614274
ASMTA
Analytical and Stochastic Modelling Techniques and Applications: 24th International Conference, ASMTA 2017, Newcastle-upon-Tyne, UK, July 10-11, 2017, Proceedings, 196-211
STARTPAGE=196;ENDPAGE=211;TITLE=Analytical and Stochastic Modelling Techniques and Applications
ASMTA
Analytical and Stochastic Modelling Techniques and Applications: 24th International Conference, ASMTA 2017, Newcastle-upon-Tyne, UK, July 10-11, 2017, Proceedings, 196-211
STARTPAGE=196;ENDPAGE=211;TITLE=Analytical and Stochastic Modelling Techniques and Applications
The statement of the mean field approximation theorem in the mean field theory of Markov processes particularly targets the behaviour of population processes with an unbounded number of agents. However, in most real-world engineering applications one
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662496732
TACAS
Tools and Algorithms for the Construction and Analysis of Systems: 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, 607-624
STARTPAGE=607;ENDPAGE=624;TITLE=Tools and Algorithms for the Construction and Analysis of Systems
TACAS
Tools and Algorithms for the Construction and Analysis of Systems: 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, 607-624
STARTPAGE=607;ENDPAGE=624;TITLE=Tools and Algorithms for the Construction and Analysis of Systems
We provide a new algorithm to determine stuttering equivalence with time complexity $$Om \log n$$, where n is the number of states and m is the number of transitions of a Kripke structure. This algorithm can also be used to determine branching bisimu
Publikováno v:
In Journal of Logic and Algebraic Programming March-April 2003 55(1-2):21-56
Publikováno v:
Margaria T.Steffen B., Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) : 8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018, 5 November 2018 through 9 November 2018, 11247 LNCS, 121-138
Maintaining legacy software is one of the most common struggles of the software industry, being costly yet essential. We tackle that problem by providing better understanding of software by extracting behavioural models using the model learning techn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2f30bfba466178d956fbb5f7e984171a
http://resolver.tudelft.nl/uuid:2f2d2254-1ffa-485f-82a4-7b0f62ac9ba1
http://resolver.tudelft.nl/uuid:2f2d2254-1ffa-485f-82a4-7b0f62ac9ba1
Autor:
Chaudhary, Kaylash, Fehnker, Ansgar, van de Pol, Jan Cornelis, Stoelinga, Mariëlle Ida Antoinette, van Glabbeek, R.J., Groote, J.F., Höfner, P.
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 196, Iss Proc. MARS 2015, Pp 46-60 (2015)
Proceedings of the Workshop on Models for Formal Analysis of Real Systems (MARS 2015), 46-60
STARTPAGE=46;ENDPAGE=60;TITLE=Proceedings of the Workshop on Models for Formal Analysis of Real Systems (MARS 2015)
Proceedings of the Workshop on Models for Formal Analysis of Real Systems (MARS 2015), 46-60
STARTPAGE=46;ENDPAGE=60;TITLE=Proceedings of the Workshop on Models for Formal Analysis of Real Systems (MARS 2015)
Bitcoin is a popular digital currency for online payments, realized as a decentralized peer-to-peer electronic cash system. Bitcoin keeps a ledger of all transactions; the majority of the participants decides on the correct ledger. Since there is no
Publikováno v:
In Journal of Logic and Algebraic Programming 2001 48(1):39-70
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 244, Iss Proc. MARS 2017, Pp 117-128 (2017)
Proceedings 2nd Workshop on Models for Formal Analysis of Real Systems (MARS 2017), 117-128
STARTPAGE=117;ENDPAGE=128;TITLE=Proceedings 2nd Workshop on Models for Formal Analysis of Real Systems (MARS 2017)
Proceedings 2nd Workshop on Models for Formal Analysis of Real Systems (MARS 2017), 117-128
STARTPAGE=117;ENDPAGE=128;TITLE=Proceedings 2nd Workshop on Models for Formal Analysis of Real Systems (MARS 2017)
Correct and efficient initialization of wireless sensor networks can be challenging in the face of many uncertainties present in ad hoc wireless networks. In this paper we examine an implementation for the formation of a cluster-tree topology in a ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6043740b31d557a332c65bf307c1d7e7
http://arxiv.org/abs/1703.06572
http://arxiv.org/abs/1703.06572