This HTML5 document contains 105 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbthttp://dbpedia.org/resource/Template:
n44https://web.archive.org/web/20070422105816/http:/www.tik.ee.ethz.ch/tik/education/lectures/hswcd/papers/
wikipedia-enhttp://en.wikipedia.org/wiki/
n19http://is.ifmo.ru/works/switch/1/
n23http://is.ifmo.ru/projects/robocode2/
dbrhttp://dbpedia.org/resource/
n28http://is.ifmo.ru/works/
n46http://www-verimag.imag.fr/~caspi/PAPIERS/
n27http://is.ifmo.ru/unimod-projects/
n16http://is.ifmo.ru/works/uml-switch-eclipse/
n25http://is.ifmo.ru/projects/tanks/
n41http://
n30http://is.ifmo.ru/articles_en/
n37http://www.tik.ee.ethz.ch/tik/education/lectures/hswcd/papers/
n13http://is.ifmo.ru/works/heapsort/
dctermshttp://purl.org/dc/terms/
n31http://is.ifmo.ru/books/switch/
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n26http://is.ifmo.ru/unimod-projects-en/
n33http://is.ifmo.ru/english/
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://is.ifmo.ru/works/open_doc/
dbohttp://dbpedia.org/ontology/
n14http://is.ifmo.ru/works/traverse/
dbchttp://dbpedia.org/resource/Category:
n11http://is.ifmo.ru/works/arew/1/
n15http://is.ifmo.ru/works/iter/
yagohttp://dbpedia.org/class/yago/
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
n20http://is.ifmo.ru/works/switch_prr/
yago-reshttp://yago-knowledge.org/resource/
n10https://global.dbpedia.org/id/
n43http://is.ifmo.ru/books/
n29http://is.ifmo.ru/works/app-aplu/1/
n36http://unimod.sourceforge.net/
n22http://is.ifmo.ru/projects/dg/
n34http://is.ifmo.ru/foundation/
n17http://is.ifmo.ru/works/mirk/
n21http://is.ifmo.ru/works/sync_prog/
provhttp://www.w3.org/ns/prov#
foafhttp://xmlns.com/foaf/0.1/
n12http://is.ifmo.ru/works/tanks_new/
freebasehttp://rdf.freebase.com/ns/
owlhttp://www.w3.org/2002/07/owl#

Statements

Subject Item
dbr:Automata-based_programming_(Shalyto's_approach)
rdf:type
yago:LinguisticRelation113797142 yago:Inflection113803782 yago:WikicatProgrammingParadigms dbo:Company yago:GrammaticalRelation113796779 yago:Relation100031921 yago:Abstraction100002137 yago:Paradigm113804375
rdfs:label
Automata-based programming (Shalyto's approach)
rdfs:comment
Automata-based programming is a programming technology. Its defining characteristic is the use of finite state machines to describe program behavior. The transition graphs of state machines are used in all stages of software development (specification, implementation, debugging and documentation). Automata-based programming technology was introduced by Anatoly Shalyto in 1991. was developed to support automata-based programming. Automata-based programming is considered to be rather general purpose program development methodology than just another one finite state machine implementation.
dcterms:subject
dbc:Programming_paradigms dbc:ITMO_University
dbo:wikiPageID
16352023
dbo:wikiPageRevisionID
1124248170
dbo:wikiPageWikiLink
dbr:Subroutine dbr:Finite_state_machines dbr:Programmable_logic_controller dbc:ITMO_University dbr:Open-source_software dbr:Procedural_programming dbr:Computer_software dbr:Eclipse_(software) dbr:Embedded_systems dbr:Unified_Modeling_Language dbr:Refactoring dbr:Feedback dbr:Real-time_operating_system dbr:Russia dbr:Event-driven_programming dbr:ITMO_University dbr:Java_(programming_language) dbr:C_(programming_language) dbr:High-level_programming_language dbr:Communicating_sequential_processes dbr:Turing_machine dbr:Executable_UML dbr:Synchronous_programming_language dbr:Computer_memory dbr:Control_theory dbr:Switch-technology dbr:Operating_system dbr:Isomorphism dbr:Real-time_systems dbr:State_(computer_science) dbr:Finite_state_machine dbr:Europe dbr:Glossary_of_graph_theory dbr:Binary_data dbr:Anatoly_Shalyto dbr:Graph_(discrete_mathematics) dbc:Programming_paradigms
dbo:wikiPageExternalLink
n11: n12: n13: n14: n15: n16: n17: n18: n19: n20: n21: n22: n23: n25: n26: n27: n28:_a_visualizerExample.pdf n28:_aut_oop.pdf n29: n30:_logic_control_and_reactive_systems.pdf n30:_kimas05-1.pdf n30:_unimod.pdf n31:1 n33: n34:moving n36:intro.html n37:Statecharts.pdf%7Cdoi-access=free n36:). n41:is.ifmo.ru n43:_book.pdf n44:Statecharts.pdf n46:iee03.pdf
owl:sameAs
wikidata:Q4826389 n10:4U7uz freebase:m.03whl5x yago-res:Automata-based_programming_(Shalyto's_approach)
dbp:wikiPageUsesTemplate
dbt:Sfn dbt:Refend dbt:Reflist dbt:Citation dbt:Refbegin dbt:Other_uses dbt:Cite_book dbt:Primary_sources dbt:Cite_web dbt:Cite_journal
dbo:abstract
Automata-based programming is a programming technology. Its defining characteristic is the use of finite state machines to describe program behavior. The transition graphs of state machines are used in all stages of software development (specification, implementation, debugging and documentation). Automata-based programming technology was introduced by Anatoly Shalyto in 1991. was developed to support automata-based programming. Automata-based programming is considered to be rather general purpose program development methodology than just another one finite state machine implementation.
gold:hypernym
dbr:Technology
prov:wasDerivedFrom
wikipedia-en:Automata-based_programming_(Shalyto's_approach)?oldid=1124248170&ns=0
dbo:wikiPageLength
21417
foaf:isPrimaryTopicOf
wikipedia-en:Automata-based_programming_(Shalyto's_approach)
Subject Item
dbr:Automata-based_programming_(programming_technology)
dbo:wikiPageWikiLink
dbr:Automata-based_programming_(Shalyto's_approach)
dbo:wikiPageRedirects
dbr:Automata-based_programming_(Shalyto's_approach)
Subject Item
wikipedia-en:Automata-based_programming_(Shalyto's_approach)
foaf:primaryTopic
dbr:Automata-based_programming_(Shalyto's_approach)