Groote, J.F. (Jan Friso), 1965-
Groote, Jan Frisco 1965-
Groote, J. F. (Jan Frisco), 1965-
Groote, J. F.
Jan Friso Groote
Groote, Jan Friso 1965-
Groote, Jan Frisco
Groote, Jan Friso
VIAF ID: 4111973 ( Personal )
Permalink: http://viaf.org/viaf/4111973
Preferred Forms
-
-
-
-
-
- 100 1 _ ‡a Groote, J. F. ‡q (Jan Friso), ‡d 1965-
-
-
- 100 1 _ ‡a Groote, Jan Frisco
-
- 100 1 _ ‡a Groote, Jan Frisco ‡d 1965-
-
- 100 1 _ ‡a Groote, Jan Friso ‡d 1965-
- 100 0 _ ‡a Jan Friso Groote
4xx's: Alternate Name Forms (11)
5xx's: Related Names (5)
- 510 2 _ ‡a Ontwerp en Analyse van Systemen (OAS)
- 510 2 _ ‡a Specification and Analysis of Embedded Systems
- 510 2 _ ‡a Technische Universiteit Eindhoven
- 510 2 _ ‡a Technische Universiteit Eindhoven ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Universiteit van Amsterdam
Works
Title | Sources |
---|---|
Algebraic verification of a distributed summation algorithm | |
An algorithm for the asynchronous Write-All problem based on process collision | |
Analysis of a distributed system for lifting trucks | |
Analysis of three hybrid systems in timed mCRL | |
Basic theorems for parallel processes in timed mCRL | |
A bounded retransmission protocol for large data packets | |
A checker for modal formulas for processes with data | |
Checking verifications of protocols and distributed systems by computer : extended version of a tutorial at CONCUR '98 | |
A complete axiomatisation of branching bisimulation for process algebras with alternative quantification over data : | |
A complete equational axiomatization for MPA with string iteration | |
Completeness of timed mCRL | |
Computer assisted manipulation of algebraic process specifications | |
CONCUR '91 : 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991 : proceedings | |
A correctness proof of the bakery protocol in mCRL : | |
An efficient algorithm for branching bisimulation and stuttering equivalence | |
Equivalence of the concave optimisation method and d'Agostino's tableaux for propositional logic | |
Focus points and convergent process operators : | |
Formalizing process algebraic verifications in the calculus of constructions | |
Invariants in process algebra with data | |
Linearization in parallel pCRL | |
Modeling and analysis of communicating systems, 2014: | |
Modeling and Reconfiguration of critical Business Processes for the purpose of a Business Continuity Management respecting Security, Risk and Compliance requirements at Credit Suisse using Algebraic Graph Transformation: Extended Version | |
A new strategy for proving ō-completeness applied to process algebra | |
A note on n similar parallel processes : | |
Operational semantics for Petri Net components | |
The parallel composition of uniform processes with data | |
Process algebra needs proof methodology | |
Process algebra with guards : combining Hoare logic with process algebra | |
Proof theory for micro CRL | |
The propositional formula checker HeerHugo | |
Resolution and binary decision diagrams cannot simulate each other polynomially | |
Semantics of specification languages (SoSL), c1994: | |
A short proof of the decidability of bisimulation for normed BPA-processes | |
Solving disjunctive/conjunctive boolean equation systems with alternating fixes points | |
Specification and verification of real time systems in ACP | |
State space reduction using partical t-confluence | |
State space visualization | |
Structured operational semantics and bisimulation as a congruence | |
The syntax and semantics of timed mCRL | |
Towards a formal mathematical vernacular | |
Transforming equality logic to propositional logic | |
Transition system specifications with negative premises | |
Typed lambda calculi and applications / M. Bezem, J. F. Groote (eds.). - Berlin, 1992. | |
Undecidable equivalences for basic process algebra | |
Verification of parallel systems via decomposition | |
Verification of propositional formulae by means of convex and concave transforms | |
Verification of temporal properties of processes in a setting with data | |
Waitfree distributed memory management by create, and read until deletion (CRUD) | |
We moeten software leren beheersen |