Publisher: Springer-Verlag (Total: 2626 journals)

 A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Showing 1 - 200 of 2626 Journals sorted alphabetically
3D Printing in Medicine     Open Access   (Followers: 5)
3D Research     Hybrid Journal   (Followers: 21, SJR: 0.222, CiteScore: 1)
4OR: A Quarterly J. of Operations Research     Hybrid Journal   (Followers: 13, SJR: 0.825, CiteScore: 1)
AAPS J.     Hybrid Journal   (Followers: 31, SJR: 1.118, CiteScore: 4)
AAPS PharmSciTech     Hybrid Journal   (Followers: 9, SJR: 0.752, CiteScore: 3)
Abdominal Radiology     Hybrid Journal   (Followers: 22, SJR: 0.866, CiteScore: 2)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 4, SJR: 0.439, CiteScore: 0)
aBIOTECH : An Intl. J. on Plant Biotechnology and Agricultural Sciences     Hybrid Journal   (Followers: 2)
Academic Psychiatry     Full-text available via subscription   (Followers: 31, SJR: 0.53, CiteScore: 1)
Academic Questions     Hybrid Journal   (Followers: 9, SJR: 0.106, CiteScore: 0)
Accreditation and Quality Assurance: J. for Quality, Comparability and Reliability in Chemical Measurement     Hybrid Journal   (Followers: 34, SJR: 0.316, CiteScore: 1)
Acoustical Physics     Hybrid Journal   (Followers: 12, SJR: 0.359, CiteScore: 1)
Acoustics Australia     Hybrid Journal   (Followers: 2, SJR: 0.232, CiteScore: 1)
Acta Analytica     Hybrid Journal   (Followers: 7, SJR: 0.367, CiteScore: 0)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 1, SJR: 0.675, CiteScore: 1)
Acta Biotheoretica     Hybrid Journal   (Followers: 3, SJR: 0.284, CiteScore: 1)
Acta Diabetologica     Hybrid Journal   (Followers: 19, SJR: 1.587, CiteScore: 3)
Acta Endoscopica     Hybrid Journal   (Followers: 1)
acta ethologica     Hybrid Journal   (Followers: 4, SJR: 0.769, CiteScore: 1)
Acta Geochimica     Hybrid Journal   (Followers: 8, SJR: 0.24, CiteScore: 1)
Acta Geodaetica et Geophysica     Hybrid Journal   (Followers: 3, SJR: 0.305, CiteScore: 1)
Acta Geophysica     Hybrid Journal   (Followers: 11, SJR: 0.312, CiteScore: 1)
Acta Geotechnica     Hybrid Journal   (Followers: 7, SJR: 1.588, CiteScore: 3)
Acta Informatica     Hybrid Journal   (Followers: 5, SJR: 0.517, CiteScore: 1)
Acta Mathematica     Hybrid Journal   (Followers: 13, SJR: 7.066, CiteScore: 3)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 2, SJR: 0.452, CiteScore: 1)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 6, SJR: 0.379, CiteScore: 1)
Acta Mathematica Vietnamica     Hybrid Journal   (SJR: 0.27, CiteScore: 0)
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal   (SJR: 0.208, CiteScore: 0)
Acta Mechanica     Hybrid Journal   (Followers: 25, SJR: 1.04, CiteScore: 2)
Acta Mechanica Sinica     Hybrid Journal   (Followers: 5, SJR: 0.607, CiteScore: 2)
Acta Metallurgica Sinica (English Letters)     Hybrid Journal   (Followers: 9, SJR: 0.576, CiteScore: 2)
Acta Meteorologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.638, CiteScore: 1)
Acta Neurochirurgica     Hybrid Journal   (Followers: 7, SJR: 0.822, CiteScore: 2)
Acta Neurologica Belgica     Hybrid Journal   (Followers: 3, SJR: 0.376, CiteScore: 1)
Acta Neuropathologica     Hybrid Journal   (Followers: 5, SJR: 7.589, CiteScore: 12)
Acta Oceanologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.334, CiteScore: 1)
Acta Physiologiae Plantarum     Hybrid Journal   (Followers: 4, SJR: 0.574, CiteScore: 2)
Acta Politica     Hybrid Journal   (Followers: 19, SJR: 0.605, CiteScore: 1)
Activitas Nervosa Superior     Hybrid Journal   (SJR: 0.147, CiteScore: 0)
Adaptive Human Behavior and Physiology     Hybrid Journal   (Followers: 1)
adhäsion KLEBEN & DICHTEN     Hybrid Journal   (Followers: 9, SJR: 0.103, CiteScore: 0)
ADHD Attention Deficit and Hyperactivity Disorders     Hybrid Journal   (Followers: 28, SJR: 0.72, CiteScore: 2)
Adhesion Adhesives & Sealants     Hybrid Journal   (Followers: 11)
Administration and Policy in Mental Health and Mental Health Services Research     Partially Free   (Followers: 21, SJR: 1.005, CiteScore: 2)
Adolescent Research Review     Hybrid Journal   (Followers: 2)
Adsorption     Hybrid Journal   (Followers: 5, SJR: 0.703, CiteScore: 2)
Advanced Composites and Hybrid Materials     Hybrid Journal  
Advanced Fiber Materials     Full-text available via subscription  
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 4, SJR: 0.698, CiteScore: 1)
Advances in Astronautics Science and Technology     Hybrid Journal  
Advances in Atmospheric Sciences     Hybrid Journal   (Followers: 42, SJR: 0.956, CiteScore: 2)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 23, SJR: 0.812, CiteScore: 1)
Advances in Contraception     Hybrid Journal   (Followers: 3)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 57, SJR: 1.09, CiteScore: 1)
Advances in Gerontology     Partially Free   (Followers: 8, SJR: 0.144, CiteScore: 0)
Advances in Health Sciences Education     Hybrid Journal   (Followers: 36, SJR: 1.64, CiteScore: 2)
Advances in Manufacturing     Hybrid Journal   (Followers: 5, SJR: 0.475, CiteScore: 2)
Advances in Neurodevelopmental Disorders     Hybrid Journal   (Followers: 2)
Advances in Operator Theory     Hybrid Journal   (Followers: 4)
Advances in Polymer Science     Hybrid Journal   (Followers: 50, SJR: 1.04, CiteScore: 3)
Advances in Therapy     Hybrid Journal   (Followers: 5, SJR: 1.075, CiteScore: 3)
Advances in Traditional Medicine     Hybrid Journal   (Followers: 4)
Adversity and Resilience Science : J. of Research and Practice     Hybrid Journal   (Followers: 3)
Aegean Review of the Law of the Sea and Maritime Law     Hybrid Journal   (Followers: 9)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2, SJR: 0.517, CiteScore: 1)
Aerobiologia     Hybrid Journal   (Followers: 4, SJR: 0.673, CiteScore: 2)
Aerosol Science and Engineering     Hybrid Journal  
Aerospace Systems     Hybrid Journal   (Followers: 1)
Aerotecnica Missili & Spazio : J. of Aerospace Science, Technologies & Systems     Hybrid Journal  
Aesthetic Plastic Surgery     Hybrid Journal   (Followers: 12, SJR: 0.825, CiteScore: 1)
Affective Science     Hybrid Journal   (Followers: 2)
African Archaeological Review     Hybrid Journal   (Followers: 20, SJR: 0.862, CiteScore: 1)
Afrika Matematika     Hybrid Journal   (Followers: 3, SJR: 0.235, CiteScore: 0)
Ageing Intl.     Hybrid Journal   (Followers: 8, SJR: 0.39, CiteScore: 1)
Aggiornamenti CIO     Hybrid Journal   (Followers: 1)
Aging Clinical and Experimental Research     Hybrid Journal   (Followers: 3, SJR: 0.67, CiteScore: 2)
Agricultural Research     Hybrid Journal   (Followers: 7, SJR: 0.276, CiteScore: 1)
Agriculture and Human Values     Open Access   (Followers: 15, SJR: 1.173, CiteScore: 3)
Agroforestry Systems     Open Access   (Followers: 20, SJR: 0.663, CiteScore: 1)
Agronomy for Sustainable Development     Open Access   (Followers: 19, SJR: 1.864, CiteScore: 6)
AI & Society     Hybrid Journal   (Followers: 9, SJR: 0.227, CiteScore: 1)
AIDS and Behavior     Hybrid Journal   (Followers: 18, SJR: 1.792, CiteScore: 3)
Air Quality, Atmosphere & Health     Hybrid Journal   (Followers: 7, SJR: 0.862, CiteScore: 3)
Akupunktur & Aurikulomedizin     Full-text available via subscription   (Followers: 1)
Algebra and Logic     Hybrid Journal   (Followers: 7, SJR: 0.531, CiteScore: 0)
Algebra Universalis     Hybrid Journal   (Followers: 2, SJR: 0.583, CiteScore: 1)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1, SJR: 1.095, CiteScore: 1)
Algorithmica     Hybrid Journal   (Followers: 9, SJR: 0.56, CiteScore: 1)
Allergo J.     Full-text available via subscription   (Followers: 2, SJR: 0.234, CiteScore: 0)
Allergo J. Intl.     Hybrid Journal   (Followers: 2)
Alpine Botany     Hybrid Journal   (Followers: 5, SJR: 1.11, CiteScore: 3)
ALTEX : Alternatives to Animal Experimentation     Open Access   (Followers: 2)
AMBIO     Hybrid Journal   (Followers: 9, SJR: 1.569, CiteScore: 4)
American J. of Cardiovascular Drugs     Hybrid Journal   (Followers: 18, SJR: 0.951, CiteScore: 3)
American J. of Community Psychology     Hybrid Journal   (Followers: 32, SJR: 1.329, CiteScore: 2)
American J. of Criminal Justice     Hybrid Journal   (Followers: 9, SJR: 0.772, CiteScore: 1)
American J. of Cultural Sociology     Hybrid Journal   (Followers: 22, SJR: 0.46, CiteScore: 1)
American J. of Dance Therapy     Hybrid Journal   (Followers: 9, SJR: 0.181, CiteScore: 0)
American J. of Potato Research     Hybrid Journal   (Followers: 3, SJR: 0.611, CiteScore: 1)
American J. of Psychoanalysis     Hybrid Journal   (Followers: 22, SJR: 0.314, CiteScore: 0)
American Sociologist     Hybrid Journal   (Followers: 16, SJR: 0.35, CiteScore: 0)
Amino Acids     Hybrid Journal   (Followers: 7, SJR: 1.135, CiteScore: 3)
AMS Review     Partially Free   (Followers: 4)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 11, SJR: 0.211, CiteScore: 1)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 6, SJR: 0.536, CiteScore: 1)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Analysis of Verbal Behavior     Hybrid Journal   (Followers: 6)
Analytical and Bioanalytical Chemistry     Hybrid Journal   (Followers: 32, SJR: 0.978, CiteScore: 3)
Anatomical Science Intl.     Hybrid Journal   (Followers: 3, SJR: 0.367, CiteScore: 1)
Angewandte Schmerztherapie und Palliativmedizin     Hybrid Journal  
Angiogenesis     Hybrid Journal   (Followers: 3, SJR: 2.177, CiteScore: 5)
Animal Cognition     Hybrid Journal   (Followers: 23, SJR: 1.389, CiteScore: 3)
Annales françaises de médecine d'urgence     Hybrid Journal   (Followers: 1, SJR: 0.192, CiteScore: 0)
Annales Henri Poincaré     Hybrid Journal   (Followers: 3, SJR: 1.097, CiteScore: 2)
Annales mathématiques du Québec     Hybrid Journal   (Followers: 4, SJR: 0.438, CiteScore: 0)
Annali dell'Universita di Ferrara     Hybrid Journal   (SJR: 0.429, CiteScore: 0)
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1, SJR: 1.197, CiteScore: 1)
Annals of Biomedical Engineering     Hybrid Journal   (Followers: 19, SJR: 1.042, CiteScore: 3)
Annals of Combinatorics     Hybrid Journal   (Followers: 4, SJR: 0.932, CiteScore: 1)
Annals of Data Science     Hybrid Journal   (Followers: 13)
Annals of Dyslexia     Hybrid Journal   (Followers: 11, SJR: 0.85, CiteScore: 2)
Annals of Finance     Hybrid Journal   (Followers: 37, SJR: 0.579, CiteScore: 1)
Annals of Forest Science     Hybrid Journal   (Followers: 7, SJR: 0.986, CiteScore: 2)
Annals of Functional Analysis     Hybrid Journal   (Followers: 4)
Annals of Global Analysis and Geometry     Hybrid Journal   (Followers: 1, SJR: 1.228, CiteScore: 1)
Annals of Hematology     Hybrid Journal   (Followers: 15, SJR: 1.043, CiteScore: 2)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 14, SJR: 0.413, CiteScore: 1)
Annals of Microbiology     Hybrid Journal   (Followers: 13, SJR: 0.479, CiteScore: 2)
Annals of Nuclear Medicine     Hybrid Journal   (Followers: 4, SJR: 0.687, CiteScore: 2)
Annals of Operations Research     Hybrid Journal   (Followers: 11, SJR: 0.943, CiteScore: 2)
Annals of Ophthalmology     Hybrid Journal   (Followers: 14)
Annals of PDE     Hybrid Journal   (Followers: 1)
Annals of Regional Science     Hybrid Journal   (Followers: 9, SJR: 0.614, CiteScore: 1)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
Annals of Solid and Structural Mechanics     Hybrid Journal   (Followers: 11, SJR: 0.239, CiteScore: 1)
Annals of Surgical Oncology     Hybrid Journal   (Followers: 19, SJR: 1.986, CiteScore: 4)
Annals of Telecommunications     Hybrid Journal   (Followers: 8, SJR: 0.223, CiteScore: 1)
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1, SJR: 1.495, CiteScore: 1)
Antonie van Leeuwenhoek     Hybrid Journal   (Followers: 5, SJR: 0.834, CiteScore: 2)
Apidologie     Hybrid Journal   (Followers: 5, SJR: 1.22, CiteScore: 3)
APOPTOSIS     Hybrid Journal   (Followers: 9, SJR: 1.424, CiteScore: 4)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 3, SJR: 0.294, CiteScore: 1)
Applications of Mathematics     Hybrid Journal   (Followers: 3, SJR: 0.602, CiteScore: 1)
Applied Biochemistry and Biotechnology     Hybrid Journal   (Followers: 42, SJR: 0.571, CiteScore: 2)
Applied Biochemistry and Microbiology     Hybrid Journal   (Followers: 20, SJR: 0.21, CiteScore: 1)
Applied Categorical Structures     Hybrid Journal   (Followers: 4, SJR: 0.49, CiteScore: 0)
Applied Composite Materials     Hybrid Journal   (Followers: 53, SJR: 0.58, CiteScore: 2)
Applied Entomology and Zoology     Partially Free   (Followers: 7, SJR: 0.422, CiteScore: 1)
Applied Geomatics     Hybrid Journal   (Followers: 3, SJR: 0.733, CiteScore: 3)
Applied Geophysics     Hybrid Journal   (Followers: 11, SJR: 0.488, CiteScore: 1)
Applied Intelligence     Hybrid Journal   (Followers: 15, SJR: 0.6, CiteScore: 2)
Applied Magnetic Resonance     Hybrid Journal   (Followers: 4, SJR: 0.319, CiteScore: 1)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 10, SJR: 0.886, CiteScore: 1)
Applied Mathematics - A J. of Chinese Universities     Hybrid Journal   (Followers: 1, SJR: 0.17, CiteScore: 0)
Applied Mathematics and Mechanics     Hybrid Journal   (Followers: 5, SJR: 0.461, CiteScore: 1)
Applied Microbiology and Biotechnology     Hybrid Journal   (Followers: 71, SJR: 1.182, CiteScore: 4)
Applied Physics A     Hybrid Journal   (Followers: 11, SJR: 0.481, CiteScore: 2)
Applied Physics B: Lasers and Optics     Hybrid Journal   (Followers: 27, SJR: 0.74, CiteScore: 2)
Applied Psychophysiology and Biofeedback     Hybrid Journal   (Followers: 8, SJR: 0.519, CiteScore: 2)
Applied Research in Quality of Life     Hybrid Journal   (Followers: 12, SJR: 0.316, CiteScore: 1)
Applied Solar Energy     Hybrid Journal   (Followers: 21, SJR: 0.225, CiteScore: 0)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 6, SJR: 0.542, CiteScore: 1)
Aquaculture Intl.     Hybrid Journal   (Followers: 26, SJR: 0.591, CiteScore: 2)
Aquarium Sciences and Conservation     Hybrid Journal   (Followers: 2)
Aquatic Ecology     Hybrid Journal   (Followers: 38, SJR: 0.656, CiteScore: 2)
Aquatic Geochemistry     Hybrid Journal   (Followers: 3, SJR: 0.591, CiteScore: 1)
Aquatic Sciences     Hybrid Journal   (Followers: 14, SJR: 1.109, CiteScore: 3)
Arabian J. for Science and Engineering     Hybrid Journal   (Followers: 5, SJR: 0.303, CiteScore: 1)
Arabian J. of Geosciences     Hybrid Journal   (Followers: 2, SJR: 0.319, CiteScore: 1)
Archaeological and Anthropological Sciences     Hybrid Journal   (Followers: 24, SJR: 1.052, CiteScore: 2)
Archaeologies     Hybrid Journal   (Followers: 13, SJR: 0.224, CiteScore: 0)
Archiv der Mathematik     Hybrid Journal   (Followers: 1, SJR: 0.725, CiteScore: 1)
Archival Science     Hybrid Journal   (Followers: 70, SJR: 0.745, CiteScore: 2)
Archive for History of Exact Sciences     Hybrid Journal   (Followers: 7, SJR: 0.186, CiteScore: 1)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 3, SJR: 0.909, CiteScore: 1)
Archive for Rational Mechanics and Analysis     Hybrid Journal   (Followers: 1, SJR: 3.93, CiteScore: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 6, SJR: 0.79, CiteScore: 2)
Archives and Museum Informatics     Hybrid Journal   (Followers: 182, SJR: 0.101, CiteScore: 0)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 6, SJR: 1.41, CiteScore: 5)
Archives of Dermatological Research     Hybrid Journal   (Followers: 7, SJR: 1.006, CiteScore: 2)
Archives of Environmental Contamination and Toxicology     Hybrid Journal   (Followers: 14, SJR: 0.773, CiteScore: 2)
Archives of Gynecology and Obstetrics     Hybrid Journal   (Followers: 19, SJR: 0.956, CiteScore: 2)
Archives of Microbiology     Hybrid Journal   (Followers: 10, SJR: 0.644, CiteScore: 2)
Archives of Orthopaedic and Trauma Surgery     Hybrid Journal   (Followers: 10, SJR: 1.146, CiteScore: 2)
Archives of Osteoporosis     Hybrid Journal   (Followers: 2, SJR: 0.71, CiteScore: 2)
Archives of Sexual Behavior     Hybrid Journal   (Followers: 11, SJR: 1.493, CiteScore: 3)
Archives of Toxicology     Hybrid Journal   (Followers: 19, SJR: 1.541, CiteScore: 5)
Archives of Virology     Hybrid Journal   (Followers: 5, SJR: 0.973, CiteScore: 2)
Archives of Women's Mental Health     Hybrid Journal   (Followers: 18, SJR: 1.274, CiteScore: 3)
Archivio di Ortopedia e Reumatologia     Hybrid Journal  
Archivum Immunologiae et Therapiae Experimentalis     Hybrid Journal   (Followers: 2, SJR: 0.946, CiteScore: 3)
ArgoSpine News & J.     Hybrid Journal  
Argumentation     Hybrid Journal   (Followers: 6, SJR: 0.349, CiteScore: 1)
Arid Ecosystems     Hybrid Journal   (Followers: 3, SJR: 0.2, CiteScore: 0)
Arkiv för Matematik     Hybrid Journal   (Followers: 1, SJR: 0.766, CiteScore: 1)
arktos : The J. of Arctic Geosciences     Hybrid Journal  
Arnold Mathematical J.     Hybrid Journal   (Followers: 1, SJR: 0.355, CiteScore: 0)
Arthropod-Plant Interactions     Hybrid Journal   (Followers: 2, SJR: 0.839, CiteScore: 2)
Arthroskopie     Hybrid Journal   (Followers: 1, SJR: 0.131, CiteScore: 0)

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Similar Journals
Journal Cover
Acta Informatica
Journal Prestige (SJR): 0.517
Citation Impact (citeScore): 1
Number of Followers: 5  
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1432-0525 - ISSN (Online) 0001-5903
Published by Springer-Verlag Homepage  [2626 journals]
  • Nested antichains for WS1S
    • Abstract: Abstract We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure implemented e.g. in Mona. The way in which the standard decision procedure processes quantifiers involves determinization, with its worst case exponential complexity, for every quantifier alternation in the prefix of a formula. Our algorithm avoids building the deterministic automata—instead, it constructs only those of their states needed for (dis)proving validity of the formula. It uses a symbolic representation of the states, which have a deeply nested structure stemming from the repeated implicit subset construction, and prunes the search space by a nested subsumption relation, a generalization of the one used by the so-called antichain algorithms for handling nondeterministic automata. We have obtained encouraging experimental results, in some cases outperforming Mona, and some of the other recently proposed approaches, by several orders of magnitude.
      PubDate: 2019-04-01
  • Associative composition of components with double-sided interfaces
    • Abstract: Distributed systems are often organized in chains of components (e.g. business process chains), where each component naturally has a double-sided (left and right) interface. We suggest a corresponding, highly abstract and general framework (in mathematical terms: a monoid) of components and their composition, with minimal assumptions on the underlying global infrastructure (in fact, just a global set of symbols). As a fundamental property, decisive for the composition of more than two components, composition of such properties turns out to be associative. We discuss a number of instantiations of this framework (mainly classes of Petri nets), some of which preserve important properties (such as soundness of workflows) under composition. We glance at a number of generalizations and specializations.
      PubDate: 2019-04-01
  • Reversible sessions with flexible choices
    • Abstract: Abstract We propose a calculus for concurrent reversible multiparty sessions, equipped with a flexible choice operator allowing for different sets of participants in each branch. This operator is inspired by the notion of connecting action recently introduced by Hu and Yoshida to describe protocols with optional participants. We argue that this choice operator allows for a natural description of typical communication protocols. Our calculus also supports a compact representation of the history of processes and types, which facilitates the definition of rollback. Moreover, it implements a fine-tuned strategy for backward computation. We present a session type system for the calculus and show that it enforces the expected properties of session fidelity, forward progress and backward progress.
      PubDate: 2019-03-01
  • Distributive laws for monotone specifications
    • Abstract: Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical generalisation of the classical GSOS rule format, as well as its categorical dual, coGSOS. Both formats are well behaved, in the sense that each specification has a unique model on which behavioural equivalence is a congruence. Unfortunately, the combination of the two formats does not feature these desirable properties. We show that monotone specifications—that disallow negative premises—do induce a canonical distributive law of a monad over a comonad, and therefore a unique, compositional interpretation.
      PubDate: 2019-02-22
  • Symbolic checking of Fuzzy CTL on Fuzzy Program Graph
    • Abstract: Abstract Few fuzzy temporal logics and modeling formalisms are developed such that their model checking is both effective and efficient. State-space explosion makes model checking of fuzzy temporal logics inefficient. That is because either the modeling formalism itself is not compact, or the verification approach requires an exponentially larger yet intermediate representation of the modeling formalism. To exemplify, Fuzzy Program Graph (FzPG) is a very compact, and powerful formalism to model fuzzy systems; yet, it is required to be translated into an equal Fuzzy Kripke model with an exponential blow-up should it be formally verified. In this paper, we introduce Fuzzy Computation Tree Logic (FzCTL) and its direct symbolic model checking over FzPG that avoids the aforementioned state-space explosion. Considering compactness and readability of FzPG along with expressiveness of FzCTL, we believe the proposed method is applicable in real-world scenarios. Finally, we study formal verification of fuzzy flip-flops to demonstrate capabilities of the proposed method.
      PubDate: 2019-02-01
  • Petri nets are dioids: a new algebraic foundation for non-deterministic
           net theory
    • Abstract: Abstract In a seminal paper Montanari and Meseguer have shown that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition. A smoother and more complete theory for deterministic computations has been later developed by relying on the concept of pre-net, a variation of Petri nets with a non-commutative flavor. This paper shows that, along the same lines, by adding an (idempotent) operation and thus considering dioids (idempotent semirings) rather than just monoids, one can faithfully characterise the non-deterministic computations of a net.
      PubDate: 2019-02-01
  • Preface for the special issue for ATVA 2015
    • PubDate: 2018-12-01
  • Hierarchical information and the synthesis of distributed strategies
    • Abstract: Abstract Infinite games with imperfect information are known to be undecidable unless the information flow is severely restricted. One fundamental decidable case occurs when there is a total ordering among players, such that each player has access to all the information that the following ones receive. In this paper we consider variations of this hierarchy principle for synchronous games with perfect recall, and identify new decidable classes for which the distributed synthesis problem is solvable with finite-state strategies. In particular, we show that decidability is maintained when the information hierarchy may change along the play, or when transient phases without hierarchical information are allowed. Finally, we interpret our result in terms of distributed system architectures.
      PubDate: 2018-12-01
  • Looking at mean payoff through foggy windows
    • Abstract: Abstract Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of full observation, they admit memoryless optimal strategies for both players and can be solved in \({\mathsf {NP}}\cap {\mathsf {coNP}}\) . MPGs are suitable quantitative models for open reactive systems. However, in this context the assumption of full observation is not always realistic. For the partial-observation case, the problem that asks if the first player has an observation-based winning strategy that enforces a given threshold on the mean payoff, is undecidable. In this paper, we study the window mean-payoff objectives introduced recently as an alternative to the classical mean-payoff objectives. We show that, in sharp contrast to the classical mean-payoff objectives, some of the window mean-payoff objectives are decidable in games with partial observation.
      PubDate: 2018-12-01
  • Spanning the spectrum from safety to liveness
    • Abstract: Abstract Of special interest in formal verification are safety specifications, which assert that the system stays within some allowed region, in which nothing “bad” happens. Equivalently, a computation violates a safety specification if it has a “bad prefix”—a prefix all whose extensions violate the specification. The theoretical properties of safety specifications as well as their practical advantages with respect to general specifications have been widely studied. Safety is binary: a specification is either safety or not safety. We introduce a quantitative measure for safety. Intuitively, the safety level of a language L measures the fraction of words not in L that have a bad prefix. In particular, a safety language has safety level 1 and a liveness language has safety level 0. Thus, our study spans the spectrum between traditional safety and liveness. The formal definition of safety level is based on probability and measures the probability of a random word not in L to have a bad prefix. We study the problem of finding the safety level of languages given by means of deterministic and nondeterministic automata as well as LTL formulas, and the problem of deciding their membership in specific classes along the spectrum (safety, almost-safety, fraction-safety, etc.). We also study properties of the different classes and the structure of deterministic automata for them.
      PubDate: 2018-12-01
  • TSO-to-TSO linearizability is undecidable
    • Abstract: Abstract TSO-to-TSO linearizability is a variant of linearizability for concurrent libraries on the total store order (TSO) memory model. It is proved in this paper that TSO-to-TSO linearizability for a bounded number of processes is undecidable. We first show that the trace inclusion problem of a classic-lossy single-channel system, which is known undecidable, can be reduced to the history inclusion problem of specific libraries on the TSO memory model. Based on the equivalence between history inclusion and extended history inclusion for these libraries, we then prove that the extended history inclusion problem of libraries is undecidable on the TSO memory model. By means of extended history inclusion as an equivalent characterization of TSO-to-TSO linearizability, we finally prove that TSO-to-TSO linearizability is undecidable for a bounded number of processes. Additionally, we prove that all variants of history inclusion problems are undecidable on TSO for a bounded number of processes.
      PubDate: 2018-12-01
  • Depletable channels: dynamics, behaviour, and efficiency in network design
    • Abstract: Abstract We present a simple model, called depleatable channels, of multi-hop communication in ad hoc networks. We introduce a model for channel energy consumption, and we propose a notion of channel equivalence based on the communication service they provide, regardless of specific routing protocols. In particular, we consider equivalent two channels with identical maximum and minimum inhibiting flow, and prove that this notion of equivalence, and variants of it, coincide with standard equivalences borrowed from the theory of concurrency. Unfortunately, while the maximum flow can be computed in polynomial time, calculating the value of a minimum inhibiting flow is NP-hard. Thus, we propose a characterization of those graphs, called weak, which admit charge assignments for which the minimum inhibiting flow is strictly less than the maximum flow and show that weakness can be checked efficiently by providing an algorithm that does so in polynomial time.
      PubDate: 2018-11-08
  • Bounded choice-free Petri net synthesis: algorithmic issues
    • Abstract: Abstract This paper describes a synthesis procedure dedicated to the construction of choice-free Petri nets from finite persistent transition systems, whenever possible. Taking advantage of the properties of choice-free Petri nets, a two-step approach is proposed. A pre-synthesis step checks necessary structural properties of the transition system and constructs some data structures needed for the second step. Then, a minimised set of simplified systems of linear inequalities is distilled from a general region-theoretic approach. This leads to a substantial narrowing of the sets of states for which linear inequalities must be solved, and allows an early detection of failures, supported by constructive error messages. The performance of the resulting algorithm is measured and compared numerically with existing synthesis tools.
      PubDate: 2018-11-01
  • Fast deterministic parsers for transition networks
    • Abstract: Abstract Extended BNF grammars (EBNF) allow regular expressions in the right parts of their rules. They are widely used to define languages, and can be represented by recursive Transition Networks (TN) consisting of a set of finite-state machines. We present a novel direct construction of efficient shift-reduce ELR(1) parsers for TNs. We show that such a parser works deterministically if the TN is free from the classical shift-reduce and reduce–reduce conflicts of the LR(1) parsers, and from a new conflict type called convergence conflict. Such a novel condition for determinism is proved correct and is more general than those proposed in the past for EBNF grammars or TNs. Such ELR(1) parsers perform fewer shift moves than the equivalent LR(1) parsers. A simple optimization of the reduction moves is described.
      PubDate: 2018-11-01
  • Preface for the special issue “FM15”
    • PubDate: 2018-09-01
  • On the hardness of analyzing probabilistic programs
    • Authors: Benjamin Lucien Kaminski; Joost-Pieter Katoen; Christoph Matheja
      Abstract: Abstract We study the hardness of deciding probabilistic termination as well as the hardness of approximating expected values (e.g. of program variables) and (co)variances for probabilistic programs. Termination We distinguish two notions of probabilistic termination: Given a program P and an input \(\sigma \) ... ...does P terminate with probability 1 on input \(\sigma \) ' (almost-sure termination) the expected time until P terminates on input \(\sigma \) finite' (positive almost-sure termination) For both of these notions, we also consider their universal variant, i.e. given a program P, does P terminate on all inputs' We show that deciding almost-sure termination as well as deciding its universal variant is \(\varPi ^0_2\) -complete in the arithmetical hierarchy. Deciding positive almost-sure termination is shown to be \(\varSigma _2^0\) -complete, whereas its universal variant is \(\varPi _3^0\) -complete. Expected values Given a probabilistic program P and a random variable f mapping program states to rationals, we show that computing lower and upper bounds on the expected value of f after executing P is \(\varSigma _1^0\) - and \(\varSigma _2^0\) -complete, respectively. Deciding whether the expected value equals a given rational value is shown to be \(\varPi ^0_2\) -complete. Covariances We show that computing upper and lower bounds on the covariance of two random variables is both \(\varSigma _2^0\) -complete. Deciding whether the covariance equals a given rational value is shown to be in \(\varDelta _3^0\) . In addition, this problem is shown to be \(\varSigma ^0_2\) -hard as well as \(\varPi ^0_2\) -hard and thus a “proper” \(\varDelta _3^0\) -problem. All hardness results on covariances apply to variances as well.
      PubDate: 2018-05-15
      DOI: 10.1007/s00236-018-0321-1
  • Negotiation as concurrency primitive
    • Authors: Jörg Desel; Javier Esparza; Philipp Hoffmann
      Abstract: Abstract This paper introduces negotiations, a model of concurrency close to Petri nets, with multi-party negotiations as concurrency primitive. We study two fundamental analysis problems. The soundness problem consists in deciding if it is always possible for a negotiation to terminate successfully, whatever the current state is. Given a sound negotiation, the summarization problem aims at computing an equivalent one-step negotiation with the same input/output behavior. The soundness and summarization problems can be solved by means of simple algorithms acting on the state space of the negotiation, which however face the well-known state explosion problem. We study alternative algorithms that avoid the construction of the state space. In particular, we define reduction rules that simplify a negotiation while preserving the sound/non-sound character of the negotiation and its summary. In a first result we show that our rules are complete for the class of weakly deterministic acyclic negotiations, meaning that they reduce all sound negotiations in this class, and only them, to equivalent one-step negotiations. This provides algorithms for both the soundness and the summarization problem that avoid the construction of the state space. We then study the class of deterministic negotiations. Our second main result shows that the rules are also complete for this class, even if the negotiations contain cycles. Moreover, we present an algorithm that completely reduces all sound deterministic negotiations, and only them, in polynomial time.
      PubDate: 2018-03-20
      DOI: 10.1007/s00236-018-0318-9
  • Verification of asynchronous systems with an unspecified component
    • Authors: Rosa Abbasi; Fatemeh Ghassemi; Ramtin Khosravi
      Abstract: Abstract Component-based systems evolve as a new component is added or an existing one is replaced by a newer version. Hence, it is appealing to assure the new system still preserves its safety properties. However, instead of inspecting the new system as a whole, which may result in a large state space, it is beneficial to reuse the verification results by inspecting the newly added component in isolation. To this aim, we study the problem of model checking component-based asynchronously communicating systems in the presence of an unspecified component against safety properties. Our solution is based on assume-guarantee reasoning, adopted for asynchronous environments, which generates the weakest assumption. If the newly added component conforms to the assumption, then the whole system still satisfies the property. To make the approach efficient and convergent, we produce an overapproximated interface of the missing component and by its composition with the rest of the system components, we achieve an overapproximated specification of the system, from which we remove those traces of the system that violate the property and generate an assumption for the missing component. We have implemented our approach on two case studies. Furthermore, we compared our results with the state of the art direct approach. Our resulting assumptions are smaller in size and achieved faster.
      PubDate: 2018-03-07
      DOI: 10.1007/s00236-018-0317-x
  • An analysis of the M $$^X$$ X /M/1 queue with multiple working vacations
           by GI/M/1 type Markov process
    • Authors: Hongbo Zhang
      Abstract: Abstract In this paper, we analyze an M/M/1 queue with batch arrival and multiple working vacations. We describe the queueing model by a special GI/M/1 type Markov process with infinite phases, and by the matrix analytic method, we not only give the stationary queue length distribution of the model, but also obtain the exact number of vacations completed by the server.
      PubDate: 2018-02-05
      DOI: 10.1007/s00236-018-0316-y
  • On path-controlled insertion–deletion systems
    • Authors: Henning Fernau; Lakshmanan Kuppusamy; Indhumathi Raman
      Abstract: Abstract A graph-controlled insertion–deletion system is a regulated extension of an insertion–deletion system. It has several components and each component contains some insertion–deletion rules. These components are the vertices of a directed control graph. A transition is performed by any applicable rule in the current component on a string and the resultant string is then moved to the target component specified in the rule. This also describes the arcs of the control graph. Starting from an axiom in the initial component, strings thus move through the control graph. The language of the system is the set of all terminal strings collected in the final component. In this paper, we investigate a variant of the main question in this area: which combinations of size parameters (the maximum number of components, the maximal length of the insertion string, the maximal length of the left context for insertion, the maximal length of the right context for insertion; plus three similar restrictions with respect to deletion) are sufficient to maintain computational completeness of such restricted systems under the additional restriction that the (undirected) control graph is a path' Notice that these results also bear consequences for the domain of insertion–deletion P systems, improving on a number of previous results from the literature, concerning in particular the number of components (membranes) that are necessary for computational completeness results.
      PubDate: 2018-02-05
      DOI: 10.1007/s00236-018-0312-2
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762

Your IP address:
Home (Search)
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-