Filters








1,464 Hits in 3.6 sec

Modelling and analysis of biological systems

Gabriel Ciobanu, Maciej Koutny
2012 Theoretical Computer Science  
In the second paper, Modeling Dependencies and Simultaneity in Membrane System Computations, G.M. Pinna and A.  ...  They characterize dependences and simultaneity in the occurrences of rules in membrane system computations, relate membrane systems to Petri nets, and then introduce new notions of event structures with  ...  of rewrite rules.  ... 
doi:10.1016/j.tcs.2011.12.064 fatcat:745rtf2ehnbrnbt5yh4mw5i4pi

Page 7817 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
(NL-LEID-C; Leiden) Teams in grammar systems: hybridity and weak rewriting. (English summary) Grammar systems: recent results and perspectives (Budapest, 1996).  ...  Summary: “Some new ideas in the theory of teams in grammar systems are introduced and studied.  ... 

Modeling complex systems with adaptive networks

Hiroki Sayama, Irene Pestov, Jeffrey Schmidt, Benjamin James Bush, Chun Wong, Junichi Yamanoi, Thilo Gross
2013 Computers and Mathematics with Applications  
, automated rule discovery from empirical network evolution data, and cultural integration in corporate merger.  ...  Many real-world complex systems can be modeled as adaptive networks, including social networks, transportation networks, neural networks and biological networks.  ...  graph rewriting systems typically adopt (e.g., [76] ).  ... 
doi:10.1016/j.camwa.2012.12.005 fatcat:nhdqupt4jrd6bolq5nzqfqialu

Modelling and testing timed data-flow reactive systems in Coq from controlled natural-language requirements [article]

Gustavo Carvalho, Igor Meira
2019 arXiv   pre-print
Data-flow reactive systems (DFRSs) are a class of embedded systems whose inputs and outputs are always available as signals.  ...  In previous works, verifying properties of DFRS models was accomplished in a programmatic way, with no formal guarantees, and test cases were generated by translating theses models into other notations  ...  string dec in H'. rewrite H in H'. inversion H'.  ... 
arXiv:1910.13553v1 fatcat:pucbbescavca7cx3cizcdahvgq

Adaptive LL(*) parsing

Terence Parr, Sam Harwell, Kathleen Fisher
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
ANTLR 4 generates ALL(*) parsers and supports direct left-recursion through grammar rewriting.  ...  ALL(*) is O(n 4 ) in theory but consistently performs linearly on grammars used in practice, outperforming general strategies such as GLL and GLR by orders of magnitude.  ...  Eelco Visser and Jurgen Vinju provided code to test isolated parsers from JS-GLR and Rascal. Etienne Gagnon generated SableCC parsers.  ... 
doi:10.1145/2660193.2660202 dblp:conf/oopsla/ParrHF14 fatcat:qst6nncejvbcjbk7bjopzltfx4

Bridging the chasm between MDE and the world of compilation

Jean-Marc Jézéquel, Benoit Combemale, Steven Derrien, Clément Guy, Sanjay Rajopadhye
2012 Journal of Software and Systems Modeling  
In this article, we show how SLE can lean on the expertise of both MDE and compiler research communities and how each community can bring its solutions to the other one.  ...  These two communities appear today quite complementary and are starting to meet again in the Software Language Engineering (SLE) field.  ...  MDE). ⋆ This work is the result of a close collaboration between Inria and Colorado State University (CSU), involving two teams in MDE (the Triskell team at Inria and the SE group at CSU), and 2 teams  ... 
doi:10.1007/s10270-012-0266-8 fatcat:htmyfrdbjvhkpciifeeqodl2k4

Page 7095 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
); Lucian Ilie and Arto Salomaa, On regular characterizations of languages by grammar systems (411 425); Maurice H. ter Beek, Teams in grammar systems: hybridity and weak rewriting (427-444); Rudolf Freund  ...  Contents: Jiirgen Dassow and Victor Mitrana, Fairness in gram- mar systems (331-345); Henning Bordihn and Erzsébet Csuhaj- Varju, On competence and completeness in CD grammar systems (347-360); Henning  ... 

Survey and classification of model transformation tools

Nafiseh Kahani, Mojtaba Bagherzadeh, James R. Cordy, Juergen Dingel, Daniel Varró
2018 Journal of Software and Systems Modeling  
In this paper, we compare and evaluate the current model transformation tools based on a qualitative framework.  ...  These tools can be used to develop, transform, merge, exchange, compare and verify models or meta-models.  ...  We also thank the anonymous reviewers for their valuable comments and suggestions in improving this report.  ... 
doi:10.1007/s10270-018-0665-6 fatcat:xo2spo3qynf5bnulmei3hioczi

