default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFundamenta Informaticae, Volume 143
Volume 143, Numbers 1-2, 2016
- Ludwik Czaja, Wojciech Penczek
, Krzysztof Stencel:
Preface. v-vi
- Jan G. Bazan, Stanislawa Bazan-Socha, Sylwia Buregwa-Czuma, Lukasz Dydo, Wojciech Rzasa, Andrzej Skowron:
A Classifier Based on a Decision Tree with Verifying Cuts. 1-18 - Jan G. Bazan, Adam Szczur, Lukasz Dydo, Hubert Wojtowicz, Marcin Szpyrka:
Classifiers for Behavioral Patterns Identification Induced from Huge Temporal Data. 19-34 - Marco Bellia, M. Eugenia Occhiuto:
Programming Self-Assembly of DNA Tiles. 35-49 - Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics. 51-71 - Damas P. Gruska:
Differential Privacy and Security. 73-87 - Michael Köhler-Bußmeier, Frank Heitmann:
An Upper Bound for the Reachability Problem of Safe, Elementary Hornets. 89-100 - Irina A. Lomazova, Louchka Popova-Zeugmann:
Controlling Petri Net Behavior using Priorities for Transitions. 101-112 - Linh Anh Nguyen:
A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic. 113-139 - Roman R. Redziejowski:
Cut Points in PEG. 141-149 - Zbigniew Suraj, Agnieszka Lasek, Piotr Lasek:
Inverted Fuzzy Implications in Approximate Reasoning. 151-171 - Bozena Wozna-Szczesniak:
SAT-based Bounded Model Checking for Weighted Deontic Interpreted Systems. 173-205
Volume 143, Numbers 3-4, 2016
- Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov:
Preface. i-ii
- S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier:
Robustness of Time Petri Nets under Guard Enlargement. 207-234 - Béatrice Bérard, Serge Haddad, Aleksandra Jovanovic, Didier Lime:
Interrupt Timed Automata with Auxiliary Clocks and Parameters. 235-259 - Stefano Brocchi, Paolo Massazza:
A New Sandpile Model with Smoothness Assumptions. 261-286 - Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso:
Adding Data Registers to Parameterized Networks with Broadcast. 287-316 - Christoph Haase, Joël Ouaknine, James Worrell:
Relating Reachability Problems in Timed and Counter Automata. 317-338 - Richard Mayr, Patrick Totzke:
Branching-Time Model Checking Gap-Order Constraint Systems. 339-353 - Ernst W. Mayr, Jeremias Weihmann:
Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities. 355-391 - Artturi Piipponen, Antti Valmari:
Constructing Minimal Coverability Sets. 393-414 - Julien Reichert:
On The Complexity of Counter Reachability Games. 415-436
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.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
