Eike Best


Ontology type: schema:Person     


Person Info

NAME

Eike

SURNAME

Best

Publications in SciGraph latest 50 shown

  • 2020-06-30 A New Property of Choice-Free Petri Net Systems in APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY
  • 2018-05-08 From Event-Oriented Models to Transition Systems in APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY
  • 2017-11-20 Bounded choice-free Petri net synthesis: algorithmic issues in ACTA INFORMATICA
  • 2017-09-20 Properties of Plain, Pure, and Safe Petri Nets in TRANSACTIONS ON PETRI NETS AND OTHER MODELS OF CONCURRENCY XII
  • 2017-01-11 A Graph-Theoretical Characterisation of State Separation in SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2017-01-11 Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict in SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE
  • 2016-09-13 Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs in REACHABILITY PROBLEMS
  • 2016-09-02 Conditions for Petri Net Solvable Binary Words in TRANSACTIONS ON PETRI NETS AND OTHER MODELS OF CONCURRENCY XI
  • 2016-06-09 Characterising Petri Net Solvable Binary Words in APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY
  • 2016-06-09 The Power of Prime Cycles in APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY
  • 2015-02-03 State space axioms for T-systems in ACTA INFORMATICA
  • 2014-11-29 Synthesis and reengineering of persistent systems in ACTA INFORMATICA
  • 2014 Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
  • 2014 Synthesis of Persistent Systems in APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY
  • 2013 Structure Theory of Petri Nets in TRANSACTIONS ON PETRI NETS AND OTHER MODELS OF CONCURRENCY VII
  • 2012 Deciding Selective Declassification of Petri Nets in PRINCIPLES OF SECURITY AND TRUST
  • 2012 Petri Net Distributability in PERSPECTIVES OF SYSTEMS INFORMATICS
  • 2010 Separability in Persistent Petri Nets in APPLICATIONS AND THEORY OF PETRI NETS
  • 2009-03-20 A decomposition theorem for finite persistent transition systems in ACTA INFORMATICA
  • 2008 A Note on Persistent Petri Nets in CONCURRENCY, GRAPHS AND MODELS
  • 2008 A Slicing Technique for Business Processes in INFORMATION SYSTEMS AND E-BUSINESS TECHNOLOGIES
  • 2008 Decomposition Theorems for Bounded Persistent Petri Nets in APPLICATIONS AND THEORY OF PETRI NETS
  • 2007-01-01 Separability in Conflict-Free Petri Nets in PERSPECTIVES OF SYSTEMS INFORMATICS
  • 2004 Process Algebra in LECTURES ON CONCURRENCY AND PETRI NETS
  • 2001-08 Recursion and Petri nets in ACTA INFORMATICA
  • 2001 Petri Net Algebra in NONE
  • 2000-06-09 Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets in APPLICATION AND THEORY OF PETRI NETS 2000
  • 1999 The Box Algebra —; A Model of Nets and Process Expressions in APPLICATION AND THEORY OF PETRI NETS 1999
  • 1999 Weak and Strong Composition of High-Level Petri Nets in CONCUR’99 CONCURRENCY THEORY
  • 1998-10 M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages in ACTA INFORMATICA
  • 1998 Petri nets, process algebras and concurrent programming languages in LECTURES ON PETRI NETS II: APPLICATIONS
  • 1997 Partial order and SOS semantics for linear constraint programs in COORDINATION LANGUAGES AND MODELS
  • 1997 Orthogonal transformations for coloured Petri nets in APPLICATION AND THEORY OF PETRI NETS 1997
  • 1997 Refinement of coloured petri nets in FUNDAMENTALS OF COMPUTATION THEORY
  • 1996 Linear constraint systems as high-level nets in CONCUR '96: CONCURRENCY THEORY
  • 1996 PEP — more than a Petri Net tool in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 1996 A memory module specification using composable high-level petri nets in FORMAL SYSTEMS SPECIFICATION
  • 1995 An M-net Semantics of B(PN)2 in STRUCTURES IN CONCURRENCY THEORY
  • 1995 CALIBAN - Esprit Basic Research WG 6067 in STRUCTURES IN CONCURRENCY THEORY
  • 1995 A class of composable high level Petri nets in APPLICATION AND THEORY OF PETRI NETS 1995
  • 1995 A refined view of the box algebra in APPLICATION AND THEORY OF PETRI NETS 1995
  • 1995 Solving recursive net equations in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1994 Operational semantics for the Petri Box Calculus in CONCUR '94: CONCURRENCY THEORY
  • 1994 Operational Semantics for the Petri Box Calculus in CONCUR '94: CONCURRENCY THEORY
  • 1994 Compositional process semantics of Petri Boxes in MATHEMATICAL FOUNDATIONS OF PROGRAMMING SEMANTICS
  • 1993 General refinement and recursion operators for the Petri Box calculus in STACS 93
  • 1993 B(PN)2 — a basic Petri net programming notation in PARLE '93 PARALLEL ARCHITECTURES AND LANGUAGES EUROPE
  • 1992-11 Compositional generation of home states in free choice nets in FORMAL ASPECTS OF COMPUTING
  • 1992 Model checking of persistent Petri nets in COMPUTER SCIENCE LOGIC
  • 1992 The box calculus: A new causal algebra with multi-label communication in ADVANCES IN PETRI NETS 1992
  • 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.5560.6", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.67617.31", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.4561.6", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.9463.8", 
            "type": "Organization"
          }
        ], 
        "familyName": "Best", 
        "givenName": "Eike", 
        "id": "sg:person.013173315551.99", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013173315551.99"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2021-11-01T19:32", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/person/person_801.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.013173315551.99'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...