default search action
Fundamenta Informaticae, Volume 131
Volume 131, Number 1, 2014
- Serge Haddad, Jetty Kleijn, Lucia Pomello:
Preface. - Antti Valmari, Henri Hansen:
Old and New Algorithms for Minimal Coverability Sets. 1-25 - Sami Evangelista, Lars Michael Kristensen:
A Sweep-Line Method for Büchi Automata-based Model Checking. 27-53 - María Martos-Salgado, Fernando Rosa-Velardo:
Safety and Soundness for Priced Resource-Constrained Workflow Nets. 55-80 - Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong:
Complexity of the Soundness Problem of Workflow Nets. 81-101 - Wil M. P. van der Aalst, H. M. W. Verbeek:
Process Discovery and Conformance Checking Using Passages. 103-138 - Veronica Gil-Costa, Mauricio Marín, Alonso Inostrosa-Psijas, Jair Lobos, Carolina Bonacic:
Modelling Search Engines Performance Using Coloured Petri Nets. 139-166
Volume 131, Number 2, 2014
- Chin-Chen Chang, Ting-Fang Cheng:
A Reliable Real-time Multicast Authentication Protocol with Provable Accuracy. 167-186 - Lavinia Egidi, Giovanni Manzini:
Spaced Seed Design Using Perfect Rulers. 187-203 - Jouni Järvinen, Sándor Radeleczki:
Monteiro Spaces and Rough Sets Determined by Quasiorder Relations: Models for Nelson algebras. 205-215 - Jerzy Marcinkowski, Jakub Michaliszyn:
The Undecidability of the Logic of Subintervals. 217-240 - Lukasz Przytula:
NAO Soccer Robots Path Planning Based on Rough Mereology. 241-251 - Artur Rataj:
Evolvability by Mimicking Common Properties of a Nervous System and Computer Software. 253-278
Volume 131, Numbers 3-4, 2014
- Cristian S. Calude, Marian Gheorghe:
Preface. - Andrei Alexandru, Gabriel Ciobanu:
Nominal Groups and Their Homomorphism Theorems. 279-298 - Sepinoud Azimi, Bogdan Iancu, Ion Petre:
Reaction System Models for the Heat Shock Response. 299-312 - Iulia Teodora Banu-Demergian, Gheorghe Stefanescu:
Towards a Formal Representation of Interactive Systems. 313-336 - Paolo Bottoni, Anna Labella, Victor Mitrana:
Accepting Networks of Evolutionary Picture Processors. 337-349 - Luca Cardelli, Radu Mardare:
The Measurable Space of Stochastic Processes. 351-371 - Gabriel Ciobanu, Eneia Nicolae Todoran:
Continuation Semantics for Asynchronous Concurrency. 373-388 - Catalin Dima:
A Nonarchimedian Discretization for Timed Languages. 389-407 - Liviu P. Dinu, Radu Gramatovici, Florin Manea:
Syllabic Languages and Go-through Automata. 409-424 - Nicolae Duta:
Natural Language Understanding and Prediction: from Formal Grammars to Large Scale Machine Learning. 425-440 - Cristian Grozea, Marius Popescu:
Can Machine Learning Learn a Decision Oracle for NP Problems? A Test on SAT. 441-450 - Kamala Krithivasan, Gheorghe Paun, Ajeesh Ramanujan:
On Controlled P Systems. 451-464 - Radu Nicolescu, Georgy L. Gimel'farb, John Morris, Patrice Delmas, Rui Gong:
Regularising Ill-posed Discrete Optimisation: Quests with P Systems. 465-483 - Marius Zimand:
Counting Dependent and Independent Strings. 485-497
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.