Ter Beek M. H., Kleijn J.
NoneSource: INFORMATION PROCESSING LETTERS, vol. 95 (issue 5), pp. 487-495
See at:
CNR IRIS 
| CNR IRIS | www.sciencedirect.com
Ter Beek M. H., Lisitsa A., Nemytykh A. P., Ravara A.
Source: THE JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, vol. 85 (issue 5), pp. 653-654
See at:
CNR IRIS 
| ISTI Repository | www.sciencedirect.com | CNR IRIS
Ter Beek M. H., Fantechi A., Semini L.
The Legacy of Stefania Gnesi.
See at:
CNR IRIS | link.springer.com | ISTI Repository | CNR IRIS | CNR IRIS
Ter Beek M. H., Koutny M., Rozenberg G.
Source: FUNDAMENTA INFORMATICAE, vol. 175 (issue 1-4), pp. v-viii
See at:
content.iospress.com | CNR IRIS | ISTI Repository | CNR IRIS
Lienhardt M., Ter Beek M. H., Damiani F.
This one-page document summarizes a paper published in JSS [1].
See at:
dl.acm.org | CNR IRIS | CNR IRIS
Schaefer I, Ter Beek M H
Track Summary
See at:
CNR IRIS | CNR IRIS | link.springer.com
Ter Beek, M H
An abstract is not available
See at:
CNR IRIS
Ter Beek M. H., Loreti M.
Source: ACM transactions on modeling and computer simulation 28 (2018): 8:1–8:4. doi:10.1145/3177772
DOI: 10.1145/3177772
Metrics:
See at:
ACM Transactions on Modeling and Computer Simulation | ISTI Repository | dl.acm.org | ACM Transactions on Modeling and Computer Simulation | CNR ExploRA
Ter Beek M H
We demonstrate an experimental tool for modelling and analysing (behavioural) variability in product families modelled as Modal Transition Systems (MTSs).
Gnesi S, Fantechi A, Ter Beek M H, Botterweck G, Becker M
An abstract is not available
See at:
dl.acm.org | CNR IRIS | CNR IRIS
Ter Beek M H, Lluch Lafuente A
Source: THE JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, vol. 87
See at:
CNR IRIS | ISTI Repository | www.sciencedirect.com | CNR IRIS | CNR IRIS
Ter Beek M. H., Fantechi A., Gnesi S.
This paper, written in honour of Tiziana Margaria, aims to provide a comprehensive presentation of where mainstream formal methods are currently used for modelling and analysis of railway applications.Source: LECTURE NOTES IN COMPUTER SCIENCE, vol. 15240, pp. 327-344
Project(s): ADVancEd iNtegraTed evalUation of Railway systEms, Sustainable Mobility National Research Center
See at:
CNR IRIS | link.springer.com | CNR IRIS | CNR IRIS
Basile D
This is the presentation of the paper "Research Challenges in Orchestration Synthesis" by Davide Basile and Maurice H. ter Beek, presented at the 16th Interaction and Concurrency Experience satellite workshop of the 18th International Federated Conference on Distributed Computing Techniques (DisCoTec 2023).
See at:
CNR IRIS | ISTI Repository | youtu.be | CNR IRIS | CNR IRIS
See at:
CNR IRIS
Gnesi S, Latella D, Massink M, Mazzanti F, Sulova A, Ter Beek M H
No abstract avaible
See at:
CNR IRIS
Ter Beek M H, Kleijn J
It is shown how Input/Output automata fit in the framework of team automata, thus making it possible to view certain notions and results regarding their modular structure as special instances of more general observations.
See at:
CNR IRIS | ISTI Repository | CNR IRIS
Ter Beek M H, Gnesi S, Mazzanti F
We demonstrate an experimental tool for the modeling and analysis of behavioral variability in product families.
See at:
dl.acm.org | CNR IRIS | CNR IRIS
Ter Beek M H, Gnesi S, Mazzanti F
Researchers from the Formal Methods and Tools group of ISTI-CNR have developed a tool for the computer-aided verification of behavioural variability in product families.Source: ERCIM NEWS, vol. 93 (issue 50), p. 51
See at:
ercim-news.ercim.eu | CNR IRIS | CNR IRIS
Ter Beek M. H., Bortolussi L., Ciancia V., Gnesi S., Hillston J., Latella D., Massink M.
It's smart to be fair. Researchers from the Formal Methods and Tools group of ISTI-CNR are working on scalable analysis techniques to support smart applications for the efficient and equitable sharing of resources in the cities of our future. The research is being carried out under the European FET-Proactive project, QUANTICOL.Project(s): QUANTICOL
See at:
ercim-news.ercim.eu | ISTI Repository | CNR ExploRA
Maurice H. Ter Beek, Jetty Kleijn
We consider a general shuffling operation for finite and infinite words which is not necessarily fair. This means that it may be the case that in a shuffle of two words, from some point onwards, one of these words prevails ad infinitum even though the other word still has letters to contribute. Prefixes and limits of shuffles are investigated, leading to a characterization of general shuffles in terms of shuffles of finite words, a result which does not hold for fair shuffles. Associativity of shuffling is an immediate corollary.Source: Theoretical computer science 380 (2007): 401–410. doi:10.1016/j.tcs.2007.03.030
DOI: 10.1016/j.tcs.2007.03.030
Metrics:
See at:
Theoretical Computer Science | www.sciencedirect.com | CNR ExploRA