The star problem and the finite power property in trace monoids: reductions beyond C4
Information and Computation
Extending Compositional Message Sequence Graphs
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Two Techniques in the Area of the Star Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Connection between the Star Problem and the Finite Power Property in Trace Monoids
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Trace Coding Problem Is Undecidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Star Problem in Trace Monoids: Reductions Beyond C4
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Average Parallelism in Trace Monoids
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A Further Step towards a Theory of Regular MSC Languages
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Bounded Reachability Checking with Process Semantics
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Generalised Regular MSC Languages
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
On Recognizable Languages in Divisibility Monoids
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Generalized Synchronization Languages
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Pomsets for local trace languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
The topology of Mazurkiewicz traces
Theoretical Computer Science - Topology in computer science
Regular sets of infinite message sequence charts
Information and Computation
Recognizing string graphs in NP
Journal of Computer and System Sciences - STOC 2002
Two techniques in the area of the star problem in trace monoids
Theoretical Computer Science
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Undecidability of the trace coding problem and some decidable cases
Theoretical Computer Science
A relational model of non-deterministic dataflow
Mathematical Structures in Computer Science
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
On a conjecture about finite fixed points of morphisms
Theoretical Computer Science - Combinatorics on words
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Permutation rewriting and algorithmic verification
Information and Computation
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Semantics of Deterministic Shared-Memory Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
MSO Logic for Unambiguous Shared-Memory Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Some undecidability results related to the star problem in trace monoids
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A star operation for star-free trace languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A dynamical model of parallel computation on bi-infinite time-scale
Journal of Computational and Applied Mathematics
Application of partial-order methods for the verification of closed-loop SDL systems
Proceedings of the 2011 ACM Symposium on Applied Computing
Shared-memory systems and charts
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Models for quantitative distributed systems and multi-valued logics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Canonical transition set semantics for petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
A characterization of combined traces using labeled stratified order structures
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case
Fundamenta Informaticae
On Three Alternative Characterizations of Combined Traces
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Algebraic structure of combined traces
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Regular languages and partial commutations
Information and Computation
Folded Hasse diagrams of combined traces
Information Processing Letters
| Hi-index | 0.00 |