Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
Semantic models for concurrency
ACM SIGSOFT Software Engineering Notes
Foundations of the Trace Assertion Method of Module Interface Specification
IEEE Transactions on Software Engineering
Branching time controllers for discrete event systems
Theoretical Computer Science
Confluence problems for trace rewriting systems
Information and Computation
On the support of graph Lie algebras
Theoretical Computer Science
Resource traces: a domain for processes sharing exclusive resources
Theoretical Computer Science
A truly concurrent semantics for a process algebra using resource pomsets
Theoretical Computer Science
Transitive factorizations of free partially commutative monoids and Lie algebras
Discrete Mathematics
Place/transition Petri net evolutions: recording ways, analysis and synthesis
Fundamenta Informaticae
The star problem and the finite power property in trace monoids: reductions beyond C4
Information and Computation
Deciding LTL over Mazurkiewicz traces
Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
Uniform and nonuniform recognizability
Theoretical Computer Science
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Regular Collections of Message Sequence Charts
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Dynamic Bounds and Transition Merging for Local First Search
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
An Expressive Extension of TLC
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
On Model Checking Synchronised Hardware Circuits
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
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
LTL Is Expressively Complete for Mazurkiewicz Traces
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Infinite Series-Parallel Posets: Logic and Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Solvability of Equations in Free Partially Commutative Groups Is Decidable
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,
Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Infinite-State High-Level MSCs: Model-Checking and Realizability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Theory of One-Step Rewriting in Trace Monoids
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
HMSCs as Partial Specifications ... with PNs as Completions
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Explicit Modeling of Influences, and of Their Absence, in Distributed Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Black Box Unfolding with Local First Search
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
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
Existential and Positive Theories of Equations in Graph Products
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Local First Search - A New Paradigm for Partial Order Reductions
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Decidable Class of Asynchronous Distributed Controllers
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Matching Specifications for Message Sequence Charts
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
On Recognizable Stable Trace Languages
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Product Interval Automata: A Subclass of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Local Normal Forms for Logics over Traces
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A Persistent-Set Approach to Abstract Stat-Space Construction in Verification
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
A New Equational Foundation for the Fluent Calculus
CL '00 Proceedings of the First International Conference on Computational Logic
Integrating Formal Description Techniques
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A Truly Concurrent Semantics for a Simple Parallel Programming Language
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
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
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Regular Event Structures and Finite Petri Nets: A Conjecture
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Decidable Theories of Cayley-Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
HMSCs as partial specifications ... with PNs as completions
Modeling and verification of parallel processes
Safety and liveness properties for real traces and a direct translation from LTL to monoids
Formal and natural computing
Regular event structures and finite Petri nets: a conjecture
Formal and natural computing
Pomsets for local trace languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Probabilistic cluster unfoldings
Fundamenta Informaticae
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
Inference of Message Sequence Charts
IEEE Transactions on Software Engineering
The topology of Mazurkiewicz traces
Theoretical Computer Science - Topology in computer science
The word problem for 1LC congruences is NP-hard
Theoretical Computer Science
The homomorphism problem for trace monoids
Theoretical Computer Science - WORDS
Regular sets of infinite message sequence charts
Information and Computation
Two techniques in the area of the star problem in trace monoids
Theoretical Computer Science
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
A simple process algebra based on atomic actions with resources
Mathematical Structures in Computer Science
On the trace product and some families of languages closed under partial commutations
Journal of Automata, Languages and Combinatorics
Difficult Configurations—On the Complexity of LTrL
Formal Methods in System Design
Garside monoids vs divisibility monoids
Mathematical Structures in Computer Science
On a conjecture about finite fixed points of morphisms
Theoretical Computer Science - Combinatorics on words
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
CONCUR 2005 - Concurrency Theory
A theory of regular MSC languages
Information and Computation
A partial order semantics approach to the clock explosion problem of timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Concurrency in Synchronous Systems
Formal Methods in System Design
Left cells containing a fully commutative element
Journal of Combinatorial Theory Series A
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Time-stamps for Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Theoretical Computer Science
Finite transducers for divisibility monoids
Theoretical Computer Science
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
On Star-Connected Flat Languages
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Associative Omega-products of Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Star-Connected Flat Languages and Automata
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Fundamenta Informaticae
Weighted asynchronous cellular automata
Theoretical Computer Science
A regular viewpoint on processes and algebra
Acta Cybernetica
Composition Theorem for Generalized Sum
Fundamenta Informaticae
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Weighted automata with discounting
Information Processing Letters
Architecture-Based Reasoning About Performability in Component-Based Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Modelling Concurrency with Quotient Monoids
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Labeled Step Sequences in Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
When Does Partial Commutative Closure Preserve Regularity?
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Characterization of Star-Connected Languages Using Finite Automata
Language and Automata Theory and Applications
Semantics of Deterministic Shared-Memory Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Dynamic Partial Order Reduction Using Probe Sets
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
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Projection Representation of Mazurkiewicz Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Topological Properties of Event Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
Model Checking and Artificial Intelligence
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Analysis and Synthesis of Net Structures and Transition Graphs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Distributed Asynchronous Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Enforcing Concurrent Temporal Behaviors
Electronic Notes in Theoretical Computer Science (ENTCS)
True-concurrency probabilistic models
Information and Computation
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
A remark about quadratic trace equations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Succinct discrete time approximations of distributed hybrid automata
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Generating series of the trace group
DLT'03 Proceedings of the 7th international conference on Developments in language theory
The solution space of sorting by reversals
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
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
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A star operation for star-free trace languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Weighted and unweighted trace automata
Acta Cybernetica
Alphabetical satisfiability problem for trace equations
Acta Cybernetica
Synthesis of safe message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Closure operators for order structures
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A nice labelling for tree-like event structures of degree 3
Information and Computation
Trace monoids with idempotent generators and measure-only quantum automata
Natural Computing: an international journal
Optimal Zielonka-type construction of deterministic asynchronous automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Listing all parsimonious reversal sequences: new algorithms and perspectives
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
A dynamical model of parallel computation on bi-infinite time-scale
Journal of Computational and Applied Mathematics
An automata-theoretical characterization of context-free trace languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
Symbolic dynamics, flower automata and infinite traces
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Mining message sequence graphs
Proceedings of the 33rd International Conference on Software Engineering
On model-based regression testing of web-services using dependency analysis of visual contracts
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Shared-memory systems and charts
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Singular artin monoids of finite coxeter type are automatic
LATA'11 Proceedings of the 5th international conference on Language and automata 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
Globally deterministic CD-systems of stateless R(1)-automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Kleene theorems for product systems
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Temporal logics for concurrent recursive programs: satisfiability and model checking
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
An efficient static trace simplification technique for debugging concurrent programs
SAS'11 Proceedings of the 18th international conference on Static analysis
Performance evaluation of schedulers in a probabilistic setting
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Unfolding synthesis of asynchronous automata
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Weighted asynchronous cellular automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
The synthesis problem of netcharts
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Stronger reduction criteria for local first search
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
The MSO theory of connectedly communicating processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Partially commutative inverse monoids
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Supporting partial component matching
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Asynchronous automata-theoretic characterization of aperiodic trace languages
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Distributed games with causal memory are decidable for series-parallel systems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the maximum coefficients of rational formal series in commuting variables
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
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
On interleaving in timed automata
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The implementation of mazurkiewicz traces in POEM
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Analysis of communicating automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Post correspondence problem with partially commutative alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
CD-systems of stateless deterministic r(1)-automata accept all rational trace languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Polynomials, fragments of temporal logic and the variety DA over traces
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Decidability results for choreography realization
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Trace spaces: an efficient new technique for state-space reduction
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A concurrency-preserving translation from time Petri nets to networks of timed automata
Formal Methods in System Design
Proceedings of the Third Symposium on Information and Communication Technology
Using unfoldings in automated testing of multithreaded programs
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
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
Trace matching in a concurrent logical framework
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
Analysis and Synthesis of Net Structures and Transition Graphs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Projection Representation of Mazurkiewicz Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Composition Theorem for Generalized Sum
Fundamenta Informaticae
On First-Order Fragments for Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Star-Connected Flat Languages and Automata
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Fundamenta Informaticae
On Star-Connected Flat Languages
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Place/Transition Petri net Evolutions: Recording Ways, Analysis and Synthesis
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Probabilistic Cluster Unfoldings
Fundamenta Informaticae
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Iteration Lemmata for Certain Classes of Word, Trace and Graph Languages
Fundamenta Informaticae
Cause-Effect Structures - Structural and Semantic Properties Revisited
Fundamenta Informaticae
A Graph Grammar Model of the hp Adaptive Three Dimensional Finite Element Method. Part I
Fundamenta Informaticae
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
A nice labelling for tree-like event structures of degree 3
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Causal message sequence charts
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Reachability problem for weak multi-pushdown automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Modeling interval order structures with partially commutative monoids
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Algebraic structure of combined traces
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Towards cost-aware service recovery
Proceedings of the 9th international ACM Sigsoft conference on Quality of software architectures
Asynchronous games over tree architectures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Regular languages and partial commutations
Information and Computation
Mutex Causality in Processes and Traces of General Elementary Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.01 |