Filters
The Composite Algebraic Structure over Capabilities and Actions of a System
that focuses on the capability of the system to participate in interactions with its environment. Furthermore, we use mathematical object to describe this capability. In addition, weshow an equivalency (from an outer point...
IN - Informatika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Capabilities and Equivalence of Systems and a Preview of Related Algebraic Structure
that focuses on the capability of the system to participate in interactions with its environment. Accordingly, we use a mathematical object to describe this capability. In addition, we show an equivalency (from an outer po...
IN - Informatika
- 2010 •
- O
Rok uplatnění
O - Ostatní výsledky
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
For a given process equivalence, we say that a process g is fully equivalent to a process f of a transition system T if g is equivalent to f and every reachable state of g is equivalent to some state
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes
these strong and weak semantic preorders/equivalences between pushdown processes and finite-state processes.Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equi...
IN - Informatika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Deciding Bisimulation-Like Equivalences with Finite-State Processes
of bisimulation-like equivalences between infinite-state processes and finite-state ones. We equivalence is decidable between state-extended PA processes and finite-state ones (...
JC - Počítačový hardware a software
- 2001 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Equivalence Checking of Non-flat Systems Is EXPTIME-hard
The equivalence checking of systems that are given as a composition of interacting finite-state systems is considered. It is shown that the problem is EXPTIME-hard for any notion of equivalence that lies between bi...
BD - Teorie informace
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
preorder (and hence simulation equivalence) is EXPTIME-complete between PDA/BPA finite-state system is fixed, while simulation-checking between BPA and any fixed) bisimilarity between PDA and finite-s...
JC - Počítačový hardware a software
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata
We propose a generic method for deciding semantic equivalences between pushdown automata and finite-state automata. The abstract part of the method is applicable to every process equivalence which is a right PDA co...
IN - Informatika
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Simulation Preorder over Simple Process Algebras
preorder/equivalence between infinite-state processes and finite-state ones w.r.tWe consider the problem of simulation preorder/equivalence between infinite-state processes and finite-
JC - Počítačový hardware a software
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Technological dynamics and social capability: US states and European nations
This article analyzes factors shaping technological capabilities in USA and European countries, and shows that the differences between the two continents in this respect are much smaller than commonly assumed. The analysis demonstra...
AH - Ekonomie
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 245 323