Nikola Beneš


Ontology type: schema:Person     


Person Info

NAME

Nikola

SURNAME

Beneš

Publications in SciGraph latest 50 shown

  • 2022-05-11 Exploring attractor bifurcations in Boolean networks in BMC BIOINFORMATICS
  • 2021-09-13 Aeon 2021: Bifurcation Decision Trees in Boolean Networks in COMPUTATIONAL METHODS IN SYSTEMS BIOLOGY
  • 2021-07-15 Computing Bottom SCCs Symbolically Using Transition Guided Reduction in COMPUTER AIDED VERIFICATION
  • 2021-03-23 Symbolic Coloured SCC Decomposition in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 2020-07-14 AEON: Attractor Bifurcation Analysis of Parametrised Boolean Networks in COMPUTER AIDED VERIFICATION
  • 2019-11-22 Accelerating Parameter Synthesis Using Semi-algebraic Constraints in INTEGRATED FORMAL METHODS
  • 2019-10-28 Formal Analysis of Qualitative Long-Term Behaviour in Parametrised Boolean Networks in FORMAL METHODS AND SOFTWARE ENGINEERING
  • 2019-06-12 Model Checking Approach to the Analysis of Biological Systems in AUTOMATED REASONING FOR SYSTEMS BIOLOGY AND MEDICINE
  • 2019-04-03 Digital Bifurcation Analysis of TCP Dynamics in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 2018-09-30 Recursive Online Enumeration of All Minimal Unsatisfiable Subsets in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2017-09-01 Detecting Attractors in Biological Models with Uncertain Parameters in COMPUTATIONAL METHODS IN SYSTEMS BIOLOGY
  • 2017-07-13 Pithya: A Parallel Tool for Parameter Synthesis of Piecewise Multi-affine Dynamical Systems in COMPUTER AIDED VERIFICATION
  • 2016-11-08 A Model Checking Approach to Discrete Bifurcation Analysis in FM 2016: FORMAL METHODS
  • 2016-09-22 Parallel SMT-Based Parameter Synthesis with Application to Piecewise Multi-affine Systems in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2016-09-04 High-Performance Symbolic Parameter Synthesis of Biological Models: A Case Study in COMPUTATIONAL METHODS IN SYSTEMS BIOLOGY
  • 2016-06-23 Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis in SOFTWARE ENGINEERING AND FORMAL METHODS
  • 2016-06-23 LTL Parameter Synthesis of Parametric Timed Automata in SOFTWARE ENGINEERING AND FORMAL METHODS
  • 2016-01-04 Analysing sanity of requirements for avionics systems in FORMAL ASPECTS OF COMPUTING
  • 2015-06-20 Language Emptiness of Continuous-Time Parametric Timed Automata in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2015-03-19 Refinement checking on parametric modal transition systems in ACTA INFORMATICA
  • 2014-06-13 Towards Verification of Ensemble-Based Component Systems in FORMAL ASPECTS OF COMPONENT SOFTWARE
  • 2014 On Clock-Aware LTL Properties of Timed Automata in THEORETICAL ASPECTS OF COMPUTING – ICTAC 2014
  • 2013 Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory in CONCUR 2013 – CONCURRENCY THEORY
  • 2012 Factorization for Component-Interaction Automata in SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2012 Modal Process Rewrite Systems in THEORETICAL ASPECTS OF COMPUTING – ICTAC 2012
  • 2012 Dual-Priced Modal Transition Systems with Time Durations in LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING
  • 2011 Parametric Modal Transition Systems in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2011 Modal Transition Systems: Composition and LTL Model Checking in AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS
  • 2009 Partial Order Reduction for State/Event LTL in INTEGRATED FORMAL METHODS
  • 2009 Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete in THEORETICAL ASPECTS OF COMPUTING - ICTAC 2009
  • 2008-01-01 Component-Interaction Automata Approach (CoIn) in THE COMMON COMPONENT MODELING EXAMPLE
  • Affiliations

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.10267.32", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.5117.2", 
            "type": "Organization"
          }
        ], 
        "familyName": "Bene\u0161", 
        "givenName": "Nikola", 
        "id": "sg:person.014465763501.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014465763501.21"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-06-01T22:52", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/person/person_762.jsonl", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.014465763501.21'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.014465763501.21'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.014465763501.21'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.014465763501.21'


     




    Preview window. Press ESC to close (or click here)


    ...