Zobrazeno 1 - 10
of 371
pro vyhledávání: '"Arbab, F."'
Publikováno v:
Arbab, F.; Jongmans, S.-S. (ed.), Formal Aspects of Component Software: 16th International Conference, FACS 2019, Amsterdam, The Netherlands, October 23-25, 2019. Proceedings, 191-212. Cham : Springer
STARTPAGE=191;ENDPAGE=212;ISSN=0302-9743;TITLE=Arbab, F.; Jongmans, S.-S. (ed.), Formal Aspects of Component Software: 16th International Conference, FACS 2019, Amsterdam, The Netherlands, October 23-25, 2019. Proceedings
Science of Computer Programming, 209, pp. 1-24
Science of Computer Programming, 209, 1-24
Arbab, F.; Jongmans, S.-S. (ed.), Formal Aspects of Component Software: 16th International Conference, FACS 2019, Amsterdam, The Netherlands, October 23-25, 2019. Proceedings, pp. 191-212
Science of computer programming, 209:102678. Elsevier
STARTPAGE=191;ENDPAGE=212;ISSN=0302-9743;TITLE=Arbab, F.; Jongmans, S.-S. (ed.), Formal Aspects of Component Software: 16th International Conference, FACS 2019, Amsterdam, The Netherlands, October 23-25, 2019. Proceedings
Science of Computer Programming, 209, pp. 1-24
Science of Computer Programming, 209, 1-24
Arbab, F.; Jongmans, S.-S. (ed.), Formal Aspects of Component Software: 16th International Conference, FACS 2019, Amsterdam, The Netherlands, October 23-25, 2019. Proceedings, pp. 191-212
Science of computer programming, 209:102678. Elsevier
For Finite State Machines (FSMs) a rich testing theory has been developed to discover aspects of their behavior and ensure their correct functioning. Although this theory is widely used, e.g., to check conformance of protocol implementations, its app
Publikováno v:
Logical Methods in Computer Science, 12, 3, pp. 11.1-11.38
Logical Methods in Computer Science, 12, 11.1-11.38
Jongmans, S-S T Q & Arbab, F 2017, ' DATA OPTIMIZATIONS FOR CONSTRAINT AUTOMATA ', Logical Methods in Computer Science, vol. 12, no. 3, 11 . https://doi.org/10.2168/LMCS-12(3:11)2016
Logical Methods in Computer Science (LMCS)
Logical Methods in Computer Science, 12(3):11. Technical University of Braunschweig
Logical Methods in Computer Science (LMCS), 12(3:11), 1-38
Logical Methods in Computer Science, 12, 11.1-11.38
Jongmans, S-S T Q & Arbab, F 2017, ' DATA OPTIMIZATIONS FOR CONSTRAINT AUTOMATA ', Logical Methods in Computer Science, vol. 12, no. 3, 11 . https://doi.org/10.2168/LMCS-12(3:11)2016
Logical Methods in Computer Science (LMCS)
Logical Methods in Computer Science, 12(3):11. Technical University of Braunschweig
Logical Methods in Computer Science (LMCS), 12(3:11), 1-38
Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new application of CAs is implementing coordinators (i.e., compiling CAs into exec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::510bc096e1f4e775b587f4898b070ef3
https://lmcs.episciences.org/2041
https://lmcs.episciences.org/2041
Publikováno v:
MeTRiD@ETAPS
Electronic Proceedings in Theoretical Computer Science, Vol 272, Iss Proc. MeTRiD 2018, Pp 121-135 (2018)
Proceedings of the 1st International Workshop on Methods and Tools for Rigorous System Design, 121-135
STARTPAGE=121;ENDPAGE=135;TITLE=Proceedings of the 1st International Workshop on Methods and Tools for Rigorous System Design
Electronic Proceedings in Theoretical Computer Science, Vol 272, Iss Proc. MeTRiD 2018, Pp 121-135 (2018)
Proceedings of the 1st International Workshop on Methods and Tools for Rigorous System Design, 121-135
STARTPAGE=121;ENDPAGE=135;TITLE=Proceedings of the 1st International Workshop on Methods and Tools for Rigorous System Design
Reo is an interaction-centric model of concurrency for compositional specification of communication and coordination protocols. Formal verification tools exist to ensure correctness and compliance of protocols specified in Reo, which can readily be (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7381aca6d7179cecccada0c748e5782
Publikováno v:
In Electronic Notes in Theoretical Computer Science September 2002 66(4):1-15
Autor:
Arbab, F.
Publikováno v:
In Electronic Notes in Theoretical Computer Science August 2001 54:1-16
Autor:
Lankhorst, M.M., Torre, Leon van der, Proper, H.A., Arbab, F., Boer, F.S. de, Bonsangue, M., Lankhorst, M.
Publikováno v:
The Enterprise Engineering Series, 41-58. Berlin, Heidelberg : Springer Berlin Heidelberg
STARTPAGE=41;ENDPAGE=58;TITLE=The Enterprise Engineering Series
STARTPAGE=41;ENDPAGE=58;TITLE=The Enterprise Engineering Series
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::e242a2e610924d8e1f868fa0cefed2e3
http://hdl.handle.net/2066/173191
http://hdl.handle.net/2066/173191
Publikováno v:
In Theoretical Computer Science 2000 240(1):3-47
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.
Publikováno v:
Fundamentals of Software Engineering ISBN: 9783642293191
FSEN
Fundamentals of Software Engineering (4th IPM International Conference, FSEN 2011, Tehran, Iran, April 20-22, 2011. Revised Selected Papers), 112-126
STARTPAGE=112;ENDPAGE=126;TITLE=Fundamentals of Software Engineering (4th IPM International Conference, FSEN 2011, Tehran, Iran, April 20-22, 2011. Revised Selected Papers)
FSEN
Fundamentals of Software Engineering (4th IPM International Conference, FSEN 2011, Tehran, Iran, April 20-22, 2011. Revised Selected Papers), 112-126
STARTPAGE=112;ENDPAGE=126;TITLE=Fundamentals of Software Engineering (4th IPM International Conference, FSEN 2011, Tehran, Iran, April 20-22, 2011. Revised Selected Papers)
During the last two decades we modelled the behaviour of a large number of systems. We noted that different styles of modelling had quite an effect on the size of the state spaces of the modelled system. The differences were so substantial that some
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.