On the relations computable by a class of concurrent automata
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic change in office automation: modeling and analysis
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Correspondences between statecharts, event structures, and concurrent regular expressions
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Semantic models for concurrency
ACM SIGSOFT Software Engineering Notes
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
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
The box algebra = Petri nets + process expressions
Information and Computation
Place/transition Petri net evolutions: recording ways, analysis and synthesis
Fundamenta Informaticae
Comparing coordination models and architectures using embeddings
Science of Computer Programming - Special issue on coordination languages and architectures
Model Generation by Moderated Regular Extrapolation
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
On Combining the Persistent Sets Method with the Covering Steps Graph Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Dihomotopy as a Tool in State Space Analysis
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Behavior-Based Model Construction
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Model-checking of correctness conditions for concurrent objects
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Mechanized Proof Environment for the Convenient Computations Proof Method
Formal Methods in System Design
Journal of Combinatorial Theory Series A
The topology of Mazurkiewicz traces
Theoretical Computer Science - Topology in computer science
The word problem for 1LC congruences is NP-hard
Theoretical Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Dynamic partial-order reduction for model checking software
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding Global Partial-Order Properties
Formal Methods in System Design
Software Model Checking: The VeriSoft Approach
Formal Methods in System Design
From local to global temporal logics over Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Electronic Notes in Theoretical Computer Science (ENTCS)
True-concurrency probabilistic models: Markov nets and a law of large numbers
Theoretical Computer Science
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
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Testing Distributed Systems Through Symbolic Model Checking
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
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
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Logics and Bisimulation Games for Concurrency, Causality and Conflict
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
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Reduction of Verification Conditions for Concurrent System Using Mutually Atomic Transactions
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Symbolic pruning of concurrent program executions
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
Formal Methods in System Design
Enforcing Concurrent Temporal Behaviors
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Test coverage for loose timing annotations
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Unfolding concurrent well-structured transition systems
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Alphabetical satisfiability problem for trace equations
Acta Cybernetica
Peephole partial order reduction
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
An efficient reactive planner for synthesizing reactive plans
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Inferring regular trace languages from positive and negative samples
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards a pomset semantics for a shared-variable parallel language
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Application of partial-order methods for the verification of closed-loop SDL systems
Proceedings of the 2011 ACM Symposium on Applied Computing
On the origin of events: branching cells as stubborn sets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Canonical transition set semantics for petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
FM'06 Proceedings of the 14th international conference on Formal Methods
Decidability results for choreography realization
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Efficient model checking for LTL with partial order snapshots
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Canonizable partial order generators
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Proceedings of the Third Symposium on Information and Communication Technology
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
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Place/Transition Petri net Evolutions: Recording Ways, Analysis and Synthesis
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
ω-Process Languages for Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Fundamenta Informaticae
On commutativity based edge lean search
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Towards cost-aware service recovery
Proceedings of the 9th international ACM Sigsoft conference on Quality of software architectures
Bounded partial-order reduction
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Efficient synthesis for concurrency by semantics-preserving transformations
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Optimal dynamic partial order reduction
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Conquering the scheduling alternative explosion problem of SystemC symbolic simulation
Proceedings of the International Conference on Computer-Aided Design
Hi-index | 0.00 |