About: Hardness of equivalence checking for composed finite-state systems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Computational complexity of comparing behaviours of systems composed from interacting finite-state components is considered. The main result shows that the respective problems are EXPTIME-hard for all relations between bisimulation equivalence and trace preorder, as conjectured by Rabinovich (Inf Comput 139(2):111?129, 1997). The result is proved for a specific model of parallel compositions where the components synchronize on shared actions but it can be easily extended to other similar models, e.g., to labelled 1-safe Petri nets. Further hardness results are shown for special cases of acyclic systems.
  • Computational complexity of comparing behaviours of systems composed from interacting finite-state components is considered. The main result shows that the respective problems are EXPTIME-hard for all relations between bisimulation equivalence and trace preorder, as conjectured by Rabinovich (Inf Comput 139(2):111?129, 1997). The result is proved for a specific model of parallel compositions where the components synchronize on shared actions but it can be easily extended to other similar models, e.g., to labelled 1-safe Petri nets. Further hardness results are shown for special cases of acyclic systems. (en)
Title
  • Hardness of equivalence checking for composed finite-state systems
  • Hardness of equivalence checking for composed finite-state systems (en)
skos:prefLabel
  • Hardness of equivalence checking for composed finite-state systems
  • Hardness of equivalence checking for composed finite-state systems (en)
skos:notation
  • RIV/61989100:27240/09:00021390!RIV10-MSM-27240___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0567)
http://linked.open...iv/cisloPeriodika
  • 3
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 316849
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/09:00021390
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • verification; eqivalence checking; computational complexity; parallel composition; finite-state systems (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV
  • [AB1BDEE2B2FB]
http://linked.open...i/riv/nazevZdroje
  • Acta Informatica
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 46
http://linked.open...iv/tvurceVysledku
  • Jančar, Petr
  • Sawa, Zdeněk
http://linked.open...ain/vavai/riv/wos
  • 000265216000001
issn
  • 0001-5903
number of pages
http://localhost/t...ganizacniJednotka
  • 27240
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software