#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2002

2017

- This year (4)
- Last 5 years (24)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stanislav Böhm, Stefan Göller, Petr Jancar
- STOC
- 2013

We prove that language equivalence of deterministic one-counter automata is NL-complete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic one-counter automata are inequivalent if and only if they can be distinguished by a word of length polynomial in… (More)

- Stanislav Böhm, Stefan Göller, Petr Jancar
- CONCUR
- 2010

A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (with no ε-steps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known PSPACE lower bound (Srba 2009). We add the… (More)

- Stanislav Böhm, Marek Behalek
- 2011 UkSim 13th International Conference on…
- 2011

The main goal of this paper is to introduce the tool Kaira that we are developing. This tool is intended for modelling, simulation and generation of parallel applications. A developer is able to model parallel programs and different aspects of communication using Kaira. The used model is based on the variant of Coloured Petri Nets. Coloured Petri Nets… (More)

- Stanislav Böhm, Stefan Göller, Petr Jancar
- J. Comput. Syst. Sci.
- 2014

A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where stack emptiness can be tested; it is a real-time automaton if it contains no ε-transitions. We study the computational complexity of the problems of equivalence and regularity (i.e. semantic finiteness) on real-time one-counter automata. The first main result shows… (More)

- Otto Exner, Stanislav Böhm
- Organic & biomolecular chemistry
- 2005

Structure of protonated nitro compounds was investigated by calculations at the levels MP2(FC)/6-311++G(2d,2p)//MP2(FC)/6-311++G(2d,2p)(nitromethane and reference compounds) or B3LYP/6-311+G(d,p)//B3LYP/6-311+G(d,p)(nitrobenzene and its 18 meta- and para-substituted derivatives). The group NO2H+ reveals many similarities with the isoelectronic group CO2H as… (More)

- Stanislav Böhm, Stefan Göller
- MFCS
- 2011

We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding… (More)

- Pavel Fiedler, Stanislav Böhm, Jirí Kulhánek, Otto Exner
- Organic & biomolecular chemistry
- 2006

The structures of ortho-substituted benzoic acids with substituents bearing hydrogen atoms (OH, NH2, COOH and SO2NH2) were investigated by means of IR spectroscopy and of density functional theory at the B3LYP/6-311 + G(d,p) level. All possible conformations, hydrogen bonds, tautomeric forms and zwitterions were taken into consideration and particular… (More)

- Stanislav Böhm, Marek Behalek, Ondrej Meca, Martin Surkovský
- 2013 Federated Conference on Computer Science and…
- 2013

Our research is focused on the simplification of parallel programming for distributed memory systems. Our overall goal is to build a unifying framework for creating, debugging, profiling and verifying parallel applications. The key aspect is a visual model inspired by Colored Petri Nets. In this paper, we will present how to use the visual model for… (More)

- Marek Behalek, Stanislav Böhm, Pavel Krömer, Martin Surkovský, Ondrej Meca
- 2011 11th International Conference on Intelligent…
- 2011

Parallel computing can be very useful for meta-heuristic algorithms, because it can reduce time to find a solution with given properties. On the other hand parallel programming is generally more difficult than the sequential one and we need more development time to get a working parallel solution. We are developing a tool named Kaira which is intended for… (More)

- Stanislav Böhm, Marek Behalek
- FHPC@ICFP
- 2012

Petri nets are a well established graphical and mathematical modelling language for a description of concurrent systems. The main scope of this paper is to present our approach how to use Petri nets for high-performance computing. They are rarely used in this area. As a proof of concept, we are developing a tool Kaira. The modelling language in the tool is… (More)