callback( { "result":{ "query":":facetid:toc:\"db/journals/fuin/fuin55.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"63.92" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"21", "@dc":"21", "@oc":"21", "@id":"43452223", "text":":facetid:toc:db/journals/fuin/fuin55.bht" } }, "hits":{ "@total":"21", "@computed":"21", "@sent":"21", "@first":"0", "hit":[{ "@score":"1", "@id":"6115251", "info":{"authors":{"author":[{"@pid":"84/2622","text":"Suna Aydin"},{"@pid":"49/1455","text":"Henning Bordihn"}]},"title":"Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"243-254","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/AydinB03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-01","url":"https://dblp.org/rec/journals/fuin/AydinB03"}, "url":"URL#6115251" }, { "@score":"1", "@id":"6115255", "info":{"authors":{"author":[{"@pid":"13/4095","text":"Vladimir A. Bashkin"},{"@pid":"65/480","text":"Irina A. Lomazova"}]},"title":"Petri nets and resource bisimulation.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"101-114","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/BashkinL03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-02","url":"https://dblp.org/rec/journals/fuin/BashkinL03"}, "url":"URL#6115255" }, { "@score":"1", "@id":"6115257", "info":{"authors":{"author":[{"@pid":"73/4054","text":"Marco Bellia"},{"@pid":"o/MEOcchiuto","text":"M. Eugenia Occhiuto"}]},"title":"N-axioms Parallel Unification.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"115-128","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/BelliaO03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-03","url":"https://dblp.org/rec/journals/fuin/BelliaO03"}, "url":"URL#6115257" }, { "@score":"1", "@id":"6115259", "info":{"authors":{"author":[{"@pid":"b/SLBloom","text":"Stephen L. Bloom"},{"@pid":"e/ZoltanEsik","text":"Zoltán Ésik"}]},"title":"Deciding whether the frontier of a regular tree is scattered.","venue":"Fundam. Informaticae","volume":"55","number":"1","pages":"1-21","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/BloomE03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-1-01","url":"https://dblp.org/rec/journals/fuin/BloomE03"}, "url":"URL#6115259" }, { "@score":"1", "@id":"6115261", "info":{"authors":{"author":[{"@pid":"88/1366","text":"Gianpiero Cattaneo"},{"@pid":"42/2146","text":"Davide Ciucci"}]},"title":"Shadowed Sets and Related Algebraic Structures.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"255-284","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/CattaneoC03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-02","url":"https://dblp.org/rec/journals/fuin/CattaneoC03"}, "url":"URL#6115261" }, { "@score":"1", "@id":"6115263", "info":{"authors":{"author":[{"@pid":"30/6143","text":"Jean-Marc Champarnaud"},{"@pid":"79/5612","text":"Fabien Coulon"}]},"title":"Theoretical study and implementation of the canonical automaton.","venue":"Fundam. Informaticae","volume":"55","number":"1","pages":"23-38","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/ChamparnaudC03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-1-02","url":"https://dblp.org/rec/journals/fuin/ChamparnaudC03"}, "url":"URL#6115263" }, { "@score":"1", "@id":"6115265", "info":{"authors":{"author":[{"@pid":"07/5201","text":"Bogdan S. Chlebus"},{"@pid":"g/LeszekGasieniec","text":"Leszek Gasieniec"},{"@pid":"p/AndrzejPelc","text":"Andrzej Pelc"}]},"title":"Deterministic Computations on a PRAM with Static Processor and Memory Faults.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"285-306","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/ChlebusGP03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-03","url":"https://dblp.org/rec/journals/fuin/ChlebusGP03"}, "url":"URL#6115265" }, { "@score":"1", "@id":"6115273", "info":{"authors":{"author":{"@pid":"09/3809","text":"Razvan Diaconescu"}},"title":"Institution-independent Ultraproducts.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"321-348","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/Diaconescu03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-05","url":"https://dblp.org/rec/journals/fuin/Diaconescu03"}, "url":"URL#6115273" }, { "@score":"1", "@id":"6115274", "info":{"authors":{"author":{"@pid":"50/3644","text":"Liviu Petrisor Dinu"}},"title":"On the Classification and Aggregation of Hierarchies with Different Constitutive Elements.","venue":"Fundam. Informaticae","volume":"55","number":"1","pages":"39-50","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/Dinu03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-1-03","url":"https://dblp.org/rec/journals/fuin/Dinu03"}, "url":"URL#6115274" }, { "@score":"1", "@id":"6115281", "info":{"authors":{"author":[{"@pid":"134/4889","text":"Berndt Farwer"},{"@pid":"88/3731","text":"Kundan Misra"}]},"title":"Modelling with Hierarchical Object Petri Nets.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"129-147","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/FarwerM03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-04","url":"https://dblp.org/rec/journals/fuin/FarwerM03"}, "url":"URL#6115281" }, { "@score":"1", "@id":"6115297", "info":{"authors":{"author":{"@pid":"01/4366","text":"Maciej Kandulski"}},"title":"Derived Tree Languages of Nonassociative Lambek Categorial Grammars with Product.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"349-362","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/Kandulski03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-06","url":"https://dblp.org/rec/journals/fuin/Kandulski03"}, "url":"URL#6115297" }, { "@score":"1", "@id":"6115310", "info":{"authors":{"author":[{"@pid":"81/2193","text":"Cheng-Chi Lee"},{"@pid":"20/5454","text":"Wei-Pang Yang"},{"@pid":"91/6534","text":"Min-Shiang Hwang"}]},"title":"Untraceable Blind Signature Schemes Based on Discrete Logarithm Problem.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"307-320","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/LeeYH03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-04","url":"https://dblp.org/rec/journals/fuin/LeeYH03"}, "url":"URL#6115310" }, { "@score":"1", "@id":"6115311", "info":{"authors":{"author":[{"@pid":"30/4051","text":"Sanjiang Li"},{"@pid":"13/6525","text":"Mingsheng Ying"}]},"title":"Extensionality of the RCC8 Composition Table.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"363-385","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/LiY03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-07","url":"https://dblp.org/rec/journals/fuin/LiY03"}, "url":"URL#6115311" }, { "@score":"1", "@id":"6115320", "info":{"authors":{"author":{"@pid":"m/MJMoshkov","text":"Mikhail Ju. Moshkov"}},"title":"Compressible Infinite Information Systems.","venue":"Fundam. Informaticae","volume":"55","number":"1","pages":"51-61","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/Moshkov03a","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-1-04","url":"https://dblp.org/rec/journals/fuin/Moshkov03a"}, "url":"URL#6115320" }, { "@score":"1", "@id":"6115321", "info":{"authors":{"author":{"@pid":"00/2953","text":"Linh Anh Nguyen"}},"title":"A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs.","venue":"Fundam. Informaticae","volume":"55","number":"1","pages":"63-100","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/Nguyen03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-1-05","url":"https://dblp.org/rec/journals/fuin/Nguyen03"}, "url":"URL#6115321" }, { "@score":"1", "@id":"6115325", "info":{"authors":{"author":[{"@pid":"93/6308","text":"Krzysztof Pancerz"},{"@pid":"08/6778","text":"Zbigniew Suraj"}]},"title":"Synthesis of Petri Net Models: A Rough Set Approach.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"149-165","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/PancerzS03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-05","url":"https://dblp.org/rec/journals/fuin/PancerzS03"}, "url":"URL#6115325" }, { "@score":"1", "@id":"6115327", "info":{"authors":{"author":[{"@pid":"58/2583","text":"Wojciech Penczek"},{"@pid":"l/AlessioLomuscio","text":"Alessio Lomuscio"}]},"title":"Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"167-185","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/PenczekL03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-06","url":"https://dblp.org/rec/journals/fuin/PenczekL03"}, "url":"URL#6115327" }, { "@score":"1", "@id":"6115329", "info":{"authors":{"author":[{"@pid":"10/5823","text":"Agata Pólrola"},{"@pid":"58/2583","text":"Wojciech Penczek"},{"@pid":"69/6183","text":"Maciej Szreter"}]},"title":"Reachability Analysis for Timed Automata Using Partitioning Algorithms.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"203-221","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/PolrolaPS03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-08","url":"https://dblp.org/rec/journals/fuin/PolrolaPS03"}, "url":"URL#6115329" }, { "@score":"1", "@id":"6115330", "info":{"authors":{"author":[{"@pid":"12/3724","text":"Louchka Popova-Zeugmann"},{"@pid":"05/996-1","text":"Matthias Werner 0001"},{"@pid":"26/5912","text":"Jan Richling"}]},"title":"Using State Equation to Prove Non-Reachability in Timed Petrinets.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"187-202","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/Popova-ZeugmannWR03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-07","url":"https://dblp.org/rec/journals/fuin/Popova-ZeugmannWR03"}, "url":"URL#6115330" }, { "@score":"1", "@id":"6115345", "info":{"authors":{"author":[{"@pid":"32/1225","text":"Karsten Weicker"},{"@pid":"75/1597","text":"Nicole Weicker"}]},"title":"Basic principles for understanding evolutionary algorithms.","venue":"Fundam. Informaticae","volume":"55","number":"3-4","pages":"387-403","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/WeickerW03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-3-4-08","url":"https://dblp.org/rec/journals/fuin/WeickerW03"}, "url":"URL#6115345" }, { "@score":"1", "@id":"6115349", "info":{"authors":{"author":[{"@pid":"73/567","text":"Bozena Wozna"},{"@pid":"12/159","text":"Andrzej Zbrzezny"},{"@pid":"58/2583","text":"Wojciech Penczek"}]},"title":"Checking Reachability Properties for Timed Automata via SAT.","venue":"Fundam. Informaticae","volume":"55","number":"2","pages":"223-241","year":"2003","type":"Journal Articles","access":"closed","key":"journals/fuin/WoznaZP03","ee":"http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-09","url":"https://dblp.org/rec/journals/fuin/WoznaZP03"}, "url":"URL#6115349" } ] } } } )