Attributes | Values |
---|
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
| |
http://linked.open...iv/cisloPeriodika
| |
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
| |
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
| |
http://linked.open...i/riv/nazevZdroje
| |
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
| |
http://linked.open...iv/tvurceVysledku
| - Jančar, Petr
- Sawa, Zdeněk
|
http://linked.open...ain/vavai/riv/wos
| |
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |