Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Using events structures for the efficient analysis of state graphs
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Branching time controllers for discrete event systems
Theoretical Computer Science
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
CSP, partial automata, and coalgebras
Theoretical Computer Science
Bisimulation indexes and their applications
Theoretical Computer Science
Relating conflict-free stable transition and event models via redex families
Theoretical Computer Science
Synthesising elementary net systems with inhibitor arcs from step transition systems
Fundamenta Informaticae - Application of concurrency to system design
Theoretical Computer Science
Games and logics for a noninterleaving bisimulation
Nordic Journal of Computing
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
On Plain and Hereditary History-Preserving Bisimulation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Modular Specification of Concurrent Systems with Observational Logic
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Revisiting the Categorical Approach to Systems
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Modelling with Partial Orders - Why and Why Not?
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
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
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Event Structures as Presheaves -Two Representation Theorems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
MARRELLA and the Verification of an Embedded System
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Synthesizing Distributed Transition Systems from Global Specification
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Product Interval Automata: A Subclass of Timed Automata
Proceedings of the 19th Conference 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
Weak Bisimilarity and Open Maps
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Reasoning about Algebraic Generalisation of Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Concurrent Implementation of Asynchronous Transition Systems
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
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
On Concurrent Realization of Reactive Systems and Their Morphisms
Unifying Petri Nets, Advances in Petri Nets
Continuous Petri Nets and Transition Systems
Unifying Petri Nets, Advances in Petri Nets
On the Category of Event Structures with Dense Time
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Translations between Textual Transition Systems and Petri Nets
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Petri Nets, Configuration Structures and Higher Dimensional Automata
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A General Categorical Connection between Local Event Structures and Local Traces
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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]
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
Theoretical Computer Science - Category theory and computer science
Regular event structures and finite Petri nets: a conjecture
Formal and natural computing
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Secure Composition of Insecure Components
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Presheaf models for CCS-like languages
Theoretical Computer Science
Secure composition of untrusted code: box π, wrappers, and causality types
Journal of Computer Security - CSFW13
Undecidability of domino games and hhp-bisimilarity
Information and Computation
A tutorial introduction to symbolic model checking
Logic for concurrency and synchronisation
An algebraic characterization of independence of Petri net processes
Information Processing Letters - Special issue: Contribution to computing science
Categorical foundations for randomly timed automata
Theoretical Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Universal aspects of probabilistic automata
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Unique factorisation lifting functors and categories of linearly-controlled processes
Mathematical Structures in Computer Science
Observational trees as models for concurrency
Mathematical Structures in Computer Science
Compositional Abstractions of Hybrid Control Systems
Discrete Event Dynamic Systems
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
Theoretical Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
Theoretical Computer Science - Logic, semantics and theory of programming
A relational model of non-deterministic dataflow
Mathematical Structures in Computer Science
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
A framework for concrete reputation-systems with applications to history-based access control
Proceedings of the 12th ACM conference on Computer and communications security
Nautilus, a Concurrent Diagrammatic Specification and Programming Language
The Journal of Supercomputing
Modelling concurrent interactions
Theoretical Computer Science - Algebraic methodology and software technology
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Restriction-Based Concurrent System Design Using the Rough Set Formalism
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
Event Structures with Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
An Axiomatic Characterization of Algebras of Processes of Petri Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Fundamenta Informaticae
Concurrent Logic and Automata Combined: A Semantics for Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Causality versus true-concurrency
Theoretical Computer Science
Systems biology, models, and concurrency
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A logical framework for history-based access control and reputation systems
Journal of Computer Security
Semantic domains of timed event structures
Programming and Computing Software
Transformational design of an interactive component straddling communication streams
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
On Linear Logic Planning and Concurrency
Language and Automata Theory and Applications
Parallel and Sequential Independence for Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
Hierarchical Classifiers for Complex Spatio-temporal Concepts
Transactions on Rough Sets IX
A True-Concurrent Interpretation of Behavioural Scenarios
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Functional metamodels for systems and software
Journal of Systems and Software
Control Encapsulation: A Calculus for Exogenous Composition of Software Components
CBSE '09 Proceedings of the 12th International Symposium on Component-Based Software Engineering
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Configuration structures, event structures and Petri nets
Theoretical Computer Science
Model-Checking Games for Fixpoint Logics with Partial Order Models
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A First-Order Policy Language for History-Based Transaction Monitoring
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On linear logic planning and concurrency
Information and Computation
Algebra and logic for resource-based systems modelling
Mathematical Structures in Computer Science
A Noninterleaving Model of Concurrency Based on Transition Systems with Spatial Structure
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling Component Behaviour with Concurrent Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving state-based implementations of interactive components with history abstractions
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Real-time stable event structures and marked scott domains: an adjunction
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
The java memory model: operationally, denotationally, axiomatically
ESOP'07 Proceedings of the 16th European conference on Programming
Synthesis of elementary net systems with context arcs and localities
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Events, causality, and concurrency in membrane systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Open maps bisimulations for higher dimensional automata models
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
When things go wrong: interrupting conversations
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
A nice labelling for tree-like event structures of degree 3
Information and Computation
Model-based development of virtual laboratories for robotics over the internet
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on recent advances in biometrics
Tree-functors, determinacy and bisimulations
Mathematical Structures in Computer Science
Focusing in asynchronous games
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A geometric approach to the problem of unique decomposition of processes
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Abstraction for concurrent objects
Theoretical Computer Science
Model-checking games for fixpoint logics with partial order models
Information and Computation
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
Concurrent logic games on partial orders
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
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
Granularity and concurrent separation logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Real-time event structures and scott domains
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Architectural specifications for reactive systems
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
A category of higher-dimensional automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Composition and decomposition in true-concurrency
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Transition systems of elementary net systems with localities
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
Transfer of trust in event-based reputation systems
Theoretical Computer Science
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Transforming stream processing functions into state transition machines
SERA'04 Proceedings of the Second international conference on Software Engineering Research, Management and Applications
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A model for dynamic state-based systems
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
Event structure semantics of parallel extrusion in the pi-calculus
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Formal Relationships Between Geometrical and Classical Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed transition systems with independence and marked scott domains: an adjunction
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Multiplicative Transition Systems
Fundamenta Informaticae
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
An Axiomatic Characterization of Algebras of Processes of Petri Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Fundamenta Informaticae
Restriction-Based Concurrent System Design Using the Rough Set Formalism
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Synthesising Elementary Net Systems with Inhibitor Arcs from Step Transition Systems
Fundamenta Informaticae - Application of Concurrency to System Design
A Set-Theoretic Framework for Component Composition
Fundamenta Informaticae
Finite Completeness of Categories of Petri Nets
Fundamenta Informaticae
A Multi-region Linear Logic Based Calculus for Dynamic Petri Net Structures
Fundamenta Informaticae
The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs
Fundamenta Informaticae
A categorical observation of timed testing equivalence
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Rule-based modelling of cellular signalling
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A nice labelling for tree-like event structures of degree 3
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
View-based development of a simulation framework for multi-disciplinary environmental modelling
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Configuring business process models
ACM SIGSOFT Software Engineering Notes
On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
Journal of Combinatorial Theory Series B
Borel determinacy of concurrent games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Using transition systems to describe and predict the behaviour of structured excitable media
Natural Computing: an international journal
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
A Geometric View of Partial Order Reduction
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |