Elements of interaction: Turing award lecture
Communications of the ACM
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
An operational framework for value-passing processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Structured operational semantics as a specification language
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Liveness conditions in model-based service specifications: a case study
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Compiler correctness for parallel languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Using a Protean Language to Enhance Expressiveness in Specification
IEEE Transactions on Software Engineering
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering
A Consistent Causality-Based View on a Timed Process AlgebraIncluding Urgent Interactions
Formal Methods in System Design - Special issue: industrial critical systems
A survey of structured and object-oriented software specification methods and techniques
ACM Computing Surveys (CSUR)
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics study and reality of computing
ACM Computing Surveys (CSUR)
Flexible types for a concurrent model
Concurrent object-oriented programming and petri nets
The parallel composition of uniform processes with data
Theoretical Computer Science
Distributed processes and location failures
Theoretical Computer Science
Register-machine based processes
Journal of the ACM (JACM)
The regular viewpoint on PA-processes
Theoretical Computer Science
Information and Computation
Inheritance of workflows: an approach to tackling problems related to change
Theoretical Computer Science
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
ACM Transactions on Computational Logic (TOCL)
Simulation preorder over simple process algebras
Information and Computation
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Bisimulation indexes and their applications
Theoretical Computer Science
State space generation for the HAVi leader election protocol
Science of Computer Programming
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
Discrete Event Dynamic Systems
The box algebra = Petri nets + process expressions
Information and Computation
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Simulating and Analyzing Railway Interlockings in ExSpect
IEEE Parallel & Distributed Technology: Systems & Technology
A formal approach to object-oriented software engineering
Theoretical Computer Science - Rewriting logic and its applications
Fundamenta Informaticae
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Composition, decomposition and model checking of pushdown processes
Nordic Journal of Computing
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
GCSE '00 Proceedings of the Second International Symposium on Generative and Component-Based Software Engineering-Revised Papers
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Compiling process algebraic specifications into timed automata
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Time and Probability in Process Algebra
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Time and Asynchrony in Interactions among Distributed Real-Time Objects
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Specifying Processes with Dynamic Life Cycles
CAiSE '00 Proceedings of the 12th International Conference on Advanced Information Systems Engineering
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process Algebra
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Abstraction in Probabilistic Process Algebra
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Axiomatizing GSOS with Termination
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Proof-Checking Protocols Using Bisimulations
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Statecharts Via Process Algebra
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Generic Process Algebras for Asynchronous Communication
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Process Languages for Rooted Eager Bisimulation
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Specifying Complex Process Control Aspects in Workflows for Exception Handling
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
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
Synchronized Tree Languages Revisited and New Applications
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Graded Modalities and Resource Bisimulation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Generic Linear Business Process Modeling
ER '00 Proceedings of the Workshops on Conceptual Modeling Approaches for E-Business and The World Wide Web and Conceptual Modeling: Conceptual Modeling for E-Business and the Web
Combining Mobile Processes and Declarative Programming
CL '00 Proceedings of the First International Conference on Computational Logic
Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
A Complete Finite Prefix for Process Algebra
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
An Axiomatisation of Duplication Equivalence in the Petri Box Calculus
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
The Box Algebra - A Model of Nets and Process Expressions
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Identifying Commonalities and Differences in Object Life Cycles Using Behavioral Inheritance
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Making Work Flow: On the Application of Petri Nets to Business Process Management
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Process Algebra with Probabilistic Choice
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
On Simulation-Checking with Sequential Systems
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Formal and natural computing
A fully abstract model for the π-calculus
Information and Computation
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
From process algebra to visual language
CRPIT '02 Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12
A note on an expressiveness hierarchy for multi-exit iteration
Information Processing Letters
Fundamenta Informaticae
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Process algebra model of Ada protected objects
ACM SIGPLAN Notices
Mathematical Structures in Computer Science
Precise interprocedural dependence analysis of parallel programs
Theoretical Computer Science
Shuffle on positive varieties of languages
Theoretical Computer Science
Mining exact models of concurrent workflows
Computers in Industry - Special issue: Process/workflow mining
From process logic to program logic
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Science of Computer Programming - Methods of software design: Techniques and applications
Bisimulation on speed: worst-case efficiency
Information and Computation
Events as atomic contracts for component integration
Data & Knowledge Engineering - Special issue: Contract-driven coordination and collaboration in the internet context
Semirings in operations research and computer science: more algebra
Fundamenta Informaticae
Located actions in process algebra with timing
Fundamenta Informaticae
Web services: a process algebra approach
Proceedings of the 2nd international conference on Service oriented computing
Generating FSMs from interworkings
Distributed Computing
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Behavioural inheritance in the UML to model software product lines
Science of Computer Programming - Special issue: Software variability management
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
Business-to-business workflow interoperation based on process-views
Decision Support Systems
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Synchronous, asynchronous, and causally ordered communication
Distributed Computing
Distributed Computing - Special issue: Verification of lazy caching
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
Programming language semantics
Encyclopedia of Computer Science
Generating diagnostic information for behavioral preorders
Distributed Computing
When are two workflows the same?
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
A brief history of process algebra
Theoretical Computer Science - Process algebra
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
On the usability of process algebra: an architectural view
Theoretical Computer Science - Process algebra
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
Model-checking processes with data
Science of Computer Programming
Regular symbolic analysis of dynamic networks of pushdown systems
CONCUR 2005 - Concurrency Theory
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Formal specification of multi-agent e-barter systems
Science of Computer Programming
A theory of stochastic systems: part II: process algebra
Information and Computation
Decidable first-order transition logics for PA-processes
Information and Computation
Information and Computation
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Visual security protocol modeling
NSPW '05 Proceedings of the 2005 workshop on New security paradigms
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Branching bisimulation for probabilistic systems: characteristics and decidability
Theoretical Computer Science - Expressiveness in concurrency
On the expressiveness of timed coordination models
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Splitting bisimulations and retrospective conditions
Information and Computation
Theoretical Computer Science
A characterization of regular expressions under bisimulation
Journal of the ACM (JACM)
Behaviour Abstraction for Communicating Sequential Processes
Fundamenta Informaticae
Process Algebra with Nonstandard Timing
Fundamenta Informaticae
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Information and Computation
Data Anonymity in the FOO Voting Scheme
Electronic Notes in Theoretical Computer Science (ENTCS)
Impossibility Results in the Equational Logic of Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Note on Some Order Properties Related to Processes Semantics (I)
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
A regular viewpoint on processes and algebra
Acta Cybernetica
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis and verification of an automatic document feeder
Proceedings of the 2007 ACM symposium on Applied computing
Towards a Common Semantic Foundation for Use Cases and Task Models
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Turing award lectures
Verification of timed erlang/OTP components using the process algebra μcrl
ERLANG '07 Proceedings of the 2007 SIGPLAN workshop on ERLANG Workshop
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Symmetric electoral systems for ambient calculi
Information and Computation
A formalism for visual security protocol modeling
Journal of Visual Languages and Computing
Maurer computers for pipelined instruction processing†
Mathematical Structures in Computer Science
A framework for performance evaluation and functional verification in stochastic process algebras
Proceedings of the 2008 ACM symposium on Applied computing
Maurer Computers with Single-Thread Control
Fundamenta Informaticae
Weak parametric failure equivalences and their congruence formats
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
General Refinement, Part One: Interfaces, Determinism and Special Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Process Algebra with Local Communication
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric synchronizations in mobile nominal calculi
Theoretical Computer Science
Improving an interactive visualization of transition systems
Proceedings of the 4th ACM symposium on Software visualization
Verifying Erlang/OTP Components in μCRL
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Composition of Motion Description Languages
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Verifying Erlang Telecommunication Systems with the Process Algebra μCRL
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A Hierarchy of Equivalences for Probabilistic Processes
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
Concurrency, Graphs and Models
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Rule Format for Associativity
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Branching Bisimulation Congruence for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
TAPAs: A Tool for the Analysis of Process Algebras
Transactions on Petri Nets and Other Models of Concurrency I
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Theoretical Computer Science
Generating priority rewrite systems for OSOS process languages
Information and Computation
(Bi)simulations up-to characterise process semantics
Information and Computation
Formal specification and analysis of hardware systems in timed Chi
Nordic Journal of Computing
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
Petri Net Transformations for Business Processes --- A Survey
Transactions on Petri Nets and Other Models of Concurrency II
A Look Around the Corner: The Pi-Calculus
Transactions on Petri Nets and Other Models of Concurrency II
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
A Basic Parallel Process as a Parallel Pushdown Automaton
Electronic Notes in Theoretical Computer Science (ENTCS)
Formulating Agent Interaction for Ontology Evolution
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Dynamic Consistency in Process Algebra: From Paradigm to ACP
Electronic Notes in Theoretical Computer Science (ENTCS)
Structural Operational Semantics with First-Order Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
PVS Embedding of cCSP Semantic Models and Their Relationship
Electronic Notes in Theoretical Computer Science (ENTCS)
Transmission Protocols for Instruction Streams
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Teaching Concurrency: Theory in Practice
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Specification and planning of UAV missions: a process algebra approach
ACC'09 Proceedings of the 2009 conference on American Control Conference
From Bialgebraic Semantics to Congruence Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability Analysis of Synchronized PA Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Verification of Timed Systems Using Cones and Foci
Electronic Notes in Theoretical Computer Science (ENTCS)
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Decidable first-order transition logics for PA-processes
Information and Computation
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
Mathematical modelling of digital hardware systems in timed Chi
MIC '07 Proceedings of the 26th IASTED International Conference on Modelling, Identification, and Control
A concurrent dynamic logic of knowledge, belief and certainty for multi-agent systems
Knowledge-Based Systems
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A compositional model of time Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Problem-solving methods: understanding, description, development, and reuse
Problem-solving methods: understanding, description, development, and reuse
Safe compositional network sketches: formal framework
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
On a conjecture of schnoebelen
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A model of behaviour abstraction for communicating processes
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
UML'00 Proceedings of the 3rd international conference on The unified modeling language: advancing the standard
Large state space visualization
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Common semantics for use cases and task models
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
SC2SCFL: automated systemC to systemCFLtranslation
SAMOS'07 Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation
PRISMA: a mobile calculus with parametric synchronization
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
The reaction algebra: a formal language for event correlation
Pillars of computer science
A comparative study of STOPA and RTPA
Transactions on computational science II
An Interface Group for Process Components
Fundamenta Informaticae
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
On the operating unit size of load/store architectures†
Mathematical Structures in Computer Science
A pure labeled transition semantics for the applied pi calculus
Information Sciences: an International Journal
The expressive power of the shuffle product
Information and Computation
Reasoning about a distributed probabilistic system
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Interaction semantics with refusals, divergence, and destruction
Programming and Computing Software
Model-checking Erlang: a comparison between EtomCRL2 and McErlang
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Time abstraction in timed µCRL à la regions
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ACM Transactions on Computational Logic (TOCL)
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Scribbling interactions with a formal foundation
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Formal verification of SystemCFLspecifications using SPIN
MINO'06 Proceedings of the 5th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics
Qualitative reachability in stochastic BPA games
Information and Computation
Programming mental state abduction
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
On the refinement of liveness properties of distributed systems
Formal Methods in System Design
PREG axiomatizer: a ground bisimilarity checker for GSOS with predicates
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
On quantitative security policies
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Formal modeling
Towards a signal calculus for event-based synchronous languages
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Reversing algebraic process calculi
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
An algebra of petri nets with arc-based time restrictions
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Rule formats for determinism and idempotence
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Applying step coverability trees to communicating component-based systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Agent-Based approach for dynamic ontology management
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Dealing with non-local choice in IEEE 1073.2's standard for remote control
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Strong splitting bisimulation equivalence
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Final semantics for event-pattern reactive programs
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Weak stochastic bisimulation for non-markovian processes
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Some remarks on definability of process graphs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Timing the untimed: terminating successfully while being conservative
Processes, Terms and Cycles
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Model theory for process algebra
Processes, Terms and Cycles
Rule formats for determinism and idempotence
Science of Computer Programming
Implementation of a prototype for the new ASF+SDF meta-environment
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Specification of rewriting strategies
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Maurer Computers with Single-Thread Control
Fundamenta Informaticae
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Note on Some Order Properties Related to Processes Semantics (I)
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Distribution of a Simple Shared Dataspace Architecture
Fundamenta Informaticae
Semirings in Operations Research and Computer Science: More Algebra
Fundamenta Informaticae
Located Actions in Process Algebra with Timing
Fundamenta Informaticae
Fundamenta Informaticae
Fundamenta Informaticae
Process Algebra with Nonstandard Timing
Fundamenta Informaticae
Behaviour Abstraction for Communicating Sequential Processes
Fundamenta Informaticae
Formalisation of a Production System Modelling Language The operational semantics of χ Core
Fundamenta Informaticae
Representing Hand-Shake Channel Communication in the Calculus of Cause-Effect Structures
Fundamenta Informaticae
Parameterized Structured Operational Semantics
Fundamenta Informaticae
Discrete Time Process Algebra: Absolute Time, Relative Time And Parametric Time
Fundamenta Informaticae
Atomicity And Concurrency Control In Process Calculi
Fundamenta Informaticae
Fundamenta Informaticae
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
PROCESSES WITH MULTIPLE ENTRIES AND EXITS MODULO ISOMORPHISM AND MODULO BISIMULATION
Fundamenta Informaticae
Rational Processes And Linear Systems In Gsp
Fundamenta Informaticae
Bisimulation Semantics For Concurrency With Atomicity And Action Refinement
Fundamenta Informaticae
On the Shuffle of Star-Free Languages
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Open bisimulation for quantum processes
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Theoretical Computer Science
A Process Calculus with Finitary Comprehended Terms
Theory of Computing Systems
On the Behaviours Produced by Instruction Sequences under Execution
Fundamenta Informaticae
| Hi-index | 0.03 |