Formal verification of timed systems: a survey and perspective

Farn Wang
2004 Proceedings of the IEEE  
An overview of the current state of the art of formal verification of real-time systems is presented.  ...  We also make a few comments according to our experience with verification tool design and implementation.  ...  Recent extensions include a BDD-like data structure for the parametric safety analysis of linear hybrid systems [221], a model-checking algorithm with weak and strong fairness assumptions, and a specification  ... 
doi:10.1109/jproc.2004.831197 fatcat:7e5u5rvdbncqbmkku7szkdyz34

The automated writing assistance landscape in 2021

Robert Dale, Jette Viethen
2021 Natural Language Engineering  
But the category has been given a substantial boost from recent advances in deep learning. We review some history, look at where things stand today, and consider where things might be going.  ...  AbstractAutomated writing assistance – a category that encompasses a variety of computer-based tools that help with writing – has been around in one form or another for 60 years, although it's always been  ...  But the only publicly well-documented commercial-grade grammar-based syntax checker remains the system used in Word (Heidorn 2000) .  ... 
doi:10.1017/s1351324921000164 fatcat:axo2ba3tonb77d2wvp3feclhuy

Data Sharing in P2P Systems [chapter]

Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib
2009 Handbook of Peer-to-Peer Networking  
In this chapter, we survey P2P data sharing systems.  ...  All along, we focus on the evolution from simple file-sharing systems, with limited functionalities, to Peer Data Management Systems (PDMS) that support advanced applications with more sophisticated data  ...  However, the semantics provided by these systems is typically weak. So far in this report, we have reviewed P2P systems that support key lookups or keyword search.  ... 
doi:10.1007/978-0-387-09751-0_19 fatcat:i5pyj3c53rc6lfdxiqnconhsiq

Towards portable natural language interfaces to knowledge bases – The case of the ORAKEL system

Philipp Cimiano, Peter Haase, Jörg Heizmann, Matthias Mantel, Rudi Studer
2008 Data & Knowledge Engineering  
In this article, we present our natural language interface ORA-KEL, describe its architecture, design choices and implementation.  ...  to a certain domain and knowledge base.  ...  , 20 SEKT 21 and X-Media. 22  ... 
doi:10.1016/j.datak.2007.10.007 fatcat:4ku5mdbvcjhbbf3lqlkt2u2kwi

Subject index volumes 101–150

1995 Theoretical Computer Science  
3P parallel operator 649 teams, aggregating N 609 term rewriting systems 36, 404, 598, 646, 801 disjoint union of N 404 modular property of N 801 term rewriting, first-order format of N 321 definition  ...  N 620-625.628 hybrid control N 627 systems hybrid realtime embedded N 628 hybrid task N 262 systems inference N 683 interacting _ 625 knowledge-base N 536 large N 385 logical N 63, 331,407  ... 
doi:10.1016/0304-3975(95)90001-2 fatcat:omihw2cp6vb2hgwdfiksnt4ftu

Subject index volumes 1–200

1999 Theoretical Computer Science  
1483 weak logical reductions, 2269 weak model, 252 1 weak monadic formulas, 1570 logic, 1732, 1802 weak monadic theory of the tree. 1802 trees, 1802 weak monotonicity in laguage learning, 2918  ...  of -, 756 pure -. 375 weak interpretation of -, 756 grammar homomorphism, 756 grammar, graph _, 3 143 grammar isomorphism, 756 problem, 756 grammar manipulation, 2729 models, 790 size, 1784  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

An Investigation into the Validity of Some Metrics for Automatically Evaluating Natural Language Generation Systems

Ehud Reiter, Anja Belz
2009 Computational Linguistics  
We review previous work on NLG evaluation and on validation of automatic metrics in NLP, and then present the results of two studies of how well some metrics which are popular in other areas of NLP (notably  ...  There is growing interest in using automatically computed corpus-based evaluation metrics to evaluate Natural Language Generation (NLG) systems, because these are often considerably cheaper than the human-based  ...  help in the evaluation experiments.  ... 
doi:10.1162/coli.2009.35.4.35405 fatcat:je6hwodwong5pfyzkywil4e4qa
« Previous Showing results 1 — 15 out of 1,464 